- 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
Planning as satisfiability: Heuristics
Artificial Intelligence 193 (C):45-86 (2012)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Planning as satisfiability: parallel plans and algorithms for plan search.Jussi Rintanen, Keijo Heljanko & Ilkka Niemelä - 2006 - Artificial Intelligence 170 (12-13):1031-1080.
Contingent planning under uncertainty via stochastic satisfiability.Stephen M. Majercik & Michael L. Littman - 2003 - Artificial Intelligence 147 (1-2):119-162.
Sequential Monte Carlo in reachability heuristics for probabilistic planning.Daniel Bryce, Subbarao Kambhampati & David E. Smith - 2008 - Artificial Intelligence 172 (6-7):685-715.
Boosting optimal symbolic planning: Operator-potential heuristics.Daniel Fišer, Álvaro Torralba & Jörg Hoffmann - 2024 - Artificial Intelligence 334 (C):104174.
Symbolic perimeter abstraction heuristics for cost-optimal planning.Álvaro Torralba, Carlos Linares López & Daniel Borrajo - 2018 - Artificial Intelligence 259 (C):1-31.
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits.Blai Bonet & Héctor Geffner - 2008 - Artificial Intelligence 172 (12-13):1579-1604.
Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search.XuanLong Nguyen, Subbarao Kambhampati & Romeo S. Nigenda - 2002 - Artificial Intelligence 135 (1-2):73-123.
The satisfiability constraint gap.Ian P. Gent & Toby Walsh - 1996 - Artificial Intelligence 81 (1-2):59-80.
On the satisfiability of circumscription.Vladimir Lifschitz - 1986 - Artificial Intelligence 28 (1):17-27.
Optimizing with minimum satisfiability.Chu Min Li, Zhu Zhu, Felip Manyà & Laurent Simon - 2012 - Artificial Intelligence 190 (C):32-44.
Analytics
Added to PP
2020-12-22
Downloads
19 (#1,063,060)
6 months
5 (#1,013,271)
2020-12-22
Downloads
19 (#1,063,060)
6 months
5 (#1,013,271)
Historical graph of downloads
Citations of this work
Red–black planning: A new systematic approach to partial delete relaxation.Carmel Domshlak, Jörg Hoffmann & Michael Katz - 2015 - Artificial Intelligence 221 (C):73-114.
Overview and analysis of the SAT Challenge 2012 solver competition.Adrian Balint, Anton Belov, Matti Järvisalo & Carsten Sinz - 2015 - Artificial Intelligence 223 (C):120-155.
Computing programs for generalized planning using a classical planner.Javier Segovia-Aguas, Sergio Jiménez & Anders Jonsson - 2019 - Artificial Intelligence 272 (C):52-85.
Generalized planning as heuristic search: A new planning search-space that leverages pointers over objects.Javier Segovia-Aguas, Sergio Jiménez & Anders Jonsson - 2024 - Artificial Intelligence 330 (C):104097.
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.
Planning as heuristic search.Blai Bonet & Héctor Geffner - 2001 - Artificial Intelligence 129 (1-2):5-33.
Planning as satisfiability: parallel plans and algorithms for plan search.Jussi Rintanen, Keijo Heljanko & Ilkka Niemelä - 2006 - Artificial Intelligence 170 (12-13):1031-1080.
Experimental results on the crossover point in random 3-SAT.James M. Crawford & Larry D. Auton - 1996 - Artificial Intelligence 81 (1-2):31-57.
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-667477cd97-cvrck dc2