On the computational complexity of temporal projection, planning, and plan validation
- 31 March 1994
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 66 (1) , 125-160
- https://doi.org/10.1016/0004-3702(94)90005-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Plan-based integration of natural language and graphics generationArtificial Intelligence, 1993
- On the complexity of blocks-world planningArtificial Intelligence, 1992
- Planning in polynomial time: the SAS‐PUBS classComputational Intelligence, 1991
- Reasoning about partially ordered eventsArtificial Intelligence, 1988
- Planning for conjunctive goalsArtificial Intelligence, 1987
- Maintaining knowledge about temporal intervalsCommunications of the ACM, 1983
- Strips: A new approach to the application of theorem proving to problem solvingArtificial Intelligence, 1971