Semantics of Normal and Disjunctive Logic Programs: A Unifying Framework

We introduce a simple uniform semantic framework that isomorphically contains major semantics proposed recently for normal, disjunctive and extended logic programs, including the perfect model, stable, well-founded, disjunctive stable, stationary and static semantics and many others. The existence of such a natural framework allows us to compare major proposed semantics, analyze their properties, provide simpler definitions and generate new semantics satisfying a specific set of conditions.

[1]  Jürgen Dix,et al.  A Disjunctive Semantics Bases on Unfolding and Bottom-Up Evaluation , 1994, GI Jahrestagung.

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

[3]  Jürgen Dix,et al.  Classifying Semantics of Disjunctive Logic Programs , 1992, JICSLP.

[4]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

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

[6]  Teodor C. Przymusinski.  Autoepistemic Logics of Closed Beliefs and Logic Programming , 1991, LPNMR.

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

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

[9]  Teodor C. Przymusinski.  The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..

[10]  Christine Froidevaux,et al.  General Logical Databases and Programs: Default Logic Semantics and Stratification , 1991, Inf. Comput..

[11]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[12]  Jürgen Dix,et al.  Disjunctive Semantics based upon Partial and Bottom-Up Evaluation , 1995, ICLP.

[13]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[14]  Teodor C. Przymusinski,et al.  Semantic Issues in Deductive Databases and Logic Programs , 1990 .

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

[16]  Teodor C. Przymusinski,et al.  On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..

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

[18]  José Júlio Alferes,et al.  Strong and Explicit Negation in Non-Monotonic Reasoning and Logic Programming , 1996, JELIA.

[19]  Alan van Gelser.  Negation as failure using tight derivations for general logic programs , 1989 .

[20]  Teodor C. Przymusinski.  Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs , 1991, Artif. Intell..

[21]  Hector J. Levesque,et al.  Three-valued nonmonotonic formalisms and semantics of logic programs , 1992 .

[22]  José Júlio Alferes,et al.  Well Founded Semantics for Logic Programs with Explicit Negation , 1992, ECAI.

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

[24]  Teodor C. Przymusinski,et al.  Stationary Semantics for Normal and Disjunctive Logic Programs , 1991 .

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

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

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

[28]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[29]  José Júlio Alferes,et al.  On Logic Program Semantics with Two Kinds of Negation , 1992, JICSLP.