(PDF) Peter van Beek and Xinguang Chen. CPlan: A constraint programming approach to planning. Proceedings of the 16th National Conference on Artificial Intelligence, Orlando, Florida, 585-590, July, 1999.
Constraint programming, a methodology for solving difficult combinatorial problems by representing them as constraint satisfaction problems, has shown that a general purpose search algorithm based on constraint propagation combined with an emphasis on modeling can solve large, practical scheduling problems. Given the success of constraint programming on scheduling problems and the similarity of scheduling to planning, the question arises, would a constraint programming approach work as well in planning? In this paper, we present evidence that a constraint programming approach to planning does indeed work well and has the advantage in terms of time and space efficiency over the current state-of-the-art planners.
Software plus five case studies illustrating how the methodology and the planner can be used to solve planning problems in a new domain: README, CPlan.tar.gz