Semantics and complexity of abduction from default theories

Artificial Intelligence

Volumn 90, Issue 1-2, 1997, Pages 177-223

  Eiter, Thomas ^a   Gottlob, Georg ^a   Leone, Nicola ^a,b  

^a INSTITUTE FOR MICROELECTRONICS   (Austria)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Abduction; Algorithms and complexity; Default logic; Tractability

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; KNOWLEDGE BASED SYSTEMS; KNOWLEDGE REPRESENTATION;

ABDUCTION; DEFAULT LOGIC; TRACTABILITY;

ARTIFICIAL INTELLIGENCE;

EID: 0031071364     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(96)00040-9     Document Type: Article

References (62)

1. A. Aho and J. Ullman, Universality of data retrieval languages, in: Proceedings Sixth ACM Symposium on Principles of Programming Languages, San Antonio, TX (1979) 110-117.
2. L. Aiello and D. Nardi, Perspectives in knowledge representation, Appl. Artif. Intell. 5 (1991) 29-44.
3. B. Aspvall, M. Plass and R. Tarjan, A linear time algorithm for testing the truth of certain quantified boolean formulas, Inform. Process. Lett. 8 (1979) 121-123.
4. C. Baral and V. Subrahmanian, Dualities between alternative semantics for logic programming and nonmonotonic reasoning, J. Autom. Reasoning 10 (1991) 299-340.
5. G. Brewka, Nonmonotonic Reasoning: Logical Foundations of Commonsense, Cambridge Tracts in Theoretical Computer Science 12 (Cambridge University Press, Cambridge, 1991).
6. T. Bylander, The monotonic abduction problem: a functional characterization on the edge of tractability, in: Proceedings KK-91, Cambridge, MA (1991) 70-77.
7. T. Bylander, D. Allemang, M. Tanner and J. Josephson, The computational complexity of abduction, Artif. Intell. 49 (1991) 25-60.
8. M. Cadoli, T. Eiter and G. Gottlob, Default logic as a query language, in: Proceedings KR-94, Bonn (1994) 99-108; also full paper in: IEEE Trans. Knowledge Data Eng. (to appear).
9. M. Cadoli, T. Eiter and G. Gottlob, Default logic as a query language, in: Proceedings KR-94, Bonn (1994) 99-108; also full paper in: IEEE Trans. Knowledge Data Eng. (to appear).
10. M. Cadoli and M. Schaerf, A survey of complexity results for non-monotonic logics, J. Logic Program. 17 (1993) 127-160.
11. M. Cadoli and M. Schaerf, Tractable reasoning via approximation, Artif. Intell. 74 (1995) 249-310.
12. A. Chandra and D. Harel, Structure and complexity of relational queries, J. Comput. Syst. Sci. 25 (1982) 99-128.
13. E. Charniak and P. McDermott, Introduction to Artificial Intelligence (Addison-Wesley, Menlo Park, CA, 1985).
14. P. Cholewiński, W. Marek, A. Mikitiuk and M. Truszczyński, Experimenting with nonmonotonic reasoning, in: Proceedings ICLP-95, Shonan Village Center (1995).
15. A. Condon, Approximate solutions to problems in PSPACE, SIGACT News 26 (2) (1995) 4-13.
16. L. Console, D. Theseider Dupré and P. Torasso, A theory of diagnosis for incomplete causal models, in: Proceedings IJCAI-89, Detroit, MI (1989) 1311-1317.
17. L. Console, D. Theseider Dupré and P. Torasso, On the relationship between abduction and deduction, J. Logic Comput. 1 (1991) 661-690.
18. P. Dagum and M. Luby, Approximating probabilistic inference in Bayesian belief networks is NP-hard, Artif. Intell. 60 (1993) 141-153.
19. F. Donini, D. Nardi, F. Pirri and M. Schaerf, Nonmonotonic reasoning, Artif. Intell. Rev. 4 (1991) 163-210.
20. F. Donini, D. Nardi and R. Rosati. Ground nonmonotonic modal logics for knowledge representation, in: Proceedings World Congress for AI (WOCFAI-95) (1995).
21. T. Eiter and G. Gottlob, On the complexity of propositional knowledge base revision, updates, and counterfactuals, Artif. Intell. 57 (1992) 227-270.
22. T. Eiter and G. Gottlob, Reasoning with parsimonious and moderately grounded expansions, Fund. Inform. 17 (1992) 31-53.
23. T. Eiter and G. Gottlob, The complexity of logic-based abduction, J. ACM 42 (1995) 3-42.
24. T. Eiter, G. Gottlob and N. Leone, Complexity results for abductive logic programming, in: W. Marek, A. Nerode and M. Truszczyński, eds., in: Proceedings LPNMR '95, Lecture Notes in Computer Science 982 (Springer, New York, 1995) 1-14.
25. K. Eshghi, Abductive planning with event calculus, in: Proceedings 5th International Conference and Symposium on Logic Programming (1988) 562-579.
26. S. Even, A. Itai and A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM J. Comput. 5 (1976) 691-703.
27. M. Gelfond, H. Przymusinska, V. Lifschitz and M. Truszczyński, Disjunctive defaults, in: Proceedings KR-91, Cambridge, MA (1991) 230-237.
28. G. Gottlob, Complexity results for nonmonotonic logics, J. Logic Comput. 2 (1992) 397-425.
29. G. Gottlob, The complexity of propositional default reasoning under the stationary fixed point semantics, Inform. Comput. 121 (1995) 81-92.
30. G. Gottlob, N. Leone and H. Veith, Second-order logic and the weak exponential hierarchies, in: Proceedings of the Conference on Mathematical Foundations of Computer Science (MFCS-95), Lecture Notes in Computer Science 969 (Springer, New york, 1995) 66-81; also full paper available as: CD/TR 95/80, CD-Lab for Expert Systems, TU Wien.
31. J.R. Hobbs, M.E. Stickel, P. Martin and D. Edwards, Interpretation as abduction, in: Proceedings 26th Annual Meeting of the Association for Computational Linguistics, Buffalo, NY (1988) 95-103.
32. D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science Vol. A (North-Holland, Amsterdam, 1990) Chapter 2.
33. J. Josephson, B. Chandrasekaran, J.J.W. Smith and M. Tanner, A mechanism for forming composite explanatory hypotheses, IEEE Trans. Syst. Man Cybern. 17 (1987) 445-454.
34. A. Kakas, R. Kowalski and F. Toni, Abductive logic programming, J. Logic Comput. (1993).
35. A. Kakas and P. Mancarella, Database updates through abduction, in: Proceedings VLDB-90 (1990) 650-661.
36. H. Kautz and B. Selman, Hard problems for simple default logics, Artif. Intell. 49 (1991) 243-279.
37. K. Konolige, On the relationship between default and autoepistemic logic, Artif. Intell. 35 (1988) 343-382; see also: Errata, Artif. Intell. 41 (1989/90) 115.
38. K. Konolige, Abduction versus closure in causal theories, Artif. Intell. 53 (1992) 255-272.
39. W. Marek and M. Truszczyński, Nonmonotonic Logics (Springer, Berlin, 1993).
40. A. Mikitiuk and M. Truszczyński, Rational default logic and disjunctive logic programming, in: L.-M. Pereira and A. Nerode, eds., Proceedings LPNMR'93 (1993) 115-131.
41. M. Minoux, LTUR: a simplified linear time unit resolution for Horn formulae and computer implementation, Inform. Process. Lett. 29 (1988) 1-12.
42. B. Nebel, Artificial intelligence: a computational perspective, in: G. Brewka, ed., Logic and Computation in AI (to appear).
43. H.T. Ng and R.J. Mooney, An efficient first-order Horn clause abduction system based on the ATMS, in: Proceedings AAAI-91, Anaheim, CA (1991) 494-499.
44. Y. Peng and J. Reggia, Abductive Inference Models for Diagnostic Problem Solving (Springer, Berlin, 1990).
45. D. Poole, A logical framework for default reasoning, Artif. Intell. 36 (1988) 27-47.
46. D. Poole, Explanation and prediction: an architecture for default and abductive reasoning, Comput. Intell. 5 (1989) 97-110.
47. D. Poole, Normality and faults in logic based diagnosis, in: Proceedings IJCAI-89, Detroit, MI (1989) 1304-1310.
48. D. Poole, Logic programming, abduction and probability, New Generation Comput. 11 (1993) 377-400.
49. D. Poole, Probabilistic Horn abduction and Bayesian networks, Artif. Intell. 64 (1993) 81-130.
50. H. Przymusinska and T. Przymusinski, Stationary default extensions, Fund. Inform. 21 (1994) 67-87.
51. A. Rajasekar, Theories of trans-epistemic defaults, Tech. Rept., University of Kentucky, Lexington, KY (1994).
52. A. Rajasekar and M. Truszczyński, Complexity of trans-epistemic defaults, Manuscript (1995).
53. R. Reiter, A logic for default reasoning, Artif. Intell. 13 (1980) 81-132.
54. R. Reiter, Nonmonotonic reasoning, Ann. Rev. Comput. Sci. 2 (1987) 147-186.
55. D. Roth, On the hardness of approximate reasoning, Artif. Intell. 82 (1996) 273-302.
56. B. Selman and H. Kautz, Knowledge compilation using Horn approximations, in: Proceedings AAAI-91, Anaheim, CA (1991) 904-909.
57. B. Selman and H.J. Levesque, Abductive and default reasoning: a computational core, in: Proceedings AAAI-90, Boston, MA (1990) 343-348.
58. B. Selman, H. Levesque and D. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings AAAI-92, San Jose, CA (1992) 440-446.
59. J. Stillman, It's not my default: the complexity of membership problems in restricted propositional default logic, in: Proceedings AAAI-90, Boston, MA (1990) 571-579.
60. J. Stillman, The complexity of propositional default logic, in: Proceedings AAAI-92, San Jose, CA (1992) 794-799.
61. L. Stockmeyer, On approximation algorithms for # P, SIAM J. Comput. 14 (1985) 849-861.
62. M. Vardi, Complexity of relational query languages, in: Proceedings 14th Annual ACM Symposium on Theory of Computing, San Francisco, CA (1982) 137-146.