Lexicographical Inference over Inconsistent DL-Based Ontologies

Logical inconsistency may often occur throughout the development stage of a DL-based ontology. We apply the lexicographic inference to reason over inconsistent DL-based ontologies without repairing them first. We address the problem of checking consequences in a $\mathcal{SHIQ}$ ontology that are classically inferred from every consistent (or coherent) subontology having the highest lexicographic precedence . We propose a method for compiling a $\mathcal{SHIQ}$ ontology to a propositional program so that the problem can be solved in polynomial calls to a SAT solver. We prove that this time complexity is worst-case optimal in data complexity. In order to make the method more scalable, we also present partition-based techniques to optimize the calling of SAT solvers.

[1]  Domenico Lembo,et al.  Consistent Query Answering over Description Logic Ontologies , 2007, Description Logics.

[2]  Pascal Hitzler,et al.  Algorithms for Paraconsistent Reasoning with OWL , 2007, ESWC.

[3]  Bijan Parsia,et al.  Repairing Unsatisfiable Concepts in OWL Ontologies , 2006, ESWC.

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

[5]  Enrico Motta,et al.  The Semantic Web - ISWC 2005, 4th International Semantic Web Conference, ISWC 2005, Galway, Ireland, November 6-10, 2005, Proceedings , 2005, SEMWEB.

[6]  Karem A. Sakallah,et al.  Pueblo: A Hybrid Pseudo-Boolean SAT Solver , 2006, J. Satisf. Boolean Model. Comput..

[7]  Didier Dubois,et al.  Inconsistency Management and Prioritized Syntax-Based Entailment , 1993, IJCAI.

[8]  Michael Clarke,et al.  Symbolic and Quantitative Approaches to Reasoning and Uncertainty , 1991, Lecture Notes in Computer Science.

[9]  Niklas Sörensson,et al.  Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..

[10]  Wayne Snyder,et al.  Basic Paramodulation , 1995, Inf. Comput..

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

[12]  Frank van Harmelen,et al.  Reasoning with Inconsistent Ontologies , 2005, IJCAI.

[13]  Albert Rubio,et al.  Theorem Proving with Ordering and Equality Constrained Clauses , 1995, J. Symb. Comput..

[14]  David A. Plaisted,et al.  A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[15]  Jacek Malinowski,et al.  Trends in logic : 50 years of Studia Logica , 2003 .

[16]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[17]  Gerald Pfeifer,et al.  A Deductive System for Non-Monotonic Reasoning , 1997, LPNMR.

[18]  Ian Horrocks,et al.  Practical Reasoning for Very Expressive Description Logics , 2000, Log. J. IGPL.

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

[20]  Didier Dubois,et al.  How to Infer from Inconsisent Beliefs without Revising? , 1995, IJCAI.

[21]  Heinrich Wansing,et al.  Inconsistency-tolerant Description Logic: Motivation and Basic Systems , 2003 .

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

[23]  Lora Aroyo,et al.  The Semantic Web: Research and Applications , 2009, Lecture Notes in Computer Science.

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

[25]  Stefan Schlobach,et al.  Diagnosing Terminologies , 2005, AAAI.

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

[27]  Frank van Harmelen,et al.  A Framework for Handling Inconsistency in Changing Ontologies , 2005, SEMWEB.

[28]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[29]  Jianfeng Du,et al.  Computing minimum cost diagnoses to repair populated DL-based ontologies , 2008, WWW.

[30]  Guilin Qi,et al.  A revision-based approach to handling inconsistency in description logics , 2006, Artificial Intelligence Review.

[31]  Bijan Parsia,et al.  Debugging OWL ontologies , 2005, WWW '05.

[32]  Richard Booth,et al.  Knowledge Integration for Description Logics , 2005, AAAI.

[33]  Boris Motik,et al.  Reasoning in description logics using resolution and deductive databases , 2006 .

[34]  Boris Motik,et al.  A Resolution-Based Decision Procedure for SHOIQ , 2006, IJCAR.

[35]  Claudette Cayrol,et al.  On the Complexity of Non-Monotonic Entailment in Syntax-Based Approaches , 1994 .