Comparisons and computation of well-founded semantics for disjunctive logic programs

Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, these semantics are different from each other and no consensus is reached about which semantics is the most intended. In this article, we look at disjunctive well-founded reasoning from different angles. We show that there is an intuitive form of the well-founded reasoning in disjunctive logic programming which can be characterized by slightly modifying some existing approaches to defining disjunctive well-founded semantics, including program transformations, argumentation, unfounded sets (and resolution-like procedure). By employing the techniques developed by Brass and Dix in their transformation-based approach, we also provide a bottom-up procedure for this semantics. The significance of our work is not only in clarifying the relationship among different approaches, but also shed some light on what is an intended well-founded semantics for disjunctive logic programs.

[1]  Li-Yan Yuan,et al.  An abductive approach to disjunctive logic programming , 2000, J. Log. Program..

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

[3]  Kewen Wang.  A Top-Down Procedure for Disjunctive Well-Founded Semantics , 2001, IJCAR.

[4]  Teodor C. Przymusinski.  Static semantics for normal and disjunctive logic programs , 1995, Annals of Mathematics and Artificial Intelligence.

[5]  François Bry,et al.  Negation in Logic Programming: A Formalization in Constructive Logic , 1990, IS/KI.

[6]  Phan Minh Dung,et al.  An Argumentation-Theoretic Foundations for Logic Programming , 1995, J. Log. Program..

[7]  Antonis C. Kakas,et al.  The role of abduction in logic programming , 1998 .

[8]  Jürgen Dix,et al.  Relating defeasible and normal logic programming through transformation properties , 2000, Theor. Comput. Sci..

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

[10]  autoepistemic Zogic.  Logic programming and negation : a survey , 2001 .

[11]  Carlo Zaniolo,et al.  Stable models and non-determinism in logic programs with negation , 1990, PODS.

[12]  Jürgen Dix,et al.  On the equivalence of the static and disjunctive well-founded semantics and its computation , 2001, Theor. Comput. Sci..

[13]  Jürgen Dix,et al.  Semantics of (disjunctive) Logic Programs Based on Partial Evaluation , 1999, J. Log. Program..

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

[15]  Jack Minker,et al.  Overview of disjunctive logic programming , 1994, Annals of Mathematics and Artificial Intelligence.

[16]  Kewen Wang,et al.  Argumentation-based abduction in disjunctive logic programming , 2000, J. Log. Program..

[17]  Haim Gaifman,et al.  Semantics of Logic Programs , 1990, ICLP.

[18]  Jürgen Dix,et al.  Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated Gcwa , 1997 .

[19]  Jack Minker,et al.  Circumscription and Disjunctive Logic Programming , 1991, Artificial and Mathematical Theory of Computation.

[20]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[21]  Francesco Scarcello,et al.  Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation , 1997, Inf. Comput..

[22]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[23]  Thomas Eiter,et al.  On the partial semantics for disjunctive deductive databases , 2004, Annals of Mathematics and Artificial Intelligence.

[24]  Jürgen Dix,et al.  Characterizations of the Disjunctive Stable Semantics by Partial Evaluation , 1997, J. Log. Program..