Complexity, decidability and undecidability results for domain-independent planning

, &
Artificial Intelligence 76 (1-2):75-88 (1995)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(94)00080-k

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,601

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

DEL-based epistemic planning: Decidability and complexity.Thomas Bolander, Tristan Charrier, Sophie Pinchinat & François Schwarzentruber - 2020 - Artificial Intelligence 287 (C):103304.
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.
Domain-independent planning Representation and plan generation.David E. Wilkins - 1984 - Artificial Intelligence 22 (3):269-301.
Domain-independent planning for services in uncertain and dynamic environments.Eirini Kaldeli, Alexander Lazovik & Marco Aiello - 2016 - Artificial Intelligence 236 (C):30-64.
Complexity results for standard benchmark domains in planning.Malte Helmert - 2003 - Artificial Intelligence 143 (2):219-262.
On the undecidability of probabilistic planning and related stochastic optimization problems.Omid Madani, Steve Hanks & Anne Condon - 2003 - Artificial Intelligence 147 (1-2):5-34.
On the decidability and complexity of reasoning about only knowing.Riccardo Rosati - 2000 - Artificial Intelligence 116 (1-2):193-215.
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.
Robust planning with incomplete domain models.Tuan Nguyen, Sarath Sreedharan & Subbarao Kambhampati - 2017 - Artificial Intelligence 245 (C):134-161.
On the complexity of planning for agent teams and its implications for single agent planning.Ronen I. Brafman & Carmel Domshlak - 2013 - Artificial Intelligence 198 (C):52-71.

Analytics

Added to PP
2020-12-22

Downloads
15 (#1,304,624)

6 months
2 (#1,347,684)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
Concise finite-domain representations for PDDL planning tasks.Malte Helmert - 2009 - Artificial Intelligence 173 (5-6):503-535.

View all 15 citations / Add more citations

References found in this work

Planning in a hierarchy of abstraction spaces.Earl D. Sacerdoti - 1974 - Artificial Intelligence 5 (2):115-135.
Planning for conjunctive goals.David Chapman - 1987 - Artificial Intelligence 32 (3):333-377.
Planning as search: A quantitative approach.Richard E. Korf - 1987 - Artificial Intelligence 33 (1):65-88.

View all 8 references / Add more references