R. Backofen and S. Will, Excluding Symmetries in Constraint-Based Search, Principle and Practice of Constraint Programming -CP'99, 1999.
DOI : 10.1007/978-3-540-48085-3_6

B. Benhamou, Study of symmetry in constraint satisfaction problems, Proceedings of the 2nd International workshop on Principles and Practice of Constraint Programming -PPCP'94, 1994.

B. Benhamou and L. Sais, Theoretical study of symmetries in propositional calculus and applications, Eleventh International Conference on Automated Deduction, 1992.
DOI : 10.1007/3-540-55602-8_172

B. Benhamou and L. Sais, Tractability through symmetries in propositional calculus, Journal of Automated Reasoning, vol.8, issue.1, pp.89-102, 1994.
DOI : 10.1007/BF00881844
URL : https://hal.archives-ouvertes.fr/hal-01479609

B. Benhamou, L. Sais, and P. Siegel, Two proof procedures for a cardinality based language, proceedings of STACS'94, pp.71-82, 1994.

B. Benhamou and M. R. Saïdi, Eliminating local symmetries in csp, The International Symmetry Conference, 2007.

D. Cohen, P. Jeavons, C. Jefferson, K. E. Petrie, and B. Smith, Symmetry definitions for constraint satisfaction problems, proceedings of CP, pp.17-31, 2005.

J. Crawford, M. L. Ginsberg, E. Luck, and A. Roy, Symmetry-breaking predicates for search problems, KR'96 : Principles of Knowledge Representation and Reasoning, pp.148-159

O. Dubois and G. Dequen, The Non-existence of (3,1,2)-Conjugate Orthogonal Idempotent Latin Square of Order 10, 7th International Conference on Principles and Practice of Constraint Programming, pp.108-121, 2001.
DOI : 10.1007/3-540-45578-7_8

T. Fahle, S. Schamberger, and M. Sellmann, Symmetry Breaking, International conference on constraint programming, pp.93-108, 2001.
DOI : 10.1007/3-540-45578-7_7

F. Focacci and M. Milano, Global Cut Framework for Removing Symmetries, International conference on constraint programming, pp.77-82, 2001.
DOI : 10.1007/3-540-45578-7_6

E. C. Freuder, Eliminating interchangeable values in constraints satisfaction problems, Proc AAAI-91, pp.227-233, 1991.

I. P. Gent, W. Hervey, T. Kesley, and S. Linton, Generic sbdd using computational group theory Conditional symmetry breaking, Proceedings CP'2003 Principle and Practice of Constraint Programming -CP 2005, pp.256-270, 2003.

I. P. Gent and B. M. Smith, Symmetry breaking during search in constraint programming, Proceedings ECAI'2000, 2000.

I. P. Gent, W. Harvey, and T. Kelsey, Groups and Constraints: Symmetry Breaking during Search, International conference on constraint programming, pp.415-430, 2002.
DOI : 10.1007/3-540-46135-3_28

P. Jegou, Decomposition of domains based on the micro-structure of finite constraint satisfaction problems, Proceedings AAAI'93, 1993.

B. Krishnamurty, Short proofs for tricky formulas, Acta Informatica, vol.22, issue.3, pp.253-275, 1985.
DOI : 10.1007/BF00265682

J. Slaney, M. Fujita, and F. Bennett, Automatic generation of some results in finite algebra, proceedings of the 13th Internationnal Joint Conference on Artificial Intelligence, pp.52-57, 1993.

A. K. Mackworth, Consistency in networks of relations, Artificial Intelligence, vol.8, issue.1, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-8

B. Mckay, Practical graph isomorphism, II, Congr. Numer. 30, pp.45-87, 1981.
DOI : 10.1016/j.jsc.2013.09.003

C. Mears, M. Garcia-de-la-banda, and M. Wallace, On implementing symmetry detection, The CP 2006 Workshop on Symmetry and Constraint Satisfaction Problems (SymCon'06), pp.1-8, 2006.
DOI : 10.1007/s10601-008-9057-9

P. Meseguer and C. Torras, Solving strategies for highly symmetric csps, Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pp.400-405, 1999.

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

J. F. Puget, On the satisfiability of symmetrical constrained satisfaction problems, Proceedings of IS- MIS'93, LNAI 689, 1993.
DOI : 10.1007/3-540-56804-2_33

J. Puget, Automatic Detection of Variable and Value Symmetries, Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP-2005 ), pp.474-488, 2005.
DOI : 10.1007/11564751_36

J. F. Puget, Symmetry breaking revisited, International conference on constraint programming, pp.446-461, 2002.

J. F. Puget, Breaking All Value Symmetries in Surjection Problems, proceedings of CP, pp.490-504, 2005.
DOI : 10.1007/11564751_37

J. F. Puget, Breaking symmetries in all diffrent problems, proceedings of IJCAI, pp.272-277, 2005.

J. F. Puget, Dynamic lex constraints. In, proceedings of CP'06, pp.453-467, 2006.

C. M. Roney-dougal, I. P. Gent, T. Kelsey, and S. A. Linton, Tractable symmetry breaking using restricted search trees, proceedings of ECAI'04, pp.211-215, 2004.

E. P. Tsang, Foundations of Constraint Satisfaction, 1993.

T. Walsh, General symmetry breaking constraints. In, proceedings of CP'06, pp.650-664, 2006.

S. Zampelli, Y. Deville, and P. Dupont, Symmetry Breaking in Subgraph Pattern Matching, Sym- Con'06, pp.35-42, 2006.
DOI : 10.1002/9780470612309.ch10

S. Zampelli, Y. Deville, M. R. Saïdi, B. Benhamou, and P. Dupont, Breaking local symmetries in subgraph pattern matching, The International Symmetry Conference, 2007.