Regular path queries in expressive description logics with nominals

Authors:
Diego Calvanese;Thomas Eiter;Magdalena Ortiz
Affiliations:
KRDB Research Centre, Free University of Bozen-Bolzano, Bolzano, Italy;Institute of Information Systems, Vienna University of Technology, Vienna, Austria;Institute of Information Systems, Vienna University of Technology, Vienna, Austria
Venue:
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Year:
2009

Citing 6
Cited 5

The Hybrid µ-Calculus

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Data Complexity of Query Answering in Expressive Description Logics via Tableaux

Journal of Automated Reasoning
OWL 2: The next step for OWL

Web Semantics: Science, Services and Agents on the World Wide Web
Answering regular path queries in expressive description logics: an automata-theoretic approach

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
The complexity of reasoning with cardinality restrictions and nominals in expressive description logics

Journal of Artificial Intelligence Research

Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!

Journal of Artificial Intelligence Research
Foundations of description logics

RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Conjunctive query answering in the description logic SH using knots

Journal of Computer and System Sciences
Containment of regular path queries under description logic constraints

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Conjunctive regular path queries in lightweight description logics

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.