Solving planning domains with polytree causal graphs is NP-complete
Artificial Intelligence
2007-05-23 v1 Computational Complexity
Abstract
We show that solving planning domains on binary variables with polytree causal graph is \NP-complete. This is in contrast to a polynomial-time algorithm of Domshlak and Brafman that solves these planning domains for polytree causal graphs of bounded indegree.
Keywords
Cite
@article{arxiv.cs/0610095,
title = {Solving planning domains with polytree causal graphs is NP-complete},
author = {Omer Giménez},
journal= {arXiv preprint arXiv:cs/0610095},
year = {2007}
}