The Computational Complexity of Propositional STRIPS Planning

@article{Bylander1994TheCC,
  title={The Computational Complexity of Propositional STRIPS Planning},
  author={Tom Bylander},
  journal={Artif. Intell.},
  year={1994},
  volume={69},
  pages={165-204}
}
I present several computational complexity results for propositional STRIPS planning, i.e., STRIPS planning restricted to ground formulas. Diierent planning problems can be deened by restricting the type of formulas, placing limits on the number of pre-and postconditions, by restricting negation in pre-and postconditions, and by requiring optimal plans. For these types of restrictions, I show when planning is tractable (polynomial) and intractable (NP-hard). In general, it is PSPACE-complete to… CONTINUE READING
Highly Influential
This paper has highly influenced 117 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 882 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 535 extracted citations

882 Citations

0204060'93'98'04'10'16
Citations per Year
Semantic Scholar estimates that this publication has 882 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…