New Polynomial Classes for Logic-Based Abduction

We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given propositional knowledge base. We give a general algorithm, based on the notion of projection; then we study restrictions over the representations of the knowledge base and of the query, and find new polynomial classes of abduction problems.

[1]  Peter A. Flach,et al.  Proceedings of the ECAI'98 Workshop on Abduction and Induction in AI , 1998 .

[2]  Bruno Zanuttini,et al.  New Polynomial Classes for Logic-Based Abduction (Technical Report) , 2003 .

[3]  Jerry R. Hobbs,et al.  Interpretation as Abduction , 1993, Artif. Intell..

[4]  Raymond Reiter,et al.  Foundations of Assumption-based Truth Maintenance Systems: Preliminary Report , 1987, AAAI.

[5]  Pierre Marquis,et al.  Consistency restoration and explanations in dynamic CSPs Application to configuration , 2002, Artif. Intell..

[6]  Bruno Zanuttini.  Approximating Propositional Knowledge with Affine Formulas , 2002, ECAI.

[7]  W. Greub.  Linear Algebra , 1981 .

[8]  Pierre Marquis,et al.  Consequence Finding Algorithms , 2000 .

[9]  C. Curtis.  Linear Algebra: An Introductory Approach , 1984 .

[10]  Dan Roth,et al.  Reasoning with Models , 1994, Artif. Intell..

[11]  Kave Eshghi,et al.  A Tractable Class of Abduction Problems , 1993, IJCAI.

[12]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[13]  Georg Gottlob,et al.  The complexity of logic-based abduction , 1993, JACM.

[14]  Martha Sideri,et al.  The Inverse Satisfiability Problem , 1996, SIAM J. Comput..

[15]  Bernhard Beckert,et al.  Transformations between signed and classical clause logic , 1999, Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329).

[16]  Pierre Marquis,et al.  Conditional independence in propositional logic , 2002, Artif. Intell..

[17]  Hector J. Levesque,et al.  Abductive and Default Reasoning: A Computational Core , 1990, AAAI.

[18]  Kazuhisa Makino,et al.  On computing all abductive explanations , 2002, AAAI/IAAI.

[19]  Markus Stumptner,et al.  Diagnosing tree-structured systems , 2001, Artif. Intell..

[20]  Dean Allemang,et al.  Some Results Concerning the Computational Complexity of Abduction , 1989, KR.

[21]  Alvaro del Val.  The Complexity of Restricted Consequence Finding and Abduction , 2000, AAAI/IAAI.