We show that the consistency problem for Statistical ontologies, defined by Pe\~{n}aloza and Potyka, is ExpTime-hard. Together with recent results of Baader and Ecke, we conclude ExpTime-completeness of the logic. Our proof goes via a reduction from the consistency problem for EL extended with negation of atomic concepts.
View on arXiv