COMPLEXITY RESULTS FOR SAS+ PLANNING
- 1 November 1995
- journal article
- Published by Wiley in Computational Intelligence
- Vol. 11 (4) , 625-655
- https://doi.org/10.1111/j.1467-8640.1995.tb00052.x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The computational complexity of propositional STRIPS planningArtificial Intelligence, 1994
- On the computational complexity of temporal projection, planning, and plan validationArtificial Intelligence, 1994
- On the complexity of blocks-world planningArtificial Intelligence, 1992
- A validation-structure-based theory of plan modification and reuseArtificial Intelligence, 1992
- Planning in polynomial time: the SAS‐PUBS classComputational Intelligence, 1991
- Planning in polynomial timePublished by Springer Nature ,1990
- Reasoning about partially ordered eventsArtificial Intelligence, 1988
- Planning as search: A quantitative approachArtificial Intelligence, 1987
- Planning for conjunctive goalsArtificial Intelligence, 1987
- Strips: A new approach to the application of theorem proving to problem solvingArtificial Intelligence, 1971