Error-Tolerant Reasoning in the Description Logic EL

Developing and maintaining ontologies is an expensive and error-prone task. After an error is detected, users may have to wait for a long time before a corrected version of the ontology is available. In the meantime, one might still want to derive meaningful knowledge from the ontology, while avoiding the known errors. We study error-tolerant reasoning tasks in the description logic EL. While these problems are intractable, we propose methods for improving the reasoning times by precompiling information about the known errors and using proof-theoretic techniques for computing justifications. A prototypical implementation shows that our approach is feasible for large ontologies used in practice.

[1]  Georg Gottlob,et al.  Identifying the Minimal Transversals of a Hypergraph and Related Problems , 1995, SIAM J. Comput..

[2]  Christos H. Papadimitriou,et al.  The even-path problem for graphs and digraphs , 1984, Networks.

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

[4]  Rafael Peñaloza,et al.  Pinpointing in the Description Logic EL , 2007, Description Logics.

[5]  Yevgeny Kazakov,et al.  From Polynomial Procedures to Efficient Reasoning with EL Ontologies , 2013 .

[6]  Rafael Peñaloza,et al.  Context-dependent views to axioms and consequences of Semantic Web ontologies , 2012, J. Web Semant..

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

[8]  Rafael Peñaloza,et al.  On the Complexity of Axiom Pinpointing in the EL Family of Description Logics , 2010, KR.

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

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

[11]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

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

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

[14]  Franz Baader,et al.  Debugging SNOMED CT Using Axiom Pinpointing in the Description Logic EL+ , 2008, KR-MED.

[15]  Sebastian Brandt,et al.  Polynomial Time Reasoning in a Description Logic with Existential Restrictions, GCI Axioms, and - What Else? , 2004, ECAI.

[16]  Rafael Peñaloza,et al.  Automata-Based Axiom Pinpointing , 2010, Journal of Automated Reasoning.

[17]  Richard Booth,et al.  First steps in EL contraction , 2009 .

[18]  Rafael Peñaloza,et al.  Complexity of Axiom Pinpointing in the DL-Lite Family , 2010, Description Logics.

[19]  Rafael Peñaloza,et al.  Axiom pinpointing in description logics and beyond , 2009 .

[20]  Franz Baader,et al.  How Pervasive Is the Myerson-Satterthwaite Impossibility? , 2009, IJCAI.

[21]  Michel Ludwig.  Just: a Tool for Computing Justifications w.r.t. ELH Ontologies , 2014, ORE.

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

[23]  Yevgeny Kazakov,et al.  Consequence-Driven Reasoning for Horn SHIQ Ontologies , 2009, IJCAI.

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

[25]  Li Lin,et al.  The computation of hitting sets: Review and new algorithms , 2003, Inf. Process. Lett..

[26]  R. Peñaloza,et al.  Error-Tolerant Reasoning in the Description Logic , 2014 .

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

[28]  Giorgio Gallo,et al.  Directed Hypergraphs and Applications , 1993, Discret. Appl. Math..

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

[30]  Thomas Lukasiewicz,et al.  Proceedings of the Fourth international conference on Web reasoning and rule systems , 2010 .