Foundations of deductive databases and logic programming
Equivalence of datalog queries is undecidable
Journal of Logic Programming
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Reasoning on regular path queries
ACM SIGMOD Record
The Description Logic Handbook
The Description Logic Handbook
The Complexity of Conjunctive Query Answering in Expressive Description Logics
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM (JACM)
Terminological reasoning in SHIQ with ordered binary decision diagrams
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
Verification of knowledge bases based on containment checking
Artificial Intelligence
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
Expressive languages for path queries over graph-structured data
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SPARQL query containment under RDFS entailment regime
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Hi-index | 0.00 |
Query containment has been studied extensively in KR and databases, for different kinds of query languages and domain constraints. We address the longstanding open problem of containment under expressive description logic (DL) constraints for two-way regular path queries (2RPQs) and their conjunctions, which generalize conjunctive queries with the ability to express regular navigation. We show that, surprisingly, functionality constraints alone make containment of 2RPQs already EXPTIME-hard. By employing automata-theoretic techniques, we also provide a matching upper bound that extends to very expressive DL constraints. For conjunctive 2RPQs we prove a further exponential jump in complexity, and provide again a matching upper bound for expressive DLs. Our techniques provide also a solution to the problem of query entailment over DL knowledge bases in which individuals in the ABox may be related through regular role-paths.