Prestwich, 2004b. Steven Prestwich. Full Dynamic Substitutability by SAT Encoding. In *Principles and Practice of Constraint Programming (CP 04)*, volume 3258 of LNCS, pages 512–526. Springer, 2004.

Roney-Dougal *et al.*, 2004. Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, and Steve Linton. Tractable Symmetry Breaking Using Restricted Search Trees. In Sixteenth European Conference on Artificial Intelligence (ECAI 04), pages 211–215, 2004.

Various, 1991 present. Various. Proceedings of the International Workshop on Symmetry and Constraint Satisfaction Problems (SymCon) and of major AI Conferences such as AAAI, IJCAI, and CP, 1991 present.

Weigel *et al.*, 1996. Rainer Weigel, Boi Faltings, and Berthe Y. Choueiry. Context in Discrete Constraint Satisfaction Problems. In *Twelfth European Conference on* Artificial Intelligence (ECAI 96), pages 205–209, 1996.

Weil and Heus, 1998. Georges Weil and Kamel Heus. Eliminating Interchangeable Values in the Nurse Scheduling Problem Formulated as a Constraint Satisfaction Problem. In *Workshop on Constraint-based reasoning in conjunction with FLAIRS'95*,
Indianlantic, FL, 1998. Available from www.sci.tamucc.edu/constraint95/kamel.ps.

Wilson, 2005. Nick Wilson. Decision Diagrams for the Computation of Semiring Valuations. In *International Joint Conference on Artificial Intelligence (IJCAI 05)*, pages 331–336, 2005.

Yip and Hentenryck, 2009. Justin Yip and Pascal Van Hentenryck. Evaluation of Length-Lex Set Variables. In Principles and Practice of Constraint Programming (CP 09), volume 5732 of *LNCS*, pages 817–832. Springer, 2009.

Zhang and Freuder, 2004. Yuanlin Zhang and Eugene C. Freuder. Conditional Interchangeability and Substitutability. In Fourth International Workshop on Symmetry and Constraint Satisfaction Problems (SymCon 04), 2004.