Containment of Regular Path Queries Under Description Logic Constraints
Abstract
Query containment has been studied extensively in KR and databases, for different kinds of query languages and domain constraints. We address the longstanding open problem of containment under expressive description logic (DL) constraints for two-way regular path queries (2RPQs) and their conjunctions, which generalize conjunctive queries with the ability to express regular navigation. We show that, surprisingly, functionality constraints alone make containment of 2RPQs already ExpTime-hard. By employing automata-theoretic techniques, we also provide a matching upper bound that extends to very expressive DL constraints. For conjunctive 2RPQs we prove a further exponential jump in complexity, and provide again a matching upper bound for expressive DLs. Our techniques provide also a solution to the problem of query entailment over DL knowledge bases in which individuals in the ABox may be related through regular role-paths.
Cite
Text
Calvanese et al. "Containment of Regular Path Queries Under Description Logic Constraints." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-141Markdown
[Calvanese et al. "Containment of Regular Path Queries Under Description Logic Constraints." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/calvanese2011ijcai-containment/) doi:10.5591/978-1-57735-516-8/IJCAI11-141BibTeX
@inproceedings{calvanese2011ijcai-containment,
title = {{Containment of Regular Path Queries Under Description Logic Constraints}},
author = {Calvanese, Diego and Ortiz, Magdalena and Simkus, Mantas},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2011},
pages = {805-812},
doi = {10.5591/978-1-57735-516-8/IJCAI11-141},
url = {https://mlanthology.org/ijcai/2011/calvanese2011ijcai-containment/}
}