Statistical EL is ExpTime-complete
Logic in Computer Science
2021-03-08 v5 Artificial Intelligence
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.
Cite
@article{arxiv.1911.00696,
title = {Statistical EL is ExpTime-complete},
author = {Bartosz Bednarczyk},
journal= {arXiv preprint arXiv:1911.00696},
year = {2021}
}
Comments
Major revision of the previous version, extra lemma provided, a few grammar corrections. Under submission to IPL