Heuristic Planning with SAT: Beyond Uninformed Depth-First Search

Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dominant heuristic state-space search. The heuristics are simple and natural, and enforce pure depth-first search with backward chaining in the standard conflict-directed clause learning (CDCL) framework.

[1]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[2]  Jussi Rintanen,et al.  Heuristics for Planning with SAT , 2010, CP.

[3]  Jussi Rintanen.  Evaluation Strategies for Planning as Satisfiability , 2004, ECAI.

[4]  Malte Helmert,et al.  Landmarks Revisited , 2008, AAAI.

[5]  Toby Walsh,et al.  Handbook of satisfiability , 2009 .

[6]  David G. Mitchell,et al.  A SAT Solver Primer , 2005, Bull. EATCS.

[7]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[8]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[9]  Henry A. Kautz,et al.  Towards Understanding and Harnessing the Potential of Clause Learning , 2004, J. Artif. Intell. Res..

[10]  Jussi Rintanen.  Planning and SAT , 2009, Handbook of Satisfiability.

[11]  Ivan Serina,et al.  Planning as Propositional CSP: From Walksat to Local Search Techniques for Action Graphs , 2003, Constraints.

[12]  Jussi Rintanen,et al.  Planning as Satisfiability with Relaxed $-Step Plans , 2007, Australian Conference on Artificial Intelligence.

[13]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[14]  Ilkka Niemelä,et al.  Planning as satisfiability: parallel plans and algorithms for plan search , 2006, Artif. Intell..

[15]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[16]  David Cohen,et al.  Principles and Practice of Constraint Programming - CP 2010 - 16th International Conference, CP 2010, St. Andrews, Scotland, UK, September 6-10, 2010. Proceedings , 2010, CP.

[17]  Jussi Rintanen,et al.  A Planning Algorithm not based on Directional Search , 1998, KR.

[18]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).