SAT and Planning
Carlos Camarão, Mateus Galvão, Newton José Vieira · IGI Global eBooks · 2010
This chapter firstly reviews the importance of the Satisfiability Problem (SAT) for a wide range of applications, including applications in Operation Management such as planning. A review of methods nowadays employed by modern SAT-solvers is then presented. The authors then use Classical Planning as an illustrative example of how a significant problem can be translated into SAT. They point out important results and studies concerning reductions of planning into SAT, and explain how to construct a SAT instance which is satisfiable if and only if an instance of a bounded version of the classic blocks-world problem is solvable.