Regular Path Queries in Expressive Description Logics with Nominals
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 714-719.
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
@inproceedings{ijcai2009p124,
title = {Regular Path Queries in Expressive Description Logics with Nominals},
author = {Calvanese, Diego and Eiter, Thomas and Ortiz, Magdalena},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {714--719},
year = {2009},
url = {https://ijcai.org/proceedings/2009/124},
}
TY - CPAPER TI - Regular Path Queries in Expressive Description Logics with Nominals AU - Calvanese, Diego AU - Eiter, Thomas AU - Ortiz, Magdalena T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 714 EP - 719 UR - https://ijcai.org/proceedings/2009/124 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
