On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Portrait of the Semantic Web in Action
IEEE Intelligent Systems
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Conjunctive query answering for the description logic SHIQ
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Data complexity of reasoning in very expressive description logics
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
Journal of Automated Reasoning
The Complexity of Conjunctive Query Answering in Expressive Description Logics
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Extending Carin to the Description Logics of the $\mathcal{SH}$ Family
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Cheap Boolean Role Constructors for Description Logics
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Exploiting conjunctive queries in description logic programs
Annals of Mathematics and Artificial Intelligence
Formal Properties of Modularisation
Modular Ontologies
Query Answering in Description Logics: The Knots Approach
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Worst-case optimal conjunctive query answering for an expressive description logic without inverses
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Conjunctive query answering for the description logic SHIQ
Journal of Artificial Intelligence Research
Regular path queries in expressive description logics with nominals
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Query answering in description logics with transitive roles
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
Journal of Artificial Intelligence Research
Conjunctive query answering in the description logic SH using knots
Journal of Computer and System Sciences
A practical automata-based technique for reasoning in expressive description logics
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Data complexity of query answering in description logics
Artificial Intelligence
Conjunctive regular path queries in lightweight description logics
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to answer complex queries beyond instance retrieval, taking into account constraints expressed in a knowledge base. We consider this task for positive existential path queries (which generalize conjunctive queries and unions thereof), whose atoms are regular expressions over the roles (and concepts) of a knowledge base in the expressive DL ALCQIbreg. Using techniques based on two-way tree-automata, we first provide an elegant characterization of TBox and ABox reasoning, which gives us also a tight EXPTIME bound. We then prove decidability (more precisely, a 2EXPTIME upper bound) of query answering, thus significantly pushing the decidability frontier, both with respect to the query language and the considered DL. We also show that query answering is Exp-SPACE-hard already in rather restricted settings.