Computational complexity of planning and approximate planning in the presence of incompleteness
- 1 September 2000
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 122 (1-2) , 241-267
- https://doi.org/10.1016/s0004-3702(00)00043-6
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Constructing Conditional Plans by a Theorem-ProverJournal of Artificial Intelligence Research, 1999
- Planning for Contingencies: A Decision-based ApproachJournal of Artificial Intelligence Research, 1996
- Complexity, decidability and undecidability results for domain-independent planningArtificial Intelligence, 1995
- The computational complexity of propositional STRIPS planningArtificial Intelligence, 1994
- Representing action and change by logic programsThe Journal of Logic Programming, 1993