Default logic

When an intelligent system (either computer–based or human) tries to solve a problem, it may be able to rely on complete information about this problem, and its main task is to draw the correct conclusions using classical reasoning. In such cases classical predicate logic may be sufficient. However in many situations the system has only incomplete information at hand, be it because some pieces of information are unavailable, be it because it has to respond quickly and does not have the time to collect all relevant data. Classical logic has indeed the capacity to represent and reason with certain aspects of incomplete information. But there are occasions in which additional information needs to be “filled in” to overcome the incompleteness, for example because certain decisions must be made. In such cases the system has to make some plausible conjectures, which in the case of default reasoning are based on rules of thumb, called defaults. For example, an emergency doctor has to make some conjectures about the most probable causes of the symptoms observed. Obviously it would be inappropriate to await the results of possibly extensive and time–consuming tests before beginning with the treatment. When decisions are based on assumptions, these may turn out to be wrong in the face of additional information that becomes available; for example, medical tests may lead to a modified diagnosis. The phenomenon of having to take back some previous conclusions is called nonmonotonicity; it says that if a statement φ follows from a set of premises M and M ⊆ M ′, φ does not necessarily follow from M ′. Default Logic, originally presented in [Reiter, 1980], provides formal methods to support this kind of reasoning. Default Logic is perhaps the most prominent method for nonmonotonic reasoning, basically because of the simplicity of the notion of a default, and because defaults prevail in many application areas. However there exist several alternative design decisions which have led to variations of the initial idea; actually we can talk of a family of default reasoning methods because they share the same foundations. In this paper we present the motivations and basic ideas of some of the most important default logic variants, and compare them both with respect to interconnections and the fulfillment of some properties. The key idea underlying all default reasoning methods is the use of rules allowing for “jumping to conclusions” even in the absence of certain information. In other words, this is the proposed solution to the problem of reasoning with incomplete information, as described above. In addition, default reasoning can be viewed as an approach to reasoning with inconsistent information. It is well documented that classical “collapses” in the

[1]  Raymond Reiter,et al.  On Inheritance Hierarchies With Exceptions , 1983, AAAI.

[2]  Grigoris Antoniou,et al.  Studying Properties of Classes of Default Logics - Preliminary Report , 1996, PRICAI.

[3]  David Poole,et al.  Default logic , 1994 .

[4]  M. Gelfond,et al.  Disjunctive Defaults , 1991 .

[5]  David Poole,et al.  An expert system for educational diagnosis based on default logic , 1987 .

[6]  Teodor C. Przymusinski An Algorithm to Compute Circumscription , 1989, Artif. Intell..

[7]  Matthew L. Ginsberg A Circumscriptive Theorem Prover , 1989, Artif. Intell..

[8]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[9]  Francesco M. Donini,et al.  Is Intractability of Non-Monotonic Reasoning a Real Drawback? , 1994, AAAI.

[10]  Hector J. Levesque,et al.  Hard problems for simple default logics , 1992 .

[11]  Torsten Schaub Assertional Default Theories: A Semantical View , 1991, KR.

[12]  David Poole,et al.  What the Lottery Paradox Tells Us About Default Reasoning , 1989, KR.

[13]  Robert E. Mercer Deriving natural language presuppositions from complex conditionals , 1990 .

[14]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[15]  J. McCarthy CIRCUMSCRIPTION — A FORM OF NONMONOTONIC REASONING , 2007 .

[16]  Fangzhen Lin,et al.  Epistemic Semantics for Fixed-Points Non-Monotonic Logics , 1990, TARK.

[17]  Witold Lukaszewicz Two Results on Default Logic , 1985, IJCAI.

[18]  David Poole,et al.  Representing Knowledge for Logic-Based Diagnosis , 1988, FGCS.

[19]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[20]  Gerhard Brewka Cumulative Default Logic: In Defense of Nonmonotonic Inference Rules , 1991, Artif. Intell..

[21]  David Poole,et al.  On the Comparison of Theories: Preferring the Most Specific Explanation , 1985, IJCAI.

[22]  Ilkka Niemelä Towards Efficient Default Reasoning , 1995, IJCAI.

[23]  Gerhard Brewka,et al.  Nonmonotonic Reasoning: Logical Foundations of Commonsense By Gerhard Brewka (Cambridge University Press, 1991) , 1991, SGAR.

