Well-Founded Completions of Logic Programs

goes here.

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

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

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

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

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

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

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

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

[9]  Teodor C. Przymusinski.  Stable semantics for disjunctive programs , 1991, New Generation Computing.

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

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

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

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

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

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

[16]  Teodor C. Przymusinski.  Stationary Semantics for Disjunctive Logic Programs and Deductive Databases , 1990, NACLP.

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