Choueiry and Davis, 2002. Berthe Y. Choueiry and Amy M. Davis. Dynamic Bundling: Less Effort for More Solutions. In *International Symposium on Abstraction, Reformulation and Approximation (SARA 02)*, volume 2371 of *LNAI*, pages 64–82. Springer, 2002.

Choueiry and Noubir, 1998. Berthe Y. Choueiry and Guevara Noubir. On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems. In Fifteenth National Conference on Artificial Intelligence (AAAI 98), pages 326–333, 1998.

Choueiry *et al.*, 1995. Berthe Y. Choueiry, Boi Faltings, and Rainer Weigel. Abstraction by Interchangeability in Resource Allocation. In 14th *International Joint Conference on Artificial Intelligence (IJCAI 95)*, pages 1694–1701, 1995.

Cohen *et al.*, 2006. David Cohen, Peter Jeavons, Christopher Jefferson, Karen E.

Petrie, and Barbara M. Smith. Symmetry Definitions for Constraint Satisfaction Problems. *Constraints*, 11(2):115–137, 2006.

Cooper, 2003. Martin C. Cooper. Reduction Operations in Fuzzy or Valued Constraint Satisfaction. *Fuzzy Sets and Systems*, 134(3):311–342, 2003.

Dechter and Mateescu, 2004. Rina Dechter and Robert Mateescu. The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting. In Principles and Practice of Constraint Programming (CP 04), volume 3258 of *LNCS*, pages 731–736, 2004.

Ezzahir *et al.*, 2007. Redouane Ezzahir, Mustapha Belaissaoui, Christian Bessiere, and El Houssine Bouyakhf. Compilation Formulation for Asynchronous Backtracking with Complex Local Problems. In Third International Symposium on Computational Intelligence and Intelligent Informatics (ISCIII 07), pages 205–211, 28-30 2007.

Fahle *et al.*, 2001. Torsten Fahle, Stefan Schamberger, and Meinolf Sellman. Symmetry Breaking. In *Principles and Practices of Constraint Programming (CP 01)*,
volume 2239 of *LNCS*, pages 93–107. Springer, 2001.

Focacci and Milano, 2001. Filippo Focacci and Michela Milano. Global Cut Framework for Removing Symmetries. In *Seventh International Conference on Principles* and Practice of Constraint Programming (CP 01), volume 2239 of *LNCS*, pages 77– 92. Springer, 2001.

Freuder, 1991. Eugene C. Freuder. Eliminating Interchangeable Values in Constraint Satisfaction Problems. In *National Conference on Artificial Intelligence (AAAI 91)*,
pages 227–233, 1991.

Gent and Smith, 2000. Ian P. Gent and Barbara M. Smith. Symmetry Breaking in Constraint Programming. In *Fourteenth European Conference on Artificial Intelligence (ECAI 00)*, pages 599–603. IOS Press, 2000.

Gent *et al.*, 2006. Ian Gent, Karen Petrie, and Jean-Fran¸cois Puget. *Handbook of Constraint Programming*, chapter 10, pages 329–376. Elsevier, 2006.

Ginsberg *et al.*, 1998. Matthew L. Ginsberg, Andrew J. Parkes, and Amitabha Roy.

Supermodels and Robustness. In *Fifteenth National Conference on Artificial intelligence (AAAI 98)*, pages 334–339, 1998.

Glaisher, 1874. J.W.L. Glaisher. On the Problem of the Eight Queens. *Philosophical* Magazine, series 4, 48:457–467, 1874.

Haselb¨ock, 1993. Alois Haselb¨ock. Exploiting Interchangeabilities in Constraint Satisfaction Problems. In 13th *International Joint Conference on Artificial Intelligence*
(IJCAI 93), pages 282–287, 1993.

Hebrard *et al.*, 2004. Emmanuel Hebrard, Brahim Hnich, and Toby Walsh. Super Solutions in Constraint Programming. In *Integration of AI and OR Techniques in* Constraint Programming for Combinatorial Optimization Problems (CPAIOR 04),
volume 3011 of *LNCS*, pages 157–172. Springer, 2004.