- 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
Decidability and complexity of action-based temporal planning over dense time
Artificial Intelligence 307 (C):103686 (2022)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
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.
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.
On the computational complexity of temporal projection, planning, and plan validation.Bernhard Nebel & Christer Bäckström - 1994 - Artificial Intelligence 66 (1):125-160.
Localized planning with action-based constraints.Amy L. Lansky - 1998 - Artificial Intelligence 98 (1-2):49-136.
On the decidability and complexity of reasoning about only knowing.Riccardo Rosati - 2000 - Artificial Intelligence 116 (1-2):193-215.
Heuristic planning: A declarative approach based on strategies for action selection.Josefina Sierra-Santibáñez - 2004 - Artificial Intelligence 153 (1-2):307-337.
Gradient-based mixed planning with symbolic and numeric action parameters.Kebing Jin, Hankz Hankui Zhuo, Zhanhao Xiao, Hai Wan & Subbarao Kambhampati - 2022 - Artificial Intelligence 313 (C):103789.
The complexity of temporal logic over the reals.Mark Reynolds - 2010 - Annals of Pure and Applied Logic 161 (8):1063-1096.
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.
Strong temporal planning with uncontrollable durations.Alessandro Cimatti, Minh Do, Andrea Micheli, Marco Roveri & David E. Smith - 2018 - Artificial Intelligence 256 (C):1-34.
Analytics
Added to PP
2022-04-08
Downloads
19 (#1,094,146)
6 months
10 (#441,927)
2022-04-08
Downloads
19 (#1,094,146)
6 months
10 (#441,927)
Historical graph of downloads
Citations of this work
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.
References found in this work
The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
Weak, strong, and strong cyclic planning via symbolic model checking.A. Cimatti, M. Pistore, M. Roveri & P. Traverso - 2003 - Artificial Intelligence 147 (1-2):35-84.
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.
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.
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.
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-648784bb4d-ls7fw uwo