Abstract
Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artificial Intelligence (AI) and related disciplines. Computing abductive explanations is an important problem, and there is a growing literature on this subject. We contribute to this endeavor by presenting new results on computing multiple resp. all of the possibly exponentially many explanations of an abductive query from a propositional Horn theory represented by a Horn CNF. Here the issues are whether a few explanations can be generated efficiently and, in case of all explanations, whether the computation is possible in polynomial total time (oroutput-polynomial time), i.e., in time polynomial in the combined size of the input and the output. We explore these issues for queries in CNF and important restrictions thereof. Among the results, we show that computing all explanations for a negative query literal from a Horn CNF is not feasible in polynomial total time unless P = NP, which settles an open issue. However, we show how to compute under restriction to acyclic Horn theories polynomially many explanations in input polynomial time and all explanations in polynomial total time, respectively. Complementing and extending previous results, this draws a detailed picture of the computational complexity of computing multiple explanations for queries on Horn theories.
This work was supported in part by the Austrian Science Fund (FWF) Project Z29-N04, by a TU Wien collaboration grant, and by the Scientific Grant in Aid of the Ministry of Education, Science, Sports, Culture and Technology of Japan.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apt, K., Bezem, M.: Acyclic programs. New Generation Comp 9(3-4), 335–364 (1991)
Boros, E., Crama, Y., Hammer, P.L.: Polynomial-time inference of all valid implications for Horn and related formulae. Ann. Math. and Artif. Int. 1, 21–32 (1990)
Brewka, G., Dix, J., Konolige, K.: Nonmonotonic Reasoning – An Overview. CSLI Lecture Notes, vol. 73. CSLI Publications, Stanford University (1997)
Bylander, T.: The monotonic abduction problem:A functional characterization on the edge of tractability. In: Proc. KR-1991, pp. 70–77. Morgan Kaufmann, San Francisco (1991)
Console, L., Theseider Dupré, D., Torasso, P.: On the relationship between abduction and deduction. J. Logic and Computation 1(5), 661–690 (1991)
de Kleer, J.: An assumption-based truth maintenance system. Artif. Int. 28, 127–162 (1986)
del Val, A.: On some tractable classes in deduction and abduction. Artif. Int. 116(1-2), 297–313 (2000)
del Val, A.: The complexity of restricted consequence finding and abduction. In: Proc. National Conference on Artificial Intelligence (AAAI-2000), pp. 337–342 (2000)
Dowling, W., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of prepositional Horn theories. J. Logic Programming 3, 267–284 (1984)
Eiter, T., Gottlob, G.: The complexity of logic-based abduction. JACM 42(1), 3–42 (1995)
Eiter, T., Makino, K.: On computing all abductive explanations. In: Proc. AAAI-2002, pp. 62–67. AAAI Press, Menlo Park (2002)
Eiter, T., Makino, K.: Generating all abductive explanations for queries on prepositional Horn theories. Tech. Rep. INFSYS RR-1843-03-09, Institute of Inf.Sys., TU Vienna (2003)
Eshghi, K.: A tractable class of abduction problems. In: Proc. IJCAI-1993, pp. 3–8 (1993)
Friedrich, G., Gottlob, G., Nejdl, W.: Hypothesis classification, abductive diagnosis, and therapy. In: Gottlob, G., Nejdl, W. (eds.) Expert Systems in Engineering. LNCS, vol. 462, pp. 69–78. Springer, Heidelberg (1990)
Inoue, K.: Linear resolution for consequence finding. Artif. Int. 56(2-3), 301–354 (1992)
Kleine Büning, H., Lettmann, T.: Aussagenlogik - Deduktion und Algorithmen. B.G. Teubner, Stuttgart (1994)
Leitsch, A.: The Resolution Calculus. Springer, Heidelberg (1997)
Marquis, P.: Consequence finding algorithms. In: Gabbay, D., Smets, P. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems (V), pp. 41–145. Kluwer, Dordrecht (2000)
Peirce, C.S.: Abduction and induction. In: Buchler, J. (ed.) Philosophical Writings of Peirce, ch. 11, Dover, NewYork (1955)
Poole, D.: Explanation and prediction: An architecture for default and abductive reasoning. Computational Intelligence 5(1), 97–110 (1989)
Poole, D.: Probabilistic Horn abduction and Bayesian networks. Artif. Int. 64, 81–130 (1993)
Reiter, R., de Kleer, J.: Foundations of assumption-based truth maintenance systems: Preliminary report. In: Proc. AAAI-1987, pp. 183–188 (1982)
Selman, B., Levesque, H.J.: Abductive and default reasoning: A computational core. In: Proc. AAAI-1990, pp. 343–348 (1990)
Selman, B., Levesque, H.J.: Support Set Selection for Abductive and Default Reasoning. Artif. Int. 82, 259–272 (1996)
Zanuttini, B.: New Polynomial Classes for Logic-Based Abduction. J. Artificial Intelligence Research (2003) (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eiter, T., Makino, K. (2003). Generating All Abductive Explanations for Queries on Propositional Horn Theories. In: Baaz, M., Makowsky, J.A. (eds) Computer Science Logic. CSL 2003. Lecture Notes in Computer Science, vol 2803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45220-1_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-45220-1_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40801-7
Online ISBN: 978-3-540-45220-1
eBook Packages: Springer Book Archive