1. Backofen, R., & Will, S. (1999). Excluding symmetries in constraint-based search. In J. Jaffar (Ed.), Proceedings of the 5th international conference on principles and practice of constraint programming, Lecture Notes in Computer Science (Vol. 1713, pp. 73–87). Springer.
2. Benhamou, B. (1994). Study of symmetry in constraint satisfaction problems. In PPCP’94: 2nd international workshop on principles and practice of constraint programming (pp. 246–254).
3. Boussemart, F., Hemery, F., Lecoutre, C., Sais, L. (2004). Boosting systematic search by weighting constraints. In Proceedings of the European conference on artificial intelligence (pp. 146–150).
4. Chu, G., Garcia de la Banda, M., Mears, C., Stuckey, P. (2011). Symmetries and lazy clause generation. In Proceedings of the 22nd international joint conference on artificial intelligence (pp. 516–521).
5. Cohen, D.A., Jeavons, P., Jefferson, C., Petrie, K.E., Smith, B.M. (2006). Symmetry definitions for constraint satisfaction problems. Constraints, 11(2–3), 115–137.