On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Combining Horn rules and description logics in CARIN
Artificial Intelligence
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Enterprise integration with ERP and EAI
Communications of the ACM
A Portrait of the Semantic Web in Action
IEEE Intelligent Systems
A Conjunctive Query Language for Description Logic Aboxes
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Conjunctive query containment and answering under description logic constraints
ACM Transactions on Computational Logic (TOCL)
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
Journal of Automated Reasoning
Undirected connectivity in log-space
Journal of the ACM (JACM)
Query Answering in the Description Logic Horn-$\mathcal{SHIQ}$
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
A general datalog-based framework for tractable query answering over ontologies
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DL-Lite: tractable description logics for ontologies
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 4
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
Conjunctive query answering for the description logic SHIQ
Journal of Artificial Intelligence Research
Data complexity of reasoning in very expressive description logics
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Verification of knowledge bases based on containment checking
Artificial Intelligence
Query answering in description logics with transitive roles
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
The DL-lite family and relations
Journal of Artificial Intelligence Research
Data complexity in the ƐL family of description logics
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Journal on data semantics X
Query answering under non-guarded rules in datalog+/-
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Advanced processing for ontological queries
Proceedings of the VLDB Endowment
On rules with existential variables: Walking the decidability line
Artificial Intelligence
Ontological queries: Rewriting and optimization
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
The MASTRO system for ontology-based data access
Semantic Web
The limits of querying ontologies
ICDT'07 Proceedings of the 11th international conference on Database Theory
CEL: a polynomial-time reasoner for life science ontologies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
TrOWL: tractable OWL 2 reasoning infrastructure
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
Walking the complexity lines for generalized guarded existential rules
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Extending decidable existential rules by joining acyclicity and guardedness
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Optimizing query rewriting in ontology-based data access
Proceedings of the 16th International Conference on Extending Database Technology
Charting the tractability frontier of certain conjunctive query answering
Proceedings of the 32nd symposium on Principles of database systems
Description logic knowledge and action bases
Journal of Artificial Intelligence Research
Querying the guarded fragment with transitivity
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
An integrated environment for reasoning over ontologies via logic programming
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Hi-index | 0.00 |
In this paper we study data complexity of answering conjunctive queries over description logic (DL) knowledge bases constituted by a TBox and an ABox. In particular, we are interested in characterizing the FOL-rewritability and the polynomial tractability boundaries of conjunctive query answering, depending on the expressive power of the DL used to express the knowledge base. FOL-rewritability means that query answering can be reduced to evaluating queries over the database corresponding to the ABox. Since first-order queries can be expressed in SQL, the importance of FOL-rewritability is that, when query answering enjoys this property, we can take advantage of Relational Data Base Management System (RDBMS) techniques for both representing data, i.e., ABox assertions, and answering queries via reformulation into SQL. What emerges from our complexity analysis is that the description logics of the DL-Lite family are essentially the maximal logics allowing for conjunctive query answering through standard database technology. In this sense, they are the first description logics specifically tailored for effective query answering over very large ABoxes.