verfaillie-jussien-cp03-tutorial-biblio

Commented Bibliographyon Dynamic Constraint SolvingG´erard Verfaillie Narendra JussienLAAS-CNRS, Toulouse, France EMN, Nantes, Francegverfail@laas.fr jussien@emn.fr3rd October 2003AbstractThis document is a commented bibliography on Dynamic Con-straint Solving and some related topics. It is associated with a tu-torial about the same topic that has been given by the authors atCP 2003 (Ninth International Conference on Principles and Practiceof Constraint Programming), in Cork, Ireland. These authors are theonly responsible for the commentaries that are associated with eachreference. Any misunderstanding or omission may be pointed out tothem.Introduction to the dynamic constraint solvingsetting[1] R. Dechter and A. Dechter. Belief Maintenance in Dynamic Con-straint Networks. In Proc. of the 7th National Conference on ArtificialIntelligence (AAAI-88), pages 37–42, St. Paul, MN, USA, 1988. In-troduction to the so-called ”Dynamic Constraint SatisfactionProblem”. A Dynamic CSP is defined as a sequence of CSPs,each one resulting from some change in the previous one.[2] S. Mittal and B. Falkenhainer. Dynamic Constraint SatisfactionProblems. In Proc. of the 8th National Conference on Artificial Intel-ligence (AAAI-90), pages 25–32, Boston, MA, USA, 1990. Introduc-tion to the so-called ”Dynamic Constraint Satisfaction Prob-1lem”, different from the previous one. In this definition, thesolutions do not have all the same structure. Constraints areof two ...