Banerjee D. 2009. Integrating planning and scheduling in a CP framework: a transition-based approach. In Proceedings of the 19th International Conference on Automated Planning and Scheduling, 330–333.

Bistarelli S., Montanari U. & Rossi F. 1995. Constraint solving over semirings. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, 624–630.

Bresina J., Jónsson A., Morris P. & Rajan K. 2005. Activity planning for the Mars exploration rovers. In Proceedings of the 15th International Conference on Automated Planning and Scheduling, 40–49.

Dechter R. & Dechter A. 1988. Belief maintenance in dynamic constraint networks. In Proceedings of the 7th National Conference on Artificial Intelligence, 37–42.

Do M. & Kambhampati S. 2000. Solving planning-graph by compiling it into CSP. In Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems, 82–91.

Frank J. 2014. Revisiting dynamic constraint satisfaction for automated planning. In Workshop on Constraints and Planning Systems, in conjunction with the 24th International Conference on Automated Planning.

Frank J. & Jónsson A. 2003. Constraint based attribute and interval planning. Journal of Constraints Special Issue on Constraints and Planning 8, 339–364.

Frank J., Jónsson A. & Morris P. 2000. On reformulating planning as dynamic constraint satisfaction. In Proceedings of the 4th Symposium on Abstraction, Reformulation and Approximation.

Freuder E. & Wallace R. 1992. Partial constraint satisfaction. Artificial Intelligence 58, 21–70.

Ghallab M. & Laurelle H. 1994. Representation and control in IxTeT, a temporal planner. In Proceedings of the 4th International Conference on AI Planning and Scheduling, 61–67.

Jónsson A. & Frank J. 2000. A framework for dynamic constraint reasoning using procedural constraints. In Proceedings of the 10th European Conference on Artificial Intelligence, 93–97.

Kambhampati S. 2007. Model-lite planning for the web-age masses: the challenges of planning with incomplete and evolving domain models. In Proceedings of the 13th National Conference on Artificial Intelligence, 1601–1604.

Keyder E. & Geffner H. 2008. Heuristics for planning with action costs, revisited. In Proceedings of the 18th European Conference on Artificial Intelligence, 140–149.

Laborie P. 2003. Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results. Artificial Intelligence 143, 151–188.

Mittal S. & Falkenhainer B. 1990. Dynamic constraint satisfaction problems. In Proceedings of the 9th National Conference on Artificial Intelligence, 25–32.

Soininen T., Gelle E. & Niemela I. 1999. A fixpoint definition of dynamic constraint satisfaction. In Proceedings of the 5th International Conference on the Principles and Practices of Constraint Programming, 419–433.

Tsamardinos I. & Pollack M. 2003. Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence 151(1–2), 43–90.

van den Briel M., Vossen T. & Kambhampati S. 2005. Reviving integer programming for AI planning: a branch and cut framework. Proceedings of the 15th International Conference on Automated Planning and Scheduling, 562–569.

van den Briel M., Sanchez Nigenda R., Do M. & Kambhampati S. 2004. Effective approaches for partial satisfaction (oversubscription) planning. In Proceedings of the 19th National Conference on Artificial Intelligence.

Vaquero T., Romero V., Tonidanel F. & Silva J. 2007. ItSimple 2.0: an integrated tool for designing planning domains. In Proceedings of the 17th International Conference on Automated Planning and Scheduling, 336–343.

Vidal V. & Geffner H. 2006. Branching and pruning: an optimal POCL planner based on constraint programming. Artificial Intelligence 170(3), 298–335.

Wallace R. 1996. Enhancement of branch and bound methods for the maximal constraint satisfaction problem. In Proceedings of the 13th National Conference on Artificial Intelligence, 188–195.