An Argumentation-Theoretic Foundations for Logic Programming

Abstract Logic programs are considered as abductive programs with negative literals as abductive hypotheses. A simple framework for semantics of logic programming is introduced based on the notion of acceptable hypotheses. We show that our framework captures, generalizes, and unifies different semantic concepts (e.g., well-founded models, stable models, stationary semantics, etc.) in logic programming. We demonstrate that our framework accommodates in a natural way both the minimalism and maximalism intuitions to semantics of logic programming. Further, we show that Eshghi and Kowalski's procedure is a proof procedure for the abductive semantics. We also give sufficient conditions for the coincidence between different semantics.

[1]  Paolo Mancarella,et al.  Generalized Stable Models: A Semantics for Abduction , 1990, ECAI.

[2]  Teodor C. Przymusinski.  Perfect Model Semantics , 1988, ICLP/SLP.

[3]  Phan Minh Dung,et al.  On the Relations between Stable and Well-Founded Semantics of Logic Programs , 1992, Theor. Comput. Sci..

[4]  Johann Eder,et al.  Logic and Databases , 1992, Advanced Topics in Artificial Intelligence.

[5]  José Júlio Alferes,et al.  Scenario Semantics of Extended Logic Programs , 1993, LPNMR.

[6]  Robert A. Kowalski,et al.  Abduction Compared with Negation by Failure , 1989, ICLP.

[7]  Laura Giordano,et al.  A semantics for Eshghi and Kowalski's abductive procedure , 1993, ICLP 1993.

[8]  Danny De Schreye,et al.  On the Duality of Abduction and Model Generation in a Framework for Model Generation with Equality , 1994, Theor. Comput. Sci..

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

[10]  Paolo Mancarella,et al.  Abductive Logic Programming , 1992, LPNMR.

[11]  David Poole,et al.  A Logical Framework for Default Reasoning , 1988, Artif. Intell..

[12]  Phan Minh Dung,et al.  Well-Founded Reasoning with Classical Negation , 1991, LPNMR.

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

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

[15]  Pietro Torasso,et al.  On the Relationship between Abduction and Deduction , 1991, J. Log. Comput..

[16]  Francesca Toni,et al.  An Assumption-Based Framework for Non-Monotonic Reasoning , 1993, LPNMR.

[17]  Paolo Mancarella,et al.  Short Note: Preferred Extensions are Partial Stable Models , 1992, J. Log. Program..

[18]  Evelina Lamma,et al.  Normal logic programs as open positive programs , 1992, CNKBS.

[19]  Taisuke Sato,et al.  Completed Logic Programs and their Consistency , 1990, J. Log. Program..

[20]  M. Genesereth,et al.  RESIDUE: a deductive approach to design synthesis , 1985 .

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

[22]  Carlo Zaniolo,et al.  Partial Models and Three-Valued Models in Logic Programs with Negation , 1991, LPNMR.

[23]  Paolo Mancarella,et al.  Stable Theories for Logic Programs , 1991, ISLP.

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

[25]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[26]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

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

[28]  Philip T. Cox,et al.  Causes for Events: Their Computation and Applications , 1986, CADE.

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

[30]  David S. Touretzky,et al.  A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems , 1987, IJCAI.