Complexity, decidability and undecidability results for domain-independent planning
- 31 July 1995
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 76 (1-2) , 75-88
- https://doi.org/10.1016/0004-3702(94)00080-k
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- MERGING SEPARATELY GENERATED PLANS WITH RESTRICTED INTERACTIONSComputational Intelligence, 1992
- On the complexity of blocks-world planningArtificial Intelligence, 1992
- Planning in polynomial time: the SAS‐PUBS classComputational Intelligence, 1991
- Regression planningInternational Journal of Intelligent Systems, 1991
- Reasoning about partially ordered eventsArtificial Intelligence, 1988
- Synthesizing plans that contain actions with context‐dependent effects1Computational Intelligence, 1988
- Planning as search: A quantitative approachArtificial Intelligence, 1987
- Planning for conjunctive goalsArtificial Intelligence, 1987
- Planning in a hierarchy of abstraction spacesArtificial Intelligence, 1974
- Strips: A new approach to the application of theorem proving to problem solvingArtificial Intelligence, 1971