Generating all abductive explanations for queries on prepositional horn theories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2803, Issue , 2003, Pages 197-211

  Eiter, Thomas ^a   Makino, Kazuhisa ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b OSAKA UNIVERSITY   (Japan)

Author keywords

Abduction; Computational logic; Horn theories; NP hardness; Polynomial total time computation; Prepositional logic

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; LOGIC PROGRAMMING; POLYNOMIAL APPROXIMATION; POLYNOMIALS; RECONFIGURABLE HARDWARE;

ABDUCTION; COMPUTATIONAL LOGIC; HORN THEORY; NP-HARDNESS; PROPOSITIONAL LOGIC;

COMPUTER CIRCUITS;

EID: 33749381025     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45220-1_18     Document Type: Article

References (25)

1. K. Apt and M. Bezem. Acyclic programs. New Generation Comp., 9(3-4):335-364, 1991.
2. E. Boros, Y. Crama, and P. L. Hammer. Polynomial-time inference of all valid implications for Horn and related formulae. Ann. Math. and Artif. Int., 1:21-32, 1990.
3. G. Brewka, J. Dix, and K. Konolige. Nonmonotonic Reasoning - An Overview. Number 73 in CSLI Lecture Notes. CSLI Publications, Stanford University, 1997.
4. T. Bylander. The monotonic abduction problem: A functional characterization on the edge of tractability. In Proc. KR-91, 70-77. Morgan Kaufmann, 1991.
5. L. Console, D. Theseider Dupré, and P. Torasso. On the relationship between abduction and deduction. J. Logic and Computation, 1(5):661-690, 1991.
6. J. de Kleer. An assumption-based truth maintenance system. Artif. Int., 28:127-162, 1986.
7. A. del Val. On some tractable classes in deduction and abduction. Artif. Int., 116(1-2):297-313, 2000.
8. A. del Val. The complexity of restricted consequence finding and abduction. In Proc. National Conference on Artificial Intelligence (AAAI-2000),pp. 337-342, 2000.
9. W. Dowling and J. H. Gallier. Linear-time algorithms for testing the satisfiability of prepositional Horn theories. J. Logic Programming, 3:267-284, 1984.
10. T. Eiter and G. Gottlob. The complexity of logic-based abduction. JACM, 42(1):3-42, 1995.
11. T. Eiter and K. Makino. On computing all abductive explanations. In Proc. AAAI-02, pp. 62-67. AAAI Press, July 2002.
12. T. Eiter and K. Makino. Generating all abductive explanations for queries on prepositional Horn theories. Tech. Rep. INFSYS RR-1843-03-09, Institute of Inf.Sys., TU Vienna, 2003.
13. K. Eshghi. A tractable class of abduction problems. In Proc. IJCAI-93, pp. 3-8, 1993.
14. G. Friedrich, G. Gottlob, and W. Nejdl. Hypothesis classification, abductive diagnosis, and therapy. In Proc. Int'l Workshop on Expert Sys. in Engineering, LNCS 462, pp. 69-78, 1990.
15. K. Inoue. Linear resolution for consequence finding. Arlif. Int., 56(2-3):301-354, 1992.
16. H. Kleine Büning and T. Lettmann. Aussagenlogik - Deduktion und Algorithmen. B.G. Teubner, Stuttgart, 1994.
17. A. Leitsch. The Resolution Calculus. Springer, 1997.
18. P. Marquis. Consequence finding algorithms. In D. Gabbay, Ph. Smets (eds), Handbook of Defeasible Reasoning and Uncertainty Management Systems (V), pp. 41-145. Kluwer, 2000.
19. C. S. Peirce. Abduction and induction. In J. Buchler, editor, Philosophical Writings of Peirce, chapter 11. Dover, New York, 1955.
20. D. Poole. Explanation and prediction: An architecture for default and abductive reasoning. Computational Intelligence, 5(1):97-110, 1989.
21. D. Poole. Probabilistic Horn abduction and Bayesian networks. Artif. Int., 64:81-130, 1993.
22. R. Reiter and J. de Kleer. Foundations of assumption-based truth maintenance systems: Preliminary report. In Proc. AAAI-87, pp. 183-188, 1982.
23. B. Selman and H. J. Levesque. Abductive and default reasoning: A computational core. In Proc. AAAI-90, pp. 343-348, 1990.
24. B. Selman and H. J. Levesque. Support Set Selection for Abductive and Default Reasoning. Artif. Int., 82:259-272, 1996.
25. B. Zanuttini. New Polynomial Classes for Logic-Based Abduction. J. Artificial Intelligence Research, 2003. To appear.