Combining Horn rules and description logics in CARIN
Artificial Intelligence
Modal logic
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
A New One-Pass Tableau Calculus for PLTL
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Tableau Decision Procedure for $\mathcal{SHOIQ}$
Journal of Automated Reasoning
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
Journal of Automated Reasoning
Conjunctive query answering for the description logic SHIQ
Journal of Artificial Intelligence Research
Effective query rewriting with ontologies over DBoxes
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
Exact query reformulation with first-order ontologies and databases
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Ontology constraints in incomplete and complete data
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Ontology-based data access with closed predicates is inherently intractable (sometimes)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Exact query reformulation over databases with first-order and description logics ontologies
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Data in description logic knowledge bases is stored in the form of an ABox. ABoxes are often confusing for developers coming from relational databases because an ABox, in contrast to a database instance, provides an incomplete specification. A recently introduced assertional component of a description logic knowledge base is a DBox, which behaves more like a database instance. In this paper, we study the data complexity of query answering in the description logic DL-Lite"F extended with DBoxes. DL-Lite"F is a description logic tailored for data intensive applications and the data complexity of query answering in DL-Lite"F with ABoxes is tractable (in AC^0). Our main result is that this problem becomes coNP-complete with DBoxes. In some expressive description logics, query answering with DBoxes also leads to a higher (combined) complexity than query answering with ABoxes. As a proof of concept, we relate query answering in ALCFIO, i.e., ALC with Functional and Inverse roles, and nOminals to the same problem in ALCFI with DBoxes. The exact complexity of the former is an open problem in the description logic literature. Here we show that query answering in ALCFIO and ALCFI with DBoxes are mutually reducible to each other in polynomial time. All the proofs in this paper are available in the appendix for the reviewers@? convenience.