A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Regular Path Queries in Expressive Description Logics with Nominals
2009
International Joint Conference on Artificial Intelligence
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
dblp:conf/ijcai/CalvaneseEO09
fatcat:ptyzm6t5jjc35fts6nh2btzesi