Weakly Stratiied Logic Programs

[1]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

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

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

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

[5]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

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

[7]  PerspectiveTeodor,et al.  Non { monotonic Reasoning vs . Logic Programming : A New , 1987 .

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

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

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

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

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

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

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