Where fail-safe default logics fail

Reiter's original definition of default logic allows for the application of a default that contradicts one previously applied. We call this condition failure. The possibility of generating failures has been in the past considered a semantical problem, and variants have been proposed to solve it. We show that it is instead a computational feature that is needed to encode some domains into default logic.

[1]  Christine Froidevaux,et al.  A Framework for Default Logics , 1992, JELIA.

[2]  Francesco M. Donini,et al.  Space Efficiency of Propositional Knowledge Representation Formalisms , 2000, J. Artif. Intell. Res..

[3]  Camilla Schwind,et al.  A Tableau-Based Theorem Prover for a Decidable Subset of Default Logic , 1990, CADE.

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

[5]  Paolo Liberatore.  Monotonic reductions, representative equivalence, and compilation of intractable problems , 2001, JACM.

[6]  Tomi Janhunen,et al.  Evaluating the effect of semi-normality on the expressiveness of defaults , 2003, Artif. Intell..

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

[8]  Thomas Eiter,et al.  Querying Disjunctive Databases Through Nonmonotonic Logics , 1996, Theor. Comput. Sci..

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

[10]  Christine Froidevaux,et al.  DEFAULT LOGICS: A UNIFIED VIEW , 1994, Comput. Intell..

[11]  Rina Dechter,et al.  Default Reasoning Using Classical Logic , 1996, Artif. Intell..

[12]  Miroslaw Truszczynski,et al.  Constrained and Rational Default Logics , 1995, IJCAI.

[13]  Marco Schaerf,et al.  A Survey of Complexity Results for Nonmonotonic Logics , 1993, J. Log. Program..

[14]  Georg Gottlob,et al.  Translating default logic into standard autoepistemic logic , 1995, JACM.

[15]  Piotr Rychlik.  Some Variations on Default Logic , 1991, AAAI.

[16]  Witold Łukaszewicz.  Considerations on default logic: an alternative approach 1 , 1988 .

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

[18]  Ravi B. Boppana,et al.  The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

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

[20]  Grigoris Antoniou,et al.  A tutorial on default logics , 1999, CSUR.

[21]  Hudson Turner,et al.  Representing Actions in Logic Programs and Default Theories: A Situation Calculus Approach , 1997, J. Log. Program..

[22]  Torsten Schaub,et al.  On the Relation between Reiter's Default Logic and Its (Major) , 2003, ECSQARU.

[23]  Tomasz Imielinski,et al.  Results on Translating Defaults to Circumscription , 1985, IJCAI.

[24]  Georg Gottlob,et al.  Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..

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

[26]  Jonathan Stillman,et al.  The Complexity of Propositional Default Logics , 1992, AAAI.

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

[28]  Paolo Penna,et al.  Succinct Representations of Model Based Belief Revision , 2000, STACS.

[29]  Tomi Janhunen.  On the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscription , 1998, JELIA.

[30]  Laura Giordano,et al.  On Cumulative Default Logics , 1994, Artif. Intell..

[31]  Francesco M. Donini,et al.  Preprocessing of Intractable Problems , 2002, Inf. Comput..

[32]  François Lévy.  Computing Extensions of Default Theories , 1991, ECSQARU.