ML Anthology

Causal Theories of Action: A Computational Core

Jérôme Lang, Fangzhen Lin, Pierre Marquis
IJCAI 2003 pp. 1073-1078
/ijcai/2003/lang2003ijcai-causal/

Abstract

We propose a framework for simple causal theories of action, and study the computational complexity in it of various reasoning tasks such as determinism, progression and regression under various assumptions. As it turned out, even the simplest one among them, one-step temporal projection with complete initial state, is intractable. We also briefly consider an extension of the framework to allow truly indeterministic actions, and find that this extension does not increase the complexity of any of the tasks considered here. 1

PDF Semantic Scholar

Cite

Text

Lang et al. "Causal Theories of Action: A Computational Core." International Joint Conference on Artificial Intelligence, 2003.

Markdown

[Lang et al. "Causal Theories of Action: A Computational Core." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/lang2003ijcai-causal/)

BibTeX

@inproceedings{lang2003ijcai-causal,
  title     = {{Causal Theories of Action: A Computational Core}},
  author    = {Lang, Jérôme and Lin, Fangzhen and Marquis, Pierre},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2003},
  pages     = {1073-1078},
  url       = {https://mlanthology.org/ijcai/2003/lang2003ijcai-causal/}
}