Complexity results for explanations in the structural-model approach

Artificial Intelligence

Volumn 154, Issue 1-2, 2004, Pages 145-198

  Eiter, Thomas ^a   Lukasiewicz, Thomas ^a,b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

partial explanation; Causal model; Complexity; Explanation; Explanatory power; Partial explanation; Probabilistic causal model; Weak cause

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; MATHEMATICAL MODELS;

Α-PARTIAL EXPLANATION; CAUSAL MODEL; EXPLANATORY POWER; PROBABILISTIC CAUSAL MODEL; WEAK CAUSE;

ARTIFICIAL INTELLIGENCE;

EID: 1242264966     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2003.06.002     Document Type: Article

References (52)

1. Abdelbar A.M., Hedetniemi S.T., Hedetniemi S.M. The complexity of approximating MAPs for belief networks with bounded probabilities. Artificial Intelligence. 124:2000;283-288.
2. Balke A., Pearl J. Probabilistic evaluation of counterfactual queries. Proceedings of AAAI-94, Seattle, WA. 1994;230-237.
3. Buss S., Hay L. On truth-table reducibility to SAT. Inform. and Comput. 91:1991;86-102.
4. Bylander T., Allemang D., Tanner M.C., Josephson J.R. The computational complexity of abduction. Artificial Intelligence. 49:1991;25-60.
5. Cadoli M., Schaerf M., Giovanardi A., Giovanardi M. An algorithm to evaluate quantified Boolean formulae and its experimental evaluation. J. Automat. Reason. 28:2002;101-142. Preliminary abstract: An algorithm to evaluate quantified Boolean formulae, in: Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference (AAAI/IAAI-98), Madison, WI, 1998, pp. 262-267.
6. Cadoli M., Schaerf M., Giovanardi A., Giovanardi M. An algorithm to evaluate quantified Boolean formulae and its experimental evaluation. J. Automat. Reason. 28:2002;101-142. Preliminary abstract: An algorithm to evaluate quantified Boolean formulae, in: Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference (AAAI/IAAI-98), Madison, WI, 1998, pp. 262-267.
7. Chajewska U., Halpern J.Y. Defining explanation in probabilistic systems. Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI-97), Providence, RI. 1997;62-71.
8. Cooper G.F. The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence. 42:1990;393-405.
9. del Val A. On some tractable classes in deduction and abduction. Artificial Intelligence. 116:(1-2):2000;297-313.
10. del Val A. The complexity of restricted consequence finding and abduction. Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence (AAAI/IAAI-00), Austin, TX. 2000;337-342.
11. Eiter T., Faber W., Leone N., Pfeifer G. The diagnosis frontend of the dlv system. European J. Artificial Intelligence (AI Communications). 12:(1-2):1999;99-111.
12. Eiter T., Gottlob G. The complexity of logic-based abduction. J. ACM. 42:(1):1995;3-42.
13. Eiter T., Gottlob G., Leone N. Abduction from logic programs: Semantics and complexity. Theoret. Comput. Sci. 189:(1-2):1997;129-177.
14. Eiter T., Leone N., Mateis C., Pfeifer G., Scarcello F. The KR system dlv: Progress report, comparisons, and benchmarks. Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), Trento, Italy. 1998;406-417.
15. Eiter T., Lukasiewicz T. Complexity results for structure-based causality. Proceedings of IJCAI-2001, Seattle, WA. 2001;35-40.
16. Eiter T., Lukasiewicz T. Causes and explanations in the structural-model approach: Tractable cases. Proceedings Eighteenth Conference on Uncertainty in Artificial Intelligence (UAI-2002), Edmonton, AL. 2002;146-153.
17. T. Eiter, T. Lukasiewicz, Causes and explanations in the structural-model approach: Tractable cases, Technical Report INFSYS RR-1843-02-03, Institut für Informationssysteme, Technische Universität Wien, 2002.
18. Eiter T., Lukasiewicz T. Complexity results for explanations in the structural-model approach. Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR 2002), Toulouse, France. 2002;49-60.
19. Eiter T., Lukasiewicz T. Complexity results for structure-based causality. Artificial Intelligence. 142:(1):2002;53-89.
20. Feldmann R., Monien B., Schamberger S. A distributed algorithm to evaluate quantified Boolean formulae. Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence (AAAI/IAAI-00), Austin, TX. 2000;285-290.
21. Galles D., Pearl J. Axioms of causal relevance. Artificial Intelligence. 97:1997;9-43.
22. Gärdenfors P. Knowledge in Flux. 1988;MIT Press, Cambridge, MA.
23. Geffner H. Causal theories for nonmonotonic reasoning. Proceedings of AAAI-90, Boston, MA. 1990;524-530.
24. Geffner H. Default Reasoning: Causal and Conditional Theories. 1992;MIT Press, Cambridge, MA.
25. Halpern J.Y. Axiomatizing causal reasoning. J. Artificial Intelligence Res. 12:2000;317-337.
26. J.Y. Halpern, J. Pearl, Causes and explanations: A structural-model approach, Technical Report R-266, UCLA Cognitive Systems Lab., 2000.
27. Halpern J.Y., Pearl J. Causes and explanations: A structural-model approach, Part I: Causes. Proceedings of the Seventeenth Conference in Uncertainty in Artificial Intelligence (UAI-01), Seattle, WA. 2001;194-202.
28. Halpern J.Y., Pearl J. Causes and explanations: A structural-model approach, Part II: Explanations. Proceedings of IJCAI-2001, Seattle, WA. 2001;27-34.
29. Hempel C.G. Aspects of Scientific Explanation. 1965;Free Press.
30. Henrion M., Druzdzel M.J. Qualitative propagation and scenario-based approaches to explanation of probabilistic reasoning. Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence. 1990;17-32 MIT, Cambridge, MA/Elsevier, Amsterdam.
31. Hopkins M. Strategies for determining causes of reported events. Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence (AAAI/IAAI-02), Edmonton, Alberta. 2002;546-552.
32. Jenner B., Toran J. Computing functions with parallel queries to NP. Theoret. Comput. Sci. 141:1995;175-193.
33. Johnson D.S. A catalog of complexity classes. van Leeuwen J. Handbook of Theoretical Computer Science, vol. A. 1990;Elsevier, Amsterdam. Chapter 2.
34. Pearl J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. 1988;Morgan Kaufmann, San Mateo, CA.
35. Kask K., Dechter R. A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence. 129:2001;91-131.
36. Konolige K. Abduction versus closure in causal theories. Artificial Intelligence. 53:1992;255-272.
37. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, C. Koch, C. Mateis, S. Perri, F. Scarcello, The DLV system for knowledge representation and reasoning, Technical Report INFSYS RR-1843-02-14, Institut für Informationssysteme, Technische Universität Wien, 2002.
38. Lifschitz V. On the logic of causal explanation. Artificial Intelligence. 96:1997;451-465.
39. McCain N., Turner H. Causal theories of action and change. Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference (AAAI/IAAI-97), Providence, RI. 1997;460-465.
40. Papadimitriou C.H. Computational Complexity. 1994;Addison-Wesley, Reading, MA.
41. Pearl J. Reasoning with cause and effect. Proceedings of IJCAI-99, Stockholm, Sweden. 1999;1437-1449.
42. Pearl J. Causality: Models, Reasoning, and Inference. 2000;Cambridge University Press, Cambridge.
43. Rintanen J. Improvements to the evaluation of quantified boolean formulae. Proceedings of IJCAI-99, Stockholm, Sweden. 1999;1192-1197.
44. Roth D. On the hardness of approximate reasoning. Artificial Intelligence. 82:(1-2):1996;273-302.
45. Rutenburg V. Propositional truth maintenance systems: Classification and complexity analysis. Ann. Math. Artificial Intelligence. 10:1994;207-231.
46. Salmon W.C. Four Decades of Scientific Explanation. 1989;University of Minnesota Press, Duluth, MN.
47. Selman A. A taxonomy of complexity classes of functions. J. Comput. Systems Sci. 48:1994;357-381.
48. Selman B., Levesque H.J. Support set selection for abductive and default reasoning. Artificial Intelligence. 82:1996;259-272.
49. Shimony S.E. Explanation, irrelevance, and statistical independence. Proceedings of AAAI-91, Anaheim, CA. 1991;482-487.
50. Shimony S.E. Finding MAPs for belief networks is NP-hard. Artificial Intelligence. 68:1994;399-410.
51. Turner H. A logic of universal causation. Artificial Intelligence. 113:1999;87-123.
52. Wagner K. Bounded query classes. SIAM J. Comput. 19:(5):1990;833-846.