Statistical EL is ExpTime-complete
arXiv:1911.00696
Abstract
We show that the consistency problem for Statistical EL ontologies, defined by Pe{ñ}aloza and Potyka, is ExpTime-hard. Together with existing ExpTime upper bounds, 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.
Major revision of the previous version, extra lemma provided, a few grammar corrections. Under submission to IPL