Planning as satisfiability with IPC simple preferences and action costs
Marco Maratea · AI Communications · 2012
Planning as Satisfiability (SAT) is currently the best approach for optimally (wrt makespan) solving classical planning problems and the extension of this framework to include preferences is nowadays considered the reference approach to compute “opti