Tight, Consistent and Computable Completions for Unrestricted Logic Programs

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

[2]  Teodor C. Przymusinski.  Well-Founded Completions of Logic Programs , 1991, ICLP.

[3]  Mark Wallace,et al.  Unrestricted Logic Programs or if Stratification is the Cure, what is the Malady? , 1990, ECAI.

[4]  Kenneth Kunen,et al.  Signed Data Dependencies in Logic Programs , 1989, J. Log. Program..

[5]  John W. Lloyd,et al.  A Completeness Theorem for SLDNF Resolution , 1989, J. Log. Program..

[6]  Hendrik Decker,et al.  Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution , 1989, CSL.

[7]  D. Chan,et al.  An experiment with programming using pure negation , 1989 .

[8]  Mark Wallace.  A Computable Semantics for General Logic Programs , 1989, J. Log. Program..

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

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

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

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

[13]  Victor W. Marek,et al.  The Relationship Between Logic Program Semantics and Non-Monotonic Reasoning , 1989, ICLP.

[14]  Teodor C. Przymusinski.  Non-Monotonic Formalisms and Logic Programming , 1989, ICLP.

[15]  Kenneth Kunen.  Some Remarks on the Completed Database , 1988, ICLP/SLP.

[16]  Liz Sonenberg,et al.  On Domain Independent Databases , 1988, Foundations of Deductive Databases and Logic Programming..

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

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

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

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

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

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

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

[24]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

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

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

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

[28]  Keith L. Clark,et al.  Micro-Prolog - programming in logic , 1984, Prentice Hall international series in computer science.

[29]  Howard A. Blair.  The Recursion-Theoretical Complexity of the Semantics of Predicate Logic as a Programming Language , 1982, Inf. Control..

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

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