On the Semantics of Supernormal Defaults

Our aim is to clarify which nonmonotonic consequence relation λ Δ it given by a set Δ of "supernormal" defaults, i.e. defaults of the form (true : δ)/δ There are in fact a number of proposals for λ Δ (e.g. the skeptical and the credulous semantics). In this paper we look at the space of all possible default semantics and try to characterize the known ones by their properties, especially the valid deduction rules. For instance, it seems reasonable to require that any useful semantics should coincide with the original CWA if this is consistent. We might also want to allow proofs by case analysis. Then we get the skeptical semantics (assuming some other very natural deduction rules). Our results are in fact completeness proofs for "natural deduction systems" based on different default semantics.

[1]  Dov M. Gabbay,et al.  Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems , 1989, Logics and Models of Concurrent Systems.

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

[3]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

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

[5]  Stefan Brass,et al.  Deduction with Supernormal Defaults , 1991, Nonmonotonic and Inductive Logic.

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

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

[8]  Stefan Brass.  Beginnings of a Theory of General Database Completions , 1990, ICDT.

[9]  Andrew B. Baker,et al.  A Theorem Prover for Prioritized Circumscription , 1989, IJCAI.

[10]  Stefan Brass,et al.  Generalized Bottom-Up Query Evaluation , 1992, EDBT.

[11]  Jürgen Dix.  Classifying Semantics of Logic Programs (Extended Abstract) , 1991, LPNMR.

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

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

[14]  John C. Shepherdson,et al.  Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption , 1984, J. Log. Program..

[15]  Jürgen Dix.  Default Theories of Poole-Type and a Method for constructing Cumulative Versions of Default Logic , 1992, ECAI.

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

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

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

[19]  Stefan Brass,et al.  Specifying Closed World Assumptions for Logic Databases , 1989, MFDBS.

[20]  Stefan Brass.  Defaults in deduktiven Datenbanken , 1992 .

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

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