Regular Path Queries in Expressive Description Logics with Nominals
Abstract
Reasoning over complex queries in the DLs underlying OWL 2 is of importance in several application domains. We provide decidability and (tight) upper bounds for the problem of checking entailment and containment of positive regular path queries under various combinations of constructs used in such expressive DLs; specifically: regular expressions and (safe) Booleans over roles, and allowing for the combination of any two constructs among inverse roles, qualified number restrictions, and nominals. Our results carry over also to the DLs of the SR family, and thus have a direct impact on OWL 2. Diego Calvanese, Thomas Eiter, Magdalena Ortiz
Cite
Text
Calvanese et al. "Regular Path Queries in Expressive Description Logics with Nominals." International Joint Conference on Artificial Intelligence, 2009.Markdown
[Calvanese et al. "Regular Path Queries in Expressive Description Logics with Nominals." International Joint Conference on Artificial Intelligence, 2009.](https://mlanthology.org/ijcai/2009/calvanese2009ijcai-regular/)BibTeX
@inproceedings{calvanese2009ijcai-regular,
title = {{Regular Path Queries in Expressive Description Logics with Nominals}},
author = {Calvanese, Diego and Eiter, Thomas and Ortiz, Magdalena},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2009},
pages = {714-720},
url = {https://mlanthology.org/ijcai/2009/calvanese2009ijcai-regular/}
}