General Logical Databases and Programs: Default Logic Semantics and Stratification

Abstract Default logic is introduced as a well-suited formalism for defining the declarative semantics of deductive databases and logic programs. After presenting, in general, how to use default logic in order to define the meaning of logical databases and logic programs, the class of stratifiable databases and programs is extensively studied in this framework. Finally, the default logic approach to the declarative semantics of logical databases and programs is compared with the other major approaches. This comparison leads to showing some advantages of the default logic approach.

[1]  Michael Gelfond,et al.  On Stratified Autoepistemic Theories , 1987, AAAI.

[2]  Teodor C. Przymusinski,et al.  Weakly Perfect Model Semantics for Logic Programs , 1988, ICLP/SLP.

[3]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

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

[5]  Pierre Siegel,et al.  Saturation, Nonmonotonic Reasoning and the Closed-World Assumption , 1985, Artif. Intell..

[6]  Richard Hull,et al.  Minimalism, Justification and Non-Monotonicity in Deductive Databases , 1989, J. Comput. Syst. Sci..

[7]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

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

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

[10]  D. Gabbay,et al.  Negation as inconsistency .I , 1986 .

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

[12]  Vladimir Lifschitz,et al.  On the Declarative Semantics of Logic Programs with Negation , 1987, Foundations of Deductive Databases and Logic Programming..

[13]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

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

[15]  Drew McDermott,et al.  Non-Monotonic Logic I , 1987, Artif. Intell..

[16]  Kenneth A. Ross,et al.  Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.

[17]  Raymond Reiter,et al.  On Interacting Defaults , 1981, IJCAI.

[18]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[19]  McDermottDrew.  Nonmonotonic Logic II , 1982 .

[20]  Christine Froidevaux,et al.  Taxonomic Default Theory , 1986, ECAI.

[21]  Witold Lukaszewlcz.  Two results on default logic , 1985, IJCAI 1985.

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

[23]  Christine Froidevaux,et al.  Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming , 1987, LICS.

[24]  Richard Hull,et al.  Positivism vs minimalism in deductive databases , 1985, PODS '86.

[25]  Shamim A. Naqvi.  A Logic for Negation in Database Systems , 1986, XP7.52 Workshop on Database Theory.

[26]  Krzysztof R. Apt,et al.  Maintenance of stratified databases viewed as a belief revision system , 1987, PODS.