Statistical EL is ExpTime-complete

We show that the consistency problem for Statistical EL ontologies, defined by Peñaloza and Potyka, is ▪-hard. Together with existing ▪ upper bounds, we conclude ▪-completeness of the logic. Our proof goes via a reduction from the consistency problem for EL extended with negation of atomic concepts. •We proved that the consistency problem for Statistical EL ontologies is ExpTime-complete.•Our proof went via a reduction from the consistency problem for EL extended with negation of atomic concepts.•Probabilistic conditionals can express that exactly half of the domain elements belong to a certain concept.