Well-founded and stationary models of logic programs

We investigate the class ofstationary or partial stable models of normal logic programs. This important class of models includes all (total)stable models, and, moreover, thewell-founded model is always its smallest member. Stationary models have several natural fixed-point definitions and can be equivalently obtained as expansions or extensions of suitable autoepistemic or default theories. By taking a particular subclass of this class of models one can obtain different semantics of logic programs, including the stable semantics and the well-founded semantics. Stationary models can be also naturally extended to the class of all disjunctive logic programs. These features of stationary models designate them as an important class of models with applications reaching far beyond the realm of logic programming.

[1]  Kenneth A. Ross,et al.  A procedural semantics for well founded negation in logic programs , 1989, J. Log. Program..

[2]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

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

[4]  Teodor C. Przymusinski,et al.  Stationary Default Extensions , 1994, Fundam. Informaticae.

[5]  David Scott Warren,et al.  A Goal-Oriented Approach to Computing the Well-Founded Semantics , 1993, J. Log. Program..

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

[7]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[8]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[9]  H. Przymusinska,et al.  Weakly stratified logic programs , 1990 .

[10]  Teodor C. Przymusinski.  Static semantics for normal and disjunctive logic programs , 1995, Annals of Mathematics and Artificial Intelligence.

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

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

[13]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[14]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[15]  Teodor C. Przymusinski.  Non-Monotonic Reasoning and Logic Programming , 1991, ISLP.

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

[17]  Teodor C. Przymusinski.  Every logic program has a natural stratification and an iterated least fixed point model , 1989, PODS.

[18]  Lawrence Cavedon,et al.  Continuity, Consistency, and Completeness Properties for Logic Programs , 1989, ICLP.

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

[20]  Bart Selman,et al.  Hard Problems for Simple Default Logics , 1989, Artif. Intell..

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

[22]  Jia-Huai You,et al.  Making default inferences from logic programs , 1991, Comput. Intell..

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

[24]  Van Gelder,et al.  A Knowledge Representation Framework Based on Autoepistemic Logic of Minimal Beliefs , 1994 .

[25]  Teodor C. Przymusinski,et al.  Minimal Model Semantics vs. Negation as Failure: A Comparison of Semantics , 1988, ISMIS.

[26]  V. S. Subrahmanian,et al.  Dualities between alternative semantics for logic programming and nonmonotonic reasoning , 2004, Journal of Automated Reasoning.

[27]  Teodor C. Przymusinski.  A Knowledge Representation Framework Based on Autoepistemic Logic of Minimal Beliefs , 1994, AAAI.

[28]  Teodor C. Przymusinski.  Semantics of Disjunctive Logic Programs and Deductive Databases , 1991, DOOD.

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

[30]  Weakly Strati.  Weakly Stratiied Logic Programs , 1990 .

[31]  Kenneth Kunen,et al.  Some Remarks on the Completed Database , 1990, ICLP/SLP.

[32]  John C. Shepherdson,et al.  Negation in Logic Programming , 1988, Foundations of Deductive Databases and Logic Programming..

[33]  Raymond Reiter.  On Closed World Data Bases , 1977, Logic and Data Bases.

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

[35]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

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

[37]  Ulf Nilsson,et al.  A Simple Fixed Point Characterization of Three-Valued Stable Model Semantics , 1991, Inf. Process. Lett..

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

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

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

[41]  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..

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

[43]  Victor W. Marek,et al.  Relating Autoepistemic and Default Logics , 1989, KR.

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

[45]  Kenneth Kunen,et al.  Negation in Logic Programming , 1987, J. Log. Program..

[46]  Teodor C. Przymusinski.  On the declarative and procedural semantics of logic programs , 1989, Journal of Automated Reasoning.

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

[48]  David S. Touretzky,et al.  A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks , 1987, Artif. Intell..

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

[50]  Teodor C. Przymusinski,et al.  Soundness and Completeness of Partial Deductions for Well-Founded Semantics , 1992, LPAR.

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

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

[53]  François Bry.  Logic Programming as Constructivism , 1989 .