Comparing Abductive Theories

This paper introduces two methods for comparing explanation power of different abductive theories. One is comparing for observations, and the other is comparing explanation content for observations. Those two measures are represented by generality relations over abductive theories. The generality relations are naturally related to the notion of abductive equivalence introduced by Inoue and Sakama. We also analyze the computational complexity of these relations.

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

[2]  Shan-Hwei Nienhuys-Cheng,et al.  Foundations of Inductive Logic Programming , 1997, Lecture Notes in Computer Science.

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

[4]  Georg Gottlob,et al.  On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.

[5]  Chiaki Sakama,et al.  Equivalence in Abductive Logic , 2005, IJCAI.

[6]  Stefan Woltran,et al.  Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report , 2007, CENT.

[7]  David Pearce,et al.  Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..

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

[9]  Georg Gottlob,et al.  Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..

[10]  Stefan Woltran,et al.  Characterizations for Relativized Notions of Equivalence in Answer Set Programming , 2004, JELIA.

[11]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[12]  Stefan Woltran,et al.  Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection , 2007, AAAI.

[13]  Chiaki Sakama,et al.  Generality Relations in Answer Set Programming , 2006, ICLP.

[14]  Chiaki Sakama,et al.  Generality and Equivalence Relations in Default Logic , 2007, AAAI.

[15]  Stefan Woltran,et al.  On Solution Correspondences in Answer-Set Programming , 2005, IJCAI.

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

[17]  Chiaki Sakama,et al.  Equivalence of Logic Programs Under Updates , 2004, JELIA.

[18]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[19]  Riccardo Rosati.  Model Checking for Nonmonotonic Logics: Algorithms and Complexity , 1999, IJCAI.

[20]  Tim Niblett,et al.  A Study of Generalisation in Logic Programs , 1988, EWSL.