Statistical EL is ExpTime-complete
2019-11-02Unverified0· sign in to hype
Bartosz Bednarczyk
Unverified — Be the first to reproduce this paper.
ReproduceAbstract
We show that the consistency problem for Statistical EL ontologies, defined by Pe\~naloza 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.