The Alternating Fixpoint of Logic Programs with Negation

[1]  Carlo Zaniolo,et al.  Stable models and non-determinism in logic programs with negation , 1990, PODS.

[2]  Vladimir Lifschitz,et al.  Between Circumscription and Autoepistemic Logic , 1989, KR.

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

[4]  Christine Froidevaux,et al.  Negation by Default and Unstratifiable Logic Programs , 1991, Theor. Comput. Sci..

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

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

[7]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

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

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

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

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

[12]  John C. Shepherdson,et al.  Negation as Failure II , 1985, J. Log. Program..

[13]  François Bry,et al.  Logic programming as constructivism: a formalization and its application to databases , 1989, PODS.

[14]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[15]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[16]  V. Lifschitz,et al.  The Stable Model Semantics for Logic Programming , 1988, ICLP/SLP.

[17]  Victor Vianu,et al.  Procedural Languages for Database Queries and Updates , 1990, J. Comput. Syst. Sci..

[18]  Peter Aczel,et al.  An Introduction to Inductive Definitions , 1977 .

[19]  Phan Minh Dung,et al.  A Natural Semantics for Logic Programs with Negation , 1989, FSTTCS.

[20]  Charles Elkan,et al.  A Rational Reconstruction of Nonmonotonic Truth Maintenance Systems , 1990, Artif. Intell..

[21]  Melvin Fitting,et al.  Stratified and Three-valued Logic Programming Semantics , 1988, ICLP/SLP.

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

[23]  Yiannis N. Moschovakis,et al.  Elementary induction on abstract structures , 1974 .

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

[25]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[26]  Daniel Leviant Inductive definitions over finite structures , 1990 .

[27]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

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

[29]  Serge Abiteboul,et al.  Procedural and declarative database update languages , 1988, PODS '88.

[30]  Krzysztof R. Apt,et al.  Contributions to the Theory of Logic Programming , 1982, JACM.

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

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

[33]  Phokion G. Kolaitis The Expressive Power of Stratified Programs , 1991, Inf. Comput..

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

[35]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[36]  Christos H. Papadimitriou,et al.  Why not negation by fixpoint? , 1988, PODS '88.

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

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

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

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

[41]  Michael J. Maher,et al.  Foundations of Deductive Databases and Logic Programming , 1988 .

[42]  Li-Yan Yuan,et al.  Three-valued formalization of logic programming: is it needed? , 1990, PODS '90.

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

[44]  Moshe Y. Vardi The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[45]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

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

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

[48]  J. W. LLOYD,et al.  Making Prolog more Expressive , 1984, J. Log. Program..