An ALC Description Default Logic with Exceptions-First

Knowledge formalization and reasoning automation are central within Artificial Intelligence. Classical logic has been traditionally used for such purposes. However, it is better suited to deal with complete knowledge in ideal circumstances. In real situations, in which the knowledge is partial, classical logic is not sufficient since it is monotonic. No monotonic logics have been proposed to better cope with practical reasoning. A successful formalization of no monotonic reasoning is Reiter's default logic which extends classical logic with default rules. Unfortunately, default logic is undividable. One reason for that is the use of classical logic as its monotonic basis. In this work, we change the default logic monotonic basis and propose a new default logic based on the description logic ALC. This new default logic is decidable and useful to formalize practical reasoning on hierarchical ontology's with exceptions, specially the ones that deals with legal knowledge and reasoning. On the default counterpart, we add some restrictions to the application of defaults in order to obtain nice properties such as coherence and elimination of anomalous extensions. We present the main algorithms used to build the extensions for this logic with its complexity analysis.

[1]  Drew McDermott,et al.  Default Reasoning, Nonmonotonic Logics, and the Frame Problem , 1986, AAAI.

[2]  Guido Governatori,et al.  Defeasible Description Logics , 2004, RuleML.

[3]  Laura Giordano,et al.  ALC + T: a Preferential Extension of Description Logics , 2009, Fundam. Informaticae.

[4]  Alexander Schwartz Reasoning With Incomplete Information , 2016 .

[5]  Laura Giordano,et al.  A non-monotonic Description Logic for reasoning about typicality , 2013, Artif. Intell..

[6]  Drew McDermott,et al.  Nonmonotonic Logic and Temporal Projection , 1987, Artif. Intell..

[7]  Francesco M. Donini,et al.  Exptime Tableaux for ALC , 2000, Description Logics.

[8]  Umberto Straccia Default Inheritance Reasoning in Hybrid KL-ONE-Style Logics , 1993, IJCAI.

[9]  Franz Baader,et al.  How to Prefer More Specific Defaults in Terminological Default Logic , 1993, IJCAI.

[10]  Thomas Eiter,et al.  Realizing Default Logic over Description Logic Knowledge Bases , 2009, ECSQARU.

[11]  Umberto Straccia,et al.  Rational Closure for Defeasible Description Logics , 2010, JELIA.

[12]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[13]  Franz Baader,et al.  Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic , 1995, Journal of Automated Reasoning.

[14]  Dirk van Dalen,et al.  Logic and structure , 1980 .

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

[16]  Daniel Lehmann,et al.  What does a Conditional Knowledge Base Entail? , 1989, Artif. Intell..

[17]  Jeff Z. Pan,et al.  Rules and Rule Markup Languages for the Semantic Web , 2003, Lecture Notes in Computer Science.

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

[19]  Sarit Kraus,et al.  Nonmonotonic Reasoning, Preferential Models and Cumulative Logics , 1990, Artif. Intell..

[20]  Matthew L. Ginsberg,et al.  Readings in Nonmonotonic Reasoning , 1987, AAAI 1987.

[21]  Franz Baader,et al.  Embedding defaults into terminological knowledge representation formalisms , 1995, Journal of Automated Reasoning.

[22]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[23]  Christos H. Papadimitriou,et al.  Elements of the Theory of Computation , 1997, SIGA.