1. Aguirre, A. (1992). How to use symmetries in Boolean constraint solving. In F. Benhamou & A. Colmerauer (Eds.), Constraint Logic Programming: Selected Research (pp. 287–306). MIT Press.
2. Backofen, R., & Will, S. (1999). Excluding symmetries in constraint-based search. In J. Jaffar (Ed.), Principles and Practice of Constraint Programming-CP’99, LNCS 1713, (pp. 73–87). Berlin Heidelberg New York: Springer.
3. Benhamou, B. (1994). Study of symmetry in constraint satisfaction problems. In Proceedings of the 2nd Workshop on Principles and Practice of Constraint Programming, {PPCP’94} (pp. 246–254)
4. Benhamou, B., & Sais, L. (1992). Theoretical study of symmetries in propositional calculus and applications. In D. Kapur (Ed.), Automated Deduction—CADE-11, LNAI 607, (pp. 281–294). Berlin Heidelberg New York: Springer.
5. Bessière, C., Hebrard, E., Hnich, B., & Walsh, T. (2004) The tractability of global constraints. In M. Wallace (Ed.), Principles and Practice of Constraint Programming—CP 2004, Vol. LNCS 3258, (pp. 716–720). Berlin Heidelberg New York: Springer.