The computational complexity of propositional STRIPS planning
- 1 September 1994
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 69 (1-2), 165-204
- https://doi.org/10.1016/0004-3702(94)90081-7
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Impediments to universal preference-based default theoriesArtificial Intelligence, 1991
- Reasoning about partially ordered eventsArtificial Intelligence, 1988
- Reasoning about action IArtificial Intelligence, 1988
- Planning as search: A quantitative approachArtificial Intelligence, 1987
- Planning for conjunctive goalsArtificial Intelligence, 1987
- Temporal data base managementArtificial Intelligence, 1987
- Expressiveness and tractability in knowledge representation and reasoning1Computational Intelligence, 1987
- Macro-operators: A weak method for learningArtificial Intelligence, 1985
- Strips: A new approach to the application of theorem proving to problem solvingArtificial Intelligence, 1971
- The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are BinaryMathematical Logic Quarterly, 1967