- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On the computational complexity of temporal projection, planning, and plan validation
Artificial Intelligence 66 (1):125-160 (1994)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Computational complexity of planning and approximate planning in the presence of incompleteness.Chitta Baral, Vladik Kreinovich & Raúl Trejo - 2000 - Artificial Intelligence 122 (1-2):241-267.
The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
Decidability and complexity of action-based temporal planning over dense time.Nicola Gigante, Andrea Micheli, Angelo Montanari & Enrico Scala - 2022 - Artificial Intelligence 307 (C):103686.
Nonmonotonic logic and temporal projection.Steve Hanks & Drew McDermott - 1987 - Artificial Intelligence 33 (3):379-412.
A validation-structure-based theory of plan modification and reuse.Subbarao Kambhampati & James A. Hendler - 1992 - Artificial Intelligence 55 (2-3):193-258.
O-Plan: The open planning architecture.Ken Currie & Austin Tate - 1991 - Artificial Intelligence 52 (1):49-86.
Domain-independent planning Representation and plan generation.David E. Wilkins - 1984 - Artificial Intelligence 22 (3):269-301.
Planning as satisfiability: parallel plans and algorithms for plan search.Jussi Rintanen, Keijo Heljanko & Ilkka Niemelä - 2006 - Artificial Intelligence 170 (12-13):1031-1080.
Plan aggregation for strong cyclic planning in nondeterministic domains.Ron Alford, Ugur Kuter, Dana Nau & Robert P. Goldman - 2014 - Artificial Intelligence 216 (C):206-232.
Planning and understanding: A computational approach to human reasoning.Daniel Berlin - 1984 - Artificial Intelligence 23 (2):242-244.
Analytics
Added to PP
2020-12-22
Downloads
6 (#1,482,377)
6 months
4 (#1,006,062)
2020-12-22
Downloads
6 (#1,482,377)
6 months
4 (#1,006,062)
Historical graph of downloads
Citations of this work
On the nature and role of modal truth criteria in planning.Subbarao Kambhampati & Dana S. Nau - 1996 - Artificial Intelligence 82 (1-2):129-155.
References found in this work
Strips: A new approach to the application of theorem proving to problem solving.Richard E. Fikes & Nils J. Nilsson - 1971 - Artificial Intelligence 2 (3-4):189-208.
The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
Complexity, decidability and undecidability results for domain-independent planning.Kutluhan Erol, Dana S. Nau & V. S. Subrahmanian - 1995 - Artificial Intelligence 76 (1-2):75-88.
Reasoning about partially ordered events.Thomas Dean & Mark Boddy - 1988 - Artificial Intelligence 36 (3):375-399.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-5pqs9 uwo