Query Answering Explanation in Inconsistent Datalog +/- Knowledge Bases

The paper addresses the problem of explaining Boolean Conjunctive Query BCQ entailment in the presence of inconsistency within the Ontology-Based Data Access OBDA setting, where inconsistency is handled by the intersection of closed repairs semantics ICR and the ontology is represented by Datalog$$+/-$$ rules. We address this problem in the case of both BCQ acceptance and failure by adopting a logical instantiation of abstract argumentation model; that is, in order to explain why the query is accepted or failed, we look for proponent or opponent sets of arguments in favor or against the query acceptance. We have also studied the computational complexity of the problem of finding an arbitrary explanation as well as all explanations.

[1]  Russell Greiner,et al.  A Correction to the Algorithm in Reiter's Theory of Diagnosis , 1989, Artif. Intell..

[2]  Abdallah Arioua,et al.  Query Failure Explanation in Inconsistent Knowledge Bases Using Argumentation , 2014, COMMA.

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

[4]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[5]  Amir Fijany,et al.  New approaches for efficient solution of hitting set problem , 2004 .

[6]  Dan Suciu,et al.  WHY SO? or WHY NO? Functional Causality for Explaining Query Answers , 2009, MUD.

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

[8]  Stefano Spaccapietra Journal on Data Semantics X , 2008, Journal on Data Semantics X.

[9]  Deborah L. McGuinness,et al.  Explaining Subsumption in Description Logics , 1995, IJCAI.

[10]  Andrea Calì,et al.  A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.

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

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

[13]  Diego Calvanese,et al.  Reasoning about Explanations for Negative Query Answers in DL-Lite , 2013, J. Artif. Intell. Res..

[14]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[15]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[16]  Stefan Schlobach,et al.  Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies , 2003, IJCAI.

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

[18]  Madalina Croitoru,et al.  What Can Argumentation Do for Inconsistent Ontology Query Answering? , 2013, SUM.

[19]  Peter F. Patel-Schneider,et al.  Usability Issues in Knowledge Representation Systems , 1998, AAAI/IAAI.

[20]  Bijan Parsia,et al.  Justification Oriented Proofs in OWL , 2010, SEMWEB.

[21]  L. Richard Ye,et al.  The Impact of Explanation Facilities in User Acceptance of Expert System Advice , 1995, MIS Q..

[22]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[23]  Sebastian Rudolph,et al.  Walking the Complexity Lines for Generalized Guarded Existential Rules , 2011, IJCAI.

[24]  Abdallah Arioua,et al.  Query Failure Explanation in Inconsistent Knowledge Bases: A Dialogical Approach , 2014, SGAI Conf..

[25]  Madalina Croitoru,et al.  Query Failure Explanation in Inconsistent Knowledge Bases : An Argumentation Approach , 2014 .

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