Statistical EL is ExpTime-complete
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 Nov 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.