An argumentation-theoretic foundation for logic programming

Alferes, 1993, Scenario Semantics of Extended Logic Programs

Brogi, 1992, Normal Logic Programs as Open Positive Programs

Bondarenko, 1993, An Assumption-Based Framework for Nonmonotonic Reasoning

Console, 1991, On the Relationship Between Abduction and Deduction, J. Logic Computat., 1, 661, 10.1093/logcom/1.5.661

Clark, 1978, Negation as Failure

Cox, 1986, Causes for Events: Their Computation and Application, 608

Charniak, 1985

Denecker, 1992, On the Duality of Abduction and Model Generation, 650

Dung, 1991, Negation as Hypothesis: An Abductive Foundation for Logic Programming

Dung, 1992, On the Relations Between Stable and Well-Founded Semantics of Logic Programs, Theoretical Computer Science, 105, 7, 10.1016/0304-3975(92)90285-N

Dung, P. M., On the Acceptability of Arguments and Its Fundamental Role in Non-monotonic Reasoning, Logic Programming and N-Person Game, Artificial Intelligence (to appear);

an extended abstract appeared in Bajcsy R. (ed.), Proc. of IJCAI'93, pp. 852–859.

Dung, 1993, An Argumentational Semantics for Logic Programming with Classical Negation

Dung, 1991, Well-Founded Reasoning with Classical Negation

Eshghi, 1989, Abduction Compared with Negation by Failure

Eshghi, 1988, Abduction Compared with Negation by Failure

Finger, J. J. and Genesereth, M. R., Residue: A Deductive Approach to Design Synthesis, STAN-CS-85-1035, Stanford University.

Fages, 1993, Consistency of Clark's Completion and Existence of Stable Models, Journal of Methods of Logic in Computer Sciences

Giordano, 1993, A Semantics for Eshghi and Kowalski's Abductive Procedure

Van Gelder, 1988, Unfounded Sets and Well-Founded Semantics for General Logic Programs

Gelfond, 1988, The Stable Model Semantics for Logic Programs

Kakas, 1992, Abductive Logic Programming, J. of Logic and Computation, 2, 719, 10.1093/logcom/2.6.719

Kakas, 1991, Stable Theories for Logic Programs

Kakas, 1992, Preferred Extensions are Partial Stable Models, J. of Logic Programming, 14, 341, 10.1016/0743-1066(92)90015-U

Kakas, 1990, Generalized Stable Models: A Semantics for Abduction

Kakas, 1993, Constructive Abduction in Logic Programming, Technical Report

Kowalski, 1991, Logic Programming and Artificial Intelligence

Kunen, 1989, Signed Data Dependencies in Logic Programming, J. of Logic Programming, 7, 231, 10.1016/0743-1066(89)90022-8

Lloyd, 1987

Marek, 1990, A Theory of Nonmonotonic Rule Systems I, Annals of Mathematics and Artificial Intelligence, 1, 241, 10.1007/BF01531080

Pereira, 1992, Adding Closed World Assumption to Well-Founded Semantics

Przymusinski, 1987, On the Declarative Semantics of Deductive Databases and Logic Programs

Przymusinski, 1990, Extended Stable Semantics for Normal and Disjunctive Logic Programs

Przymusinski, 1989, Every Logic Program has a Natural Stratification and an Iterated Least Fixed Point Model, 11

Poole, 1988, A Logical Framework for Default Reasoning, Artificial Intelligence, 36, 27, 10.1016/0004-3702(88)90077-X

Przymusinski, 1988, Perfect Model Semantics

Przymusinski, 1991, Semantics of Disjunctive Programs and Deductive Databases

Ross, 1988, A Procedural Semantics for Well-Founded Negation in Logic Programs

Sato, 1990, Completed Logic Programs and their Consistency, J. of Logic Programming, 9, 33, 10.1016/0743-1066(90)90032-Z

Sedgewick, 1990

Sacca, 1991, Partial Models and Three-Valued Models in Logic Programs with Negation

Torres, A., Nondeterministic Well-Founded Semantics, to appear in Annals of Mathematics and AI.

Touretzky, 1987, A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems