Rintanen, Jussi2015-12-10July 16-229781577355120http://hdl.handle.net/1885/51273We 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:Keywords: Dominance relation; Iterative deepening; Optimal planning algorithms; SAT problems; Artificial intelligence; Heuristic algorithms; Iterative methods201110.5591/978-1-57735-516-8/IJCAI11-3362016-02-24