Planning with SAT, Admissible Heuristics and A*
Jussi Rintanen · 2011
We study the relationship between optimal planning algorithms, in the form of (iterative deepening) A with (forward) state-space search, and the reduction of the problem to SAT. Our results establish a strict dominance relation between the two approaches: