Towards Practical ABox Abduction in Large Description Logic Ontologies

ABox abduction is an important reasoning facility in Description Logics DLs. It finds all minimal sets of ABox axioms, called abductive solutions, which should be added to a background ontology to enforce entailment of an observation which is a specified set of ABox axioms. However, ABox abduction is far from practical by now because there lack feasible methods working in finite time for expressive DLs. To pave a way to practical ABox abduction, this paper proposes a new problem for ABox abduction and a new method for computing abductive solutions accordingly. The proposed problem guarantees finite number of abductive solutions. The proposed method works in finite time for a very expressive DL,, which underpins the W3C standard language OWL 2, and guarantees soundness and conditional completeness of computed results. Experimental results on benchmark ontologies show that the method is feasible and can scale to large ABoxes.

[1]  Raymond Y. K. Lau,et al.  Using Information Filtering in Web Data Mining Process , 2007, IEEE/WIC/ACM International Conference on Web Intelligence (WI'07).

[2]  Bert Van Nuffelen,et al.  A-System: Problem Solving through Abduction , 2001, IJCAI.

[3]  Paolo Mancarella,et al.  The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments , 2009, Theory and Practice of Logic Programming.

[4]  S. Melzer,et al.  Towards a Media Interpretation Framework for the Semantic Web , 2007, IEEE/WIC/ACM International Conference on Web Intelligence (WI'07).

[5]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[6]  Francesco M. Donini,et al.  A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN , 2004, Description Logics.

[7]  Amit P. Sheth.  Semantic Web: Ontology and Knowledge Base Enabled Tools, Services, and Applications , 2013 .

[8]  Lawrence Hunter,et al.  A Call for an Abductive Reasoning Feature in OWL-Reasoning Tools toward Ontology Quality Control , 2008, OWLED.

[9]  Eva Oliveira,et al.  Handbook of Research on Social Dimensions of Semantic Technologies and Web Services , 2009 .

[10]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

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

[12]  A. Sheth.  International Journal on Semantic Web & Information Systems , .

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

[14]  Paolo Mancarella,et al.  Database Updates through Abduction , 1990, VLDB.

[15]  Li Ma,et al.  Towards a Complete OWL Ontology Benchmark , 2006, ESWC.

[16]  Danny De Schreye,et al.  SLDNFA: An Abductive Procedure for Normal Abductive Programs , 1992, JICSLP.

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

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

[19]  Rafael Peñaloza,et al.  Axiom Pinpointing in General Tableaux , 2007, TABLEAUX.

[20]  Steffen Lamparter,et al.  Automata-Based Abduction for Tractable Diagnosis , 2010, Description Logics.

[21]  Yarden Katz,et al.  Pellet: A practical OWL-DL reasoner , 2007, J. Web Semant..

[22]  Hector J. Levesque,et al.  Abductive and Default Reasoning: A Computational Core , 1990, AAAI.

[23]  Francesco M. Donini,et al.  A Tableaux-based calculus for Abduction in Expressive Description Logics: Preliminary Results , 2009, Description Logics.

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

[25]  Tom Bylander,et al.  Numeric Query Answering on the Web , 2011, Int. J. Semantic Web Inf. Syst..

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

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

[28]  Francesco M. Donini,et al.  Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach , 2007, J. Artif. Intell. Res..

[29]  Boris Motik,et al.  A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes , 2006, LPAR.

[30]  Antonis C. Kakas,et al.  The role of abduction in logic programming , 1998 .

[31]  Georg Gottlob,et al.  The complexity of logic-based abduction , 1993, JACM.

[32]  N. Shinkura,et al.  Pushing the envelope: chromatin boundaries at the nuclear pore. , 2002, Molecular cell.

[33]  Boris Motik,et al.  Reasoning in Description Logics by a Reduction to Disjunctive Datalog , 2007, Journal of Automated Reasoning.

[34]  Bijan Parsia,et al.  Finding All Justifications of OWL DL Entailments , 2007, ISWC/ASWC.

[35]  Ian Horrocks,et al.  From SHIQ and RDF to OWL: the making of a Web Ontology Language , 2003, J. Web Semant..

[36]  M. Fitting.  First-order logic and automated theorem proving (2nd ed.) , 1996 .

[37]  Boris Motik,et al.  OWL 2: The next step for OWL , 2008, J. Web Semant..

[38]  Seungmin Rho,et al.  Music Retrieval and Recommendation Scheme Based on Varying Mood Sequences , 2010, Int. J. Semantic Web Inf. Syst..

[39]  Robert A. Kowalski,et al.  The Iff Proof Procedure for Abductive Logic Programming , 1997, J. Log. Program..

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

[41]  Li-Yan Yuan,et al.  Linear tabulated resolution based on Prolog control strategy , 2000, Theory and Practice of Logic Programming.

[42]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[43]  Michael Wessel,et al.  Towards a Media Interpretation Framework for the Semantic Web , 2007 .