Peter van Beek and Xinguang Chen have shown that constraint satisfaction can be a viable approach to solve planning problems. They distribute CPlan, a C program for solving planning problems (see the README file for more details).

Encoding planning problems into propositional satisfiability has also been highly popular in the last few years. See, for example, Henry Kautz’s Blackbox system.