- 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
CPCES: A planning framework to solve conformant planning problems through a counterexample guided refinement
Artificial Intelligence 284 (C):103271 (2020)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning.Subbarao Kambhampati, Craig A. Knoblock & Qiang Yang - 1995 - Artificial Intelligence 76 (1-2):167-238.
Conformant planning via symbolic model checking and heuristic search.A. Cimatti, M. Roveri & P. Bertoli - 2004 - Artificial Intelligence 159 (1-2):127-206.
Approximation of action theories and its application to conformant planning.Phan Huy Tu, Tran Cao Son, Michael Gelfond & A. Ricardo Morales - 2011 - Artificial Intelligence 175 (1):79-119.
Solving QBF with counterexample guided refinement.Mikoláš Janota, William Klieber, Joao Marques-Silva & Edmund Clarke - 2016 - Artificial Intelligence 234 (C):1-25.
Conformant planning via heuristic forward search: A new approach.Jörg Hoffmann & Ronen I. Brafman - 2006 - Artificial Intelligence 170 (6-7):507-541.
Complexity of multi-agent conformant planning with group knowledge.Yanjun Li - 2023 - Synthese 201 (4):1-30.
More for free: A dynamic epistemic framework for conformant planning over transition systems.Yanjun Li, Quan Yu & Yanjing Wang - 2017 - Journal of Logic and Computation 27 (8):2383--2410.
Multi-agent Conformant Planning with Distributed Knowledge.Yanjun Li - 2021 - In Sujata Ghosh & Thomas Icard (eds.), Logic, Rationality, and Interaction: 8th International Workshop, Lori 2021, Xi’an, China, October 16–18, 2021, Proceedings. Springer Verlag. pp. 128-140.
Fast planning through planning graph analysis.Avrim L. Blum & Merrick L. Furst - 1997 - Artificial Intelligence 90 (1-2):281-300.
State space search nogood learning: Online refinement of critical-path dead-end detectors in planning.Marcel Steinmetz & Jörg Hoffmann - 2017 - Artificial Intelligence 245 (C):1-37.
Analytics
Added to PP
2020-12-22
Downloads
9 (#1,523,188)
6 months
6 (#856,140)
2020-12-22
Downloads
9 (#1,523,188)
6 months
6 (#856,140)
Historical graph of downloads
References found in this work
Fast planning through planning graph analysis.Avrim L. Blum & Merrick L. Furst - 1997 - Artificial Intelligence 90 (1-2):281-300.
The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.
Quantitative results concerning the utility of explanation-based learning.Steven Minton - 1990 - Artificial Intelligence 42 (2-3):363-391.
Macro-operators: A weak method for learning.Richard E. Korf - 1985 - Artificial Intelligence 26 (1):35-77.
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-559df78dcc-6qn2c uwo