Statistical EL is ExpTime-complete

Download PDF
Open Webpage

Bartosz Bednarczyk

Published: 01 Jan 2019, Last Modified: 09 Aug 2024CoRR 2019EveryoneRevisionsBibTeXCC BY-SA 4.0
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.