The Complexity of Logic-Based Abduction

Journal of the ACM (JACM)

Volumn 42, Issue 1, 1995, Pages 3-42

  Eiter, Thomas ^a   Gottlob, Georg ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Abduction; complexity analysis; diagnosis; propositional logic; reasoning

Indexed keywords

COMPLEXITY ANALYSIS; DEDUCTION; LOGIC BASED ABDUCTION; LOGICAL THEORY; MATHEMATICAL LOGIC; MINIMALITY CRITERIA; NONNUMERICAL ALGORITHMS; PROPOSITIONAL LOGIC;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; FORMAL LANGUAGES; FORMAL LOGIC; HIERARCHICAL SYSTEMS; KNOWLEDGE REPRESENTATION; POLYNOMIALS; THEOREM PROVING;

ARTIFICIAL INTELLIGENCE;

EID: 0029236521     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/200836.200838     Document Type: Article

References (75)

1. ALLEMANG, D., TANNER, M. C., BYLANDER, T., AND JOSEPHSON, J. 1987. Computational complexity of hypothesis assembly. In Proceedings of the 1987 International Joint Conference on Artificial Intelligence. Morgan-Kaufmann, San Mateo, Calif., pp. 112-117.
2. BLUMER, A., EHRENFEUCHT, A., HAUSSLER, D., AND WARMUTH, M. 1987. Occam's razor. Inf. Proc. Lett. 24, 377-380.
3. BREWKA, G. 1991. Nonmonotonic Reasoning: Logical Foundations of Commonsense. Cambridge University Press, Cambridge, England.
4. BYLANDER, T. 1991. The monotonic abduction problem: A functional characterization on the edge of tractability. In Proceedings KR-91. Morgan-Kaufmann, San Mateo, Calif., pp. 70-77.
5. BYLANDER, T., ALLEMANG, D., TANNER, M., AND JOSEPHSON, J. 1989. Some results concerning the computational complexity of abduction. In Proceedings KR-89. Morgan-Kaufmann, San Mateo, Calif., pp. 44-54.
6. BYLANDER, T., ALLEMANG, D., TANNER, M., AND JOSEPHSON, J. 1991. The computational complexity of abduction. Artif. Int. 49, 25-60.
7. CADOLI, M., AND SCHAERF, M. 1993. A survey on complexity results for non-monotonic logics. Tech. rep. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”. Rome, Italy. J. Logic Prog. 17, 127-160.
8. CADOLI, M., AND SCHAERF, M. 1992. Approximate inference for concept languages. In Proceedings KR-92. Morgan-Kaufmann, San Mateo, Calif., pp. 330-341.
9. CHARNIAK, E. 1986. A neat theory of marker passing. In Proceedings AAAI-86, pp. 584-588.
10. CHARNIAK, E. 1988. Motivation analysis, abductive unification, and nonmonotonic equality. Artif. Int. 34, 275-295.
11. CHARNIAK, E., AND MCDERMOTT, P. 1985. Introduction to Artificial Intelligence. Addison-Wesley, Menlo Park, Calif.
12. CHEN, Z.-Z. AND TODA, S. 1991. On the complexity of computing optimal solutions. Int. J. Found. Comput. Sci. 2, 3, 207-220.
13. CONSOLE, L., THESEIDER DUPRÉ, D., AND TORASSO, P. 1989. A theory of diagnosis for incomplete causal models. In Proceedings of the 1989 International Joint Conference on Artificial Intelligence. Morgan-Kaufmann, San Mateo, Calif., pp. 1131-1137.
14. CONSOLE, L., THESEIDER DUPRÉ, D., AND TORASSO, P. 1991. On the relationship between abduction and deduction. J. Logic Comput. 1, 5, 661-690.
15. CONSOLE, L., AND TORASSO, P. 1991. A spectrum of logical definitions of model based diagnosis. Comput. Int. 7, 3, 133-141.
16. COOPER, G. 1990. The computational complexity of probabilistic inference using Bayesian belief networks. Artif. Int. 42, 393-405.
17. Cox, P., AND PIETRZYKOWSKI, T. 1987. General diagnosis by abductive inference. In IEEE Symposium on Logic Programming. pp. 183-189.
18. DE KLEER, J. 1986. An assumption-based truth maintenance system. Artif. Int. 28, 127-162.
19. DOWLING, W., AND GALLIER, J. H. 1984. Linear-time algorithms for testing the satisfiability of propositional horn theories. J. Logic Prog. 3, 267-284.
20. DOYLE, J. 1979. A truth-maintenance system. Artif. Int. 12, 231-272.
21. 2-complete. Theoret. Comput. Sci. 114, 231-245. Addendum 118, 315.
22. EITER, T., AND GOTTLOB, G. 1992. On the complexity of propositional knowledge base revision, updates, and counterfactuals. Artif. Int. 57, 2-3, 227-270.
23. ESHGHI, K. 1988. Abductive planning with event calculus. In Proceedings of the 5th International Conference and Symposium on Logic Programming. MIT Press, Cambridge, Mass., pp. 562-579.
24. ESHGHI, K. 1993. A tractable class of abduction problems. In Proceedings of the 1993 International Joint Conference on Artificial Intelligence. Morgan-Kaufmann, San Mateo, Calif., pp. 3-8.
25. FAGIN, R., ULLMAN, J. D., AND VARDI, M. Y. 1983. On the semantics of updates in databases. In Proceedings PODS-83. pp. 352-365.
26. FENNER, S., HOMER, S., OGIWARA, M., AND SELMAN, A. 1993. On using oracles that compute values. Tech. Rep. 93-05. CS Department of the University of New York at Buffalo, February 1993. Extended abstract in: Proceedings STACS-93. Lecture notes in Computer Science, vol, 665. Springer-Verlag, New York, pp. 398-407.
27. FINGER, J. 1987. Exploiting constraints in design synthesis. PhD dissertation. Dept. Computer Science. Stanford Univ. Stanford, Calif.
28. FRIEDRICH, G., GOTTLOB, G., AND NEJDL, W. 1990. Hypothesis classification, abductive diagnosis, and therapy. In Proceedings of the International Workshop on Expert Systems in Engineering (Vienna, Austria, Sept.). Lecture Notes in Artificial Intelligence, vol. 462. Springer-Verlag, New York, pp. 69-79.
29. GAREY. M., AND JOHNSON, D. S. 1979. Computers and intractability-A guide to the Theory of NP-Completeness. W. H. Freeman, New York.
30. GINSBERG, M. L. 1986. Counterfactuals. Artif. Int. 30, 35-79.
31. GIORDANO, L., AND MARTELLI, A. 1990. An abductive characterization of the TMS. In Proceedings of ECAI-90. pp. 308-313.
32. GOTTLOB, G. 1992. Complexity results for nonmonotonic logics. J. Logic Comput. 2, 3 (June), 397-425.
33. HARTSHORNE, C., et al., EDS. 1958. The Collected Papers of Charles Sanders Peirce, Cambridge Press, 1931-1958, Vol. II, pp. 272-607.
34. HOBBS, J. R., STICKEL, M. E., MARTIN, P., AND EDWARDS, D. 1988. Interpretation as abduction. In Proceedings of the 26th Annual Meeting of the Association for Computational Linguistics, pp. 95-103.
35. JOHNSON, D. S. 1990. A catalog of complexity classes. In Handbook of Theoretical Computer Science, vol. A, chap. 2. Elsevier Science Publishers B.V. (North-Holland), Amsterdam, The Netherlands.
36. Also: Artif. Int. 63 (1993), 69-142.
37. JOSEPHSON, J., CHANDRASEKARAN, B., SMITH, J. J. W., AND TANNER, M. 1987. A mechanism for forming composite explanatory hypotheses. IEEE Trans. Systems, Man, and Cybernetics SMC-17, 445-454.
38. Np[O(log n)] and sparse turing-complete sets for NP. J. Comput. Syst. Sci. 39, 282-298.
39. KAKAS, A., AND MANCARELLA, P. 1990. Database updates through abduction. In Proceedings of the Symposium on Very Large Databases (VLDB-90). Morgan-Kaufmann, San Mateo, Calif., pp. 650-661.
40. KANN, V. 1992. On the approximability of NP-complete optimization problems. Ph.D. dissertation. Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, Sweden, May.
41. KONOLIGE, K. 1992. Abduction versus closure in causal theories. Artif. Int. 53, 255-272.
42. KOUTSOUPIAS, E., AND PAPADIMITRIOU, C. 1992. On the greedy algorithm for satisfiability. Inf. Proc. Lett. 43, 53-55.
43. KOWALSKI, R. 1991. Logic programs in artificial intelligence. In Proceedings of the 1991 International Joint Conference on Artificial Intelligence, Morgan-Kaufmann, San Mateo, Calif., pp. 596-601.
44. KRENTEL, M. 1988. The complexity of optimization problems. J. Comput. Syst. Sci. 36, 490-509.
45. KRENTEL, M. 1992. Generalizations of OptP to the polynomial hierarchy. Theoret. Comput. Sci. 97, 2, 183-198.
46. LEVESQUE, H. 1989. A knowledge-level account for abduction. In Proceedings of the 1989 International Joint Conference on Artificial Intelligence. Morgan-Kaufmann, San Mateo, Calif., pp. 1061-1067.
47. LIFSCHITZ, V. 1985. Computing circumscription. In Proceedings of the 1985 International Joint Conference on Artificial Intelligence. Morgan-Kaufmann, San Mateo, Calif., pp. 121-127.
48. MAREK, W., AND TRUSZCZYNSKI, M. 1990. Modal logic for default reasoning. Ann. Math. Artif. Int. 1, 275-302.
49. MCDERMOTT, D. 1982. Non-monotonic logic II: Nonmonotonic modal theories. J. ACM 29, 33-57.
50. MCDERMOTT, D., AND DOYLE, J. 1980. Non-monotonic logic I. Artif. Int. 13, 41-72.
51. MEYER, A., AND STOCKMEYER, L. 1972. The equivalence problem for regular expressions with squaring requires exponential time. In Proceedings of the 13th Annual Symposium on Switching and Automata Theory. IEEE Computer Society, New York, pp. 125-129.
52. MOORE, R. 1985. Semantical considerations on nonmonotonic logics. Artif. Int. 25, 75-94.
53. MORGAN, C. G. 1971. Hypothesis generation by machine. Artif. Int. 2, 179-187.
54. NEBEL, B. 1991. Belief revision and default reasoning: Syntax-based approaches. In Proceedings KR-91. pp. 417-428.
55. NORVIG, P. 1987. Inference in text understanding. In Proceedings AAAI-87. Morgan-Kaufmann, San Mateo, Calif., pp. 561-565.
56. PAPADIMITRIOU, C, AND SIDERI, M. 1992. On finding extensions on default theories. In Proceedings 4th International Conference on Database Theory (ICDT 92) (Oct.). Springer, New York, Lecture Notes in Computer Science, 646, pp. 276-281.
57. PEARL, J. 1986. Fusion, propagation, and structuring in belief networks. Artif. Int. 29, 241-288.
58. PEARL, J. 1988. Probabilistic Reasoning in Intelligent Systems. Morgan-Kaufmann, San Mateo, Calif.
59. PEIRCE, C. S. 1955. Abduction and induction. In Philosophical Writings of Peirce, chapter 11. J. Buchler, ed. Dover, New York.
60. PENG, Y. AND REGGIA, J. 1990. Abductive Inference Models for Diagnostic Problem Solving. Springer-Verlag, New York.
61. POOLE, D. 1988. A logical framework for default reasoning. Artif. Int. 36, 27-47.
62. POOLE, D. 1989a. A methodology for using a default and abductive reasoning system. Int. J. Int. Syst. 5, 5, 521-548.
63. POOLE, D. 1989b. Explanation and prediction: An architecture for default and abductive reasoning. Comput. Int. 5, 1, 97-110.
64. POOLE, D. 1989c. Normality and faults in logic based diagnosis. In Proceedings of the 1989 International Joint Conference on Artificial Intelligence. Morgan-Kaufmann, San Mateo, Calif., pp. 1304-1310.
65. POPLE, H. 1973. On the mechanization of abductive logic. In Proceedings of the 1973 International Joint Conference on Artificial Intelligence. Morgan-Kaufmann, San Mateo, Calif., pp. 147-152.
66. PROVAN, G. 1990. The computational complexity of multiple-context truth maintenance systems. In Proceedings ECAI-90, (Aug). pp. 522-527.
67. REITER, R. 1980. A logic for default reasoning. Artif. Int. 13, 81-132.
68. REITER, R. 1987. A theory of diagnosis from first principles. Artif. Int. 32, 57-95.
69. RUTENBURG, V. 1991. Complexity classification in truth maintenance systems. In Proceedings STACS-91. pp. 373-383.
70. SELMAN, B., AND LEVESQUE, H. J. 1990. Abductive and default reasoning: A computational core. In Proceedings AAAI-90, (July), pp. 343-348.
71. SELMAN, B., LEVESQUE, H. J., AND MITCHELL, D. 1992. A new method for solving hard satisfiability problems. In Proceedings AAAI-92 (July), pp. 440-446.
72. STILLMAN, J. 1992. The complexity of propositional default logic. In Proceedings AAAI-92 (July), pp. 794-799.
73. STOCKMEYER, L., AND MEYER, A. 1973. Word problems requiring exponential time. In Proceedings of the 5th ACM Symposium on the Theory of Computing (Apr. 30-May 2, Austin, Tex.). ACM, New York, pp. 1-9.
74. WAGNER, K. 1987. More complicated questions about maxima and minima, and some closures of NP. Theoret. Comput. Sci. 51, 53-80.
75. WAGNER, K. 1990. Bounded query classes. SIAM J. Comput. 19, 5, 833-846.