From Classical to Consistent Query Answering under Existential Rules

Querying inconsistent ontologies is an intriguing new problem that gave rise to a flourishing research activity in the description logic (DL) community. The computational complexity of consistent query answering under the main DLs is rather well understood; however, little is known about existential rules. The goal of the current work is to perform an in-depth analysis of the complexity of consistent query answering under the main decidable classes of existential rules enriched with negative constraints. Our investigation focuses on one of the most prominent inconsistency-tolerant semantics, namely, the AR semantics. We establish a generic complexity result, which demonstrates the tight connection between classical and consistent query answering. This result allows us to obtain in a uniform way a relatively complete picture of the complexity of our problem.

[1]  Maurizio Lenzerini,et al.  Inconsistency-Tolerant Semantics for Description Logics , 2010, RR.

[2]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[3]  Thomas Schwentick,et al.  Rewriting Ontological Queries into Small Nonrecursive Datalog Programs , 2011, Description Logics.

[4]  Riccardo Rosati,et al.  Tractable Approximations of Consistent Query Answering for Robust Ontology-based Data Access , 2013, IJCAI.

[5]  Thomas Lukasiewicz,et al.  Complexity of Inconsistency-Tolerant Query Answering in Datalog+/- under Cardinality-Based Repairs , 2019, SEBD.

[6]  Andrea Calì,et al.  Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[7]  Jan Chomicki,et al.  Consistent query answers in inconsistent databases , 1999, PODS '99.

[8]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[9]  Georg Gottlob,et al.  On the Complexity of Single-Rule Datalog Queries , 1999, LPAR.

[10]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..

[11]  Evgeny Dantsin,et al.  Complexity of Query Answering in Logic Databases with Complex Values , 1998 .

[12]  Andrea Calì,et al.  Towards more expressive ontology languages: The query answering problem , 2012, Artif. Intell..

[13]  Andrea Calì,et al.  Taming the Infinite Chase: Query Answering under Expressive Relational Constraints , 2008, Description Logics.

[14]  Martin Fürer,et al.  The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems) , 1983, Logic and Machines.

[15]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[16]  Andrei Voronkov,et al.  Complexity of nonrecursive logic programs with complex values , 1998, PODS.

[17]  Diego Calvanese,et al.  Linking Data to Ontologies , 2008, J. Data Semant..

[18]  Meghyn Bienvenu,et al.  On the Complexity of Consistent Query Answering in the Presence of Simple Ontologies , 2012, AAAI.

[19]  Thomas Lukasiewicz,et al.  Inconsistency Handling in Datalog+/- Ontologies , 2012, ECAI.

[20]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[21]  Georg Gottlob,et al.  Polynomial Combined Rewritings for Existential Rules , 2014, KR.

[22]  Riccardo Rosati,et al.  On the Complexity of Dealing with Inconsistency in Description Logic Ontologies , 2011, IJCAI.

[23]  L. Hemachandra.  The strong exponential hierarchy collapses , 1987, STOC 1987.