\exists -ASP for Computing Repairs with Existential Ontologies

Repair-based techniques are a standard way of dealing with inconsistency in the context of ontology-based data access where several inconsistency-tolerant semantics have been mainly proposed for lightweight description logics. In this paper we present a generic transformation from knowledge bases expressed within existential rules formalism into an ASP program. We propose different strategies for this transformation, and highlight the ones for which answer sets of the generated program correspond to various kinds of repairs used in inconsistency-tolerant inferences.

[1]  Hai Wan,et al.  Query Answering with Inconsistent Existential Rules under Stable Model Semantics , 2016, AAAI.

[2]  Leopoldo E. Bertossi,et al.  Database Repairing and Consistent Query Answering , 2011, Database Repairing and Consistent Query Answering.

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

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

[5]  Jean-François Baget,et al.  Extending Acyclicity Notions for Existential Rules , 2014, ECAI.

[6]  Didier Dubois,et al.  Some Syntactic Approaches to the Handling of Inconsistent Knowledge Bases: A Comparative Study Part 1: The Flat Case , 1997, Stud Logica.

[7]  Igor Stéphan,et al.  ASPeRiX, a first-order forward chaining approach for answer set computing , 2017, Theory Pract. Log. Program..

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

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

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

[11]  Pascal Nicolas,et al.  ASPeRiX, a first-order forward chaining approach for answer set computing* , 2009, Theory and Practice of Logic Programming.

[12]  Maurizio Lenzerini,et al.  Inconsistency-tolerant query answering in ontology-based data access , 2015, J. Web Semant..

[13]  Meghyn Bienvenu,et al.  Inconsistency-Tolerant Querying of Description Logic Knowledge Bases , 2016, Reasoning Web.

[14]  Thomas Lukasiewicz,et al.  From Classical to Consistent Query Answering under Existential Rules , 2015, AMW.

[15]  Salem Benferhat,et al.  How to Select One Preferred Assertional-Based Repair from Inconsistent and Prioritized DL-Lite Knowledge Bases? , 2015, IJCAI.

[16]  Jean-François Baget,et al.  On rules with existential variables: Walking the decidability line , 2011, Artif. Intell..

[17]  Jean-François Baget,et al.  Revisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic Negation , 2014, NMR 2014.

[18]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[19]  Madalina Croitoru,et al.  A General Modifier-Based Framework for Inconsistency-Tolerant Query Answering , 2016, KR.

[20]  François Goasdoué,et al.  Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics , 2014, Description Logics.