Compilability of Abduction

Abduction is one of the most important forms of reasoning; it has been successfully applied to several practical problems such as diagnosis. In this paper we investigate whether the computational complexity of abduction can be reduced by an appropriate use of preprocessing. This is motivated by the fact that part of the data of the problem (namely, the set of all possible assumptions and the theory relating assumptions and manifestations) are often known before the rest of the problem. In this paper, we show some complexity results about abduction when compilation is allowed.

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

[2]  Francesco M. Donini,et al.  Preprocessing of Intractable Problems , 2002, Inf. Comput..

[3]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[4]  Peter A. Flach,et al.  Abduction and Induction , 2000 .

[5]  Francesco M. Donini,et al.  Feasibility and Unfeasibility of Off-Line Processing , 1996, ISTCS.

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

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[9]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[10]  Francesco M. Donini,et al.  Space Efficiency of Propositional Knowledge Representation Formalisms , 2000, J. Artif. Intell. Res..

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

[12]  Fiora Pirri,et al.  Abduction is not Deduction-in-Reverse , 1996, Log. J. IGPL.

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

[14]  Luigi Portinale,et al.  Using Compiled Knowledge to Guide and Focus Abductive Diagnosis , 1996, IEEE Trans. Knowl. Data Eng..

[15]  Paolo Liberatore.  Monotonic reductions, representative equivalence, and compilation of intractable problems , 2001, JACM.

[16]  Chee-Keng Yap,et al.  Some Consequences of Non-Uniform Conditions on Uniform Classes , 1983, Theor. Comput. Sci..

[17]  Bart Selman,et al.  Horn Approximations of Empirical Data , 1995, Artif. Intell..