Data Complexity in Expressive Description Logics With Path Expressions
Logic in Computer Science
2024-06-12 v1 Artificial Intelligence
Computational Complexity
Abstract
We investigate the data complexity of the satisfiability problem for the very expressive description logic ZOIQ (a.k.a. ALCHb Self reg OIQ) over quasi-forests and establish its NP-completeness. This completes the data complexity landscape for decidable fragments of ZOIQ, and reproves known results on decidable fragments of OWL2 (SR family). Using the same technique, we establish coNEXPTIME-completeness (w.r.t. the combined complexity) of the entailment problem of rooted queries in ZIQ.
Cite
@article{arxiv.2406.07095,
title = {Data Complexity in Expressive Description Logics With Path Expressions},
author = {Bartosz Bednarczyk},
journal= {arXiv preprint arXiv:2406.07095},
year = {2024}
}
Comments
Accepted to IJCAI 2024. A version with the appendix will appear soon