Complexity Results for Structure−Based Causality
Thomas Eiter and Thomas Lukasiewicz
Abstract
We analyze the computational complexity of causal relationships in Pearl's structural models, where we focus on causality between variables, event causality, and probabilistic causality. In particular, we analyze the complexity of the sophisticated notions of weak and actual causality by Halpern and Pearl. In the course of this, we also prove an open conjecture by Halpern and Pearl, and establish other semantic results. To our knowledge, no complexity aspects of causal relationships have been considered so far, and our results shed light on this issue.
Book Title
Proceedings of the 17th International Joint Conference on Artificial Intelligence‚ IJCAI 2001‚ Seattle‚ Washington‚ USA‚ August 4−10‚ 2001
Editor
Bernhard Nebel
ISBN
1−55860−777−3
Note
IJCAI−01 Distinguished Paper Award (best paper of 796 submitted and 197 accepted papers at IJCAI−01).
Pages
35−42
Publisher
Morgan Kaufmann
Year
2001