Polynomial-Length Planning Spans the Polynomial Hierarchy
Author:
- 20 September 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 111-124
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Planning under Incomplete Knowledge2000
- Computational complexity of planning and approximate planning in the presence of incompletenessArtificial Intelligence, 2000
- Some Results on the Complexity of Planning with Incomplete InformationLecture Notes in Computer Science, 2000
- Automata-Theoretic Approach to Planning for Temporally Extended Goals2000
- Constructing Conditional Plans by a Theorem-ProverJournal of Artificial Intelligence Research, 1999
- The Computational Complexity of Probabilistic PlanningJournal of Artificial Intelligence Research, 1998
- COMPLEXITY RESULTS FOR SAS+ PLANNINGComputational Intelligence, 1995
- Complexity, decidability and undecidability results for domain-independent planningArtificial Intelligence, 1995
- The computational complexity of propositional STRIPS planningArtificial Intelligence, 1994