15
1
v1v2v3v4v5 (latest)

Statistical EL is ExpTime-complete

Abstract

We show that the consistency problem for Statistical EL ontologies, defined by Pe{\~{n}}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.

View on arXiv
Comments on this paper