[24]  Robert E. Mercer,et al.  On the adequacy of predicate circumscription for closed‐world reasoning , 1985, Comput. Intell..

[25]  David Poole,et al.  Explanation and prediction: an architecture for default and abductive reasoning , 1989, Comput. Intell..

[26]  R. Goebel,et al.  APPLYING THEORY FORMATION TO THE PLANNING PROBLEM , 1987 .

[27]  David Poole Variables in Hypotheses , 1987, IJCAI.

[28]  Gerhard Brewka Nonmonotonic reasoning: from theoretical foundation towards efficient computation , 1989 .

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

[30]  David Poole,et al.  The Effect of Knowledge on Belief: Conditioning, Specificity and the Lottery Paradox in Default Reasoning , 1991, Artif. Intell..

[31]  Witold Łukaszewicz Non-monotonic reasoning : formalization of commonsense reasoning , 1990 .

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

[33]  Kurt Konolige,et al.  Computing the Extensions of Autoepistemic and Default Logics with a Truth Maintenance System , 1990, AAAI.

[34]  Robert C. Moore Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[35]  Yoav Shoham,et al.  Nonmonotonic Logics: Meaning and Utility , 1987, IJCAI.

[36]  David W. Etherington Relating Default Logic and Circumscription , 1987, IJCAI.

[37]  John-Jules Ch. Meyer,et al.  Non-Monotonic Reasoning by Monotonic Means , 1990, JELIA.

[38]  David W. Etherington A Semantics for Default Logic , 1987, IJCAI.

[39]  David Poole,et al.  Normality and Faults in Logic-Based Diagnosis , 1989, IJCAI.

[40]  Robert E. Mercer,et al.  A Default Logic Approach to the Derivation of Natural Language Presuppositions , 1987 .

[41]  Randy Goebel,et al.  Theorist: A Logical Reasoning System for Defaults and Diagnosis , 1987 .

[42]  C. Raymond Perrault An application of default logic to speech act theory , 1987 .

[43]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[44]  Paul van Arragon Nested default reasoning with priority levels , 1990 .

[45]  Grigoris Antoniou,et al.  Operational concepts of nonmonotonic logics part 1: Default logic , 2004, Artificial Intelligence Review.

[46]  John W. Lloyd Logic Programming without Negation as Failure , 1995 .

[47]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[48]  R. Reiter On Closed World Data Bases , 1987, Logic and Data Bases.

[49]  David Poole,et al.  A methodology for using a default and abductive reasoning system , 1989, Int. J. Intell. Syst..

[50]  Hector Geffner,et al.  Default reasoning - causal and conditional theories , 1992 .

[51]  David Makinson,et al.  General Theory of Cumulative Inference , 1988, NMR.

[52]  Norman Y. Foo,et al.  Exten: A System for Computing Default Logic Extensions , 1996, PRICAI.

[53]  Randy Goebel,et al.  Non-Monotonic Reasoning in Temporal Domains: The Knowledge Independence Problem , 1989, NMR.

[54]  Victor W. Marek,et al.  Default Reasoning System DeReS , 1996, KR.

[55]  Torsten Schaub,et al.  Lemma Handling in Default Logic Theorem Provers , 1995, ECSQARU.

[56]  Victor W. Marek,et al.  Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.

[57]  James P. Delgrande,et al.  Default Logic Revisited , 1991, KR.

[58]  David Makinson,et al.  General patterns in nonmonotonic reasoning , 1994 .

[59]  Vladimir Lifschitz,et al.  Computing Circumscription , 1985, IJCAI.

[60]  Eric Neufeld,et al.  Towards solving the multiple extension problem: Combining defaults and probabilities , 1987, Int. J. Approx. Reason..

[61]  Victor W. Marek,et al.  Experimenting with Nonmonotonic Reasoning , 1995, ICLP.

[62]  Philippe Besnard,et al.  An Introduction to Default Logic , 1989, Symbolic Computation.

[63]  David Poole,et al.  A Logical Framework for Default Reasoning , 1988, Artif. Intell..

[64]  A.R.C.S. A. H. Loveless What is an abstract ? , 1990 .

[65]  Torsten Schaub,et al.  Alternative Approaches to Default Logic , 1994, Artif. Intell..

[66]  Vladimir Lifschitz,et al.  On Open Defaults , 1990 .

[67]  Kurt Konolige,et al.  On the Relation Between Default and Autoepistemic Logic , 1987, Artif. Intell..