Extending Forgetting-Based Abduction Using Nominals

Abductive reasoning produces hypotheses to explain new observations with respect to some background knowledge. This paper focuses on ABox abduction in ontologies, where knowledge is expressed in description logics and both the observations and hypotheses are ground statements. The input is expressed in the description logic \(\mathcal {ALC}\) and the observation can contain any set of \(\mathcal {ALC}\) concept or role assertions. The proposed approach uses forgetting to produce hypotheses in the form of a disjunctive set of axioms, where each disjunct is an independent explanation for the observation and the overall hypothesis is semantically minimal, i.e., makes the least assumptions required. Previous work on forgetting-based abduction is combined with the semantic forgetting method of the system FAME. The hypotheses produced are expressed in an extension of \(\mathcal {ALC}\) which uses nominals, role inverses and fixpoints: \(\mathcal {ALCOI}\mu (\nabla )\). This combination overcomes the inability of the existing forgetting-based approach to allow role assertions in observations and hypotheses, and enables the computation of other previously unreachable hypotheses. An experimental evaluation is performed using a prototype implementation of the method on a corpus of real world ontologies.

[1]  Practical TBox Abduction Based on Justification Patterns , 2017, AAAI.

[2]  Stephen Muggleton,et al.  Theory Completion Using Inverse Entailment , 2000, ILP.

[3]  Renate A. Schmidt,et al.  Forgetting Concept and Role Symbols in ALCOIHµ+(∇, ⊓)-Ontologies , 2016, IJCAI.

[4]  Stefan Schlobach,et al.  ABox Abduction in the Description Logic $\boldsymbol{\mathcal{ALC}}$ , 2010, Journal of Automated Reasoning.

[5]  Paul T. Groth,et al.  Concept Forgetting in ALCOI-Ontologies Using an Ackermann Approach , 2015 .

[6]  Szymon Klarman,et al.  ABox abduction in ALC using a DL tableau , 2012, SAICSIT '12.

[7]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

[8]  Diego Calvanese,et al.  Reasoning in Expressive Description Logics , 2001, Handbook of Automated Reasoning.

[9]  W. Ackermann Untersuchungen über das Eliminationsproblem der mathematischen Logik , 1935 .

[10]  Dov M. Gabbay,et al.  Second-Order Quantifier Elimination - Foundations, Computational Aspects and Applications , 2008, Studies in logic : Mathematical logic and foundations.

[11]  Peter A. Flach,et al.  On the relation between abduction and inductive learning , 2000 .

[12]  Renate A. Schmidt,et al.  FAME: An Automated Tool for Semantic Forgetting in Expressive Description Logics , 2018, IJCAR.

[13]  Jürg Kohlas,et al.  Handbook of Defeasible Reasoning and Uncertainty Management Systems , 2000 .

[14]  Stefan Schlobach,et al.  ABox Abduction in the Description Logic ALC , 2011, J. Autom. Reason..

[15]  Meghyn Bienvenu,et al.  Complexity of Abduction in the EL Family of Lightweight Description Logics , 2008, KR.

[16]  Jeff Heflin,et al.  LUBM: A benchmark for OWL knowledge base systems , 2005, J. Web Semant..

[17]  Patrick Koopmann,et al.  LETHE: Saturation-Based Reasoning for Non-Standard Reasoning Tasks , 2015, ORE.

[18]  Yizheng Zhao,et al.  Automated semantic forgetting for expressive description logics , 2018 .

[19]  Valentina Ivanova,et al.  Get My Pizza Right: Repairing Missing is-a Relations in ${\cal ALC}$ Ontologies , 2012, JIST.

[20]  Patrick Koopmann,et al.  Uniform Interpolation and Forgetting for ALC Ontologies with ABoxes , 2014, AAAI.

[21]  Renate A. Schmidt,et al.  Forgetting Concept and Role Symbols in ALCOIH\mu+(\top, \sqcap)-Ontologies , 2016, Description Logics.

[22]  Martin Homola,et al.  Tableau-Based ABox Abduction for the ALCHO Description Logic , 2017, Description Logics.

[23]  Boris Konev,et al.  Practical Uniform Interpolation and Forgetting for ALC TBoxes with Applications to Logical Difference , 2014, KR.

[24]  Christoph Wernhard,et al.  Abduction in Logic Programming as Second-Order Quantifier Elimination , 2013, FroCos.

[25]  Ulrike Sattler,et al.  A Case for Abductive Reasoning over Ontologies , 2006, OWLED.

[26]  Renate A. Schmidt,et al.  ABox Abduction via Forgetting in ALC , 2019, AAAI.

[27]  Georg Gottlob,et al.  The Complexity of Logic-Based Abduction , 1993, STACS.

[28]  Bijan Parsia,et al.  BioPortal Snapshot 30.06.2014 , 2014 .

[29]  Oliver Ray,et al.  Nonmonotonic abductive inductive learning , 2009, J. Appl. Log..

[30]  Kurt Konolige,et al.  Abduction Versus Closure in Causal Theories , 1992, Artif. Intell..

[31]  Jianfeng Du,et al.  Towards Practical ABox Abduction in Large OWL DL Ontologies , 2011, AAAI.

[32]  Carsten Lutz,et al.  Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics , 2011, IJCAI.

[33]  Patrick Doherty,et al.  Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas , 2001, IJCAI.

[34]  Raymond Mooney,et al.  Bayesian Abductive Logic Programs , 2010, StarAI@AAAI.

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

[36]  Fangzhen Lin,et al.  On strongest necessary and weakest sufficient conditions , 2000, Artif. Intell..