Abductive logic programming and disjunctive logic programming: their relationship and transferability

Abductive logic programming (ALP) and disjunctive logic programming (DLP) are two different extensions of logic programming. This paper investigates the relationship between ALP and DLP from the program transformation viewpoint. It is shown that the belief set semantics of an abductive program is expressed by the answer set semantics and the possible model semantics of a disjunctive program. In converse, the possible model semantics of a disjunctive program is equivalently expressed by the belief set semantics of an abductive program, while such a transformation is generally impossible for the answer set semantics. Moreover, it is shown that abductive disjunctive programs are always reducible to disjunctive programs both under the answer set semantics and the possible model semantics. These transformations are verified from the complexity viewpoint. The results of this paper turn out that ALP and DLP are just different ways of looking at the same problem if we choose an appropriate semantics.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[3]  Chiaki Sakama,et al.  A Fixpoint Characterization of Abductive Logic Programs , 1996, J. Log. Program..

[4]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

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

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

[7]  Jürgen Dix,et al.  Non-Monotonic Extensions of Logic Programming , 1996, Lecture Notes in Computer Science.

[8]  Phan Minh Dung.  Acyclic Disjunctive Logic Programs with Abductive Procedures as Proof Procedure , 1992, FGCS.

[9]  Katsumi Inoue,et al.  Hypothetical Reasoning in Logic Programs , 1994, J. Log. Program..

[10]  Luís Moniz Pereira,et al.  Prolegomena to Logic Programming for Non-monotonic Reasoning , 1996, NMELP.

[11]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

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

[13]  Li-Yan Yuan,et al.  Regular Extension Semantics and Disjunctive Eshghi Kowalski Procedure , 1998, IJCSLP.

[14]  Georg Gottlob,et al.  The Complexity of Logic-Based Abduction , 1993, STACS.

[15]  Chiaki Sakama,et al.  On Positive Occurrences of Negation as Failure , 1994, KR.

[16]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[17]  David S. Warren.  Transforming Abductive Logic Programs to Disjunctive Programs , 1993 .

[18]  Kurt Konolige,et al.  Abductive theories in artificial intelligence , 1997 .

[19]  Georg Gottlob,et al.  Abduction from Logic Programs: Semantics and Complexity , 1997, Theor. Comput. Sci..

[20]  Vladimir Lifschitz,et al.  From Disjunctive Programs to Abduction , 1994, NMELP.

[21]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

[22]  Dov M. Gabbay,et al.  Handbook of logic in artificial intelligence and logic programming (vol. 1) , 1993 .

[23]  Chiaki Sakama,et al.  On the Equivalence between Disjunctive and Abductive Logic Programs , 1994, ICLP.

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

[25]  Chandrabose Aravindan.  An Abductive Framework for Negation in Disjunctive Logic Programming , 1996, JELIA.

[26]  Ken Satoh,et al.  Computing Abduction by Using the TMS , 1991, ICLP.

[27]  Chiaki Sakama,et al.  Possible Model Semantics for Disjunctive Databases , 1989, DOOD.

[28]  David Poole,et al.  Explanation and prediction: an architecture for default and abductive reasoning , 1989, Comput. Intell..

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

[30]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[31]  Ilkka Niemelä,et al.  Developing a Declarative Rule Language for Applications in Product Configuration , 1999, PADL.

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

[33]  Edward P. F. Chan.  A Possible World Semantics for Disjunctive Databases , 1993, IEEE Trans. Knowl. Data Eng..

[34]  Jürgen Dix,et al.  Knowledge Representation with Logic Programs , 1997, LPKR.

[35]  Chiaki Sakama,et al.  Negation as Failure in the Head , 1998, J. Log. Program..

[36]  Hector J. Levesque,et al.  Support Set Selection for Abductive and Default Reasoning , 1996, Artif. Intell..

[37]  Katsumi Inoue,et al.  Embedding Negation as Failure into a Model Generation Theorem Prover , 1992, CADE.

[38]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

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

[40]  Harry E. Pople,et al.  Session 6 Theorem Proving and Logic: I I ON THE MECHANIZATION OF ABDUCTIVE LOGIC , 2006 .