Research

Planning as Satisfiability

Solving combinatorially challenging planning problems by encoding as Boolean satisfiability and applying state of the art SAT solvers.