O. Akgun, I. Miguel, C. Jefferson, A. M. Frisch, and B. Hnich, Extensible automated constraint modelling, Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011.

P. Baumgartner and J. K. Slaney, Constraint modelling: A challenge for first order automated reasoning, Proceedings of the 7th International Workshop on First-Order Theorem Proving (FTP'09), pp.4-18, 2009.

C. Bessiere, E. Hebrard, B. Hnich, and T. Walsh, The complexity of global constraints, Proceedings of the 19th National Conference on AI. Association for Advancement of Artificial Intelligence, 2004.
URL : https://hal.archives-ouvertes.fr/lirmm-00108868

M. Cadoli, G. Ianni, L. Palopoli, A. Schaerf, and D. Vasile, NP-SPEC: an executable specification language for solving all problems in NP, Computer Languages, vol.26, issue.2-4, pp.165-195, 2000.
DOI : 10.1016/S0096-0551(01)00010-8

M. Cadoli and T. Mancini, USING A THEOREM PROVER FOR REASONING ON CONSTRAINT PROBLEMS, Applied Artificial Intelligence, vol.1632, issue.4-5, pp.383-404, 2007.
DOI : 10.1023/A:1018930122475

J. Charnley, S. Colton, and I. Miguel, Automatic generation of implied constraints, 17th European Conference on Artificial Intelligence, pp.73-77, 2006.

B. M. Cheng, K. M. Choi, J. H. Lee, and J. C. Wu, Increasing constraint propagation by redundant modeling: an experience report, Constraints, vol.4, issue.2, pp.167-192, 1999.
DOI : 10.1023/A:1009894810205

J. Crawford, M. Ginsberg, G. Luks, and A. Roy, Symmetry breaking predicates for search problems, Proceedings of the 5th International Conference on Knowledge Representation and Reasoning, (KR '96), pp.148-159, 1996.

O. Dubois and G. Dequen, A backbone-search heuristic for efficient solving of hardn 3-SAT formulae, Proceedings of the 17th International Joint Conference on AI, pp.248-253, 2001.

A. M. Frisch, M. Grum, C. Jefferson, B. M. Hernández, and I. Miguel, The design of essence: A constraint language for specifying combinatorial problems, Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp.80-87, 2007.

M. R. Garey and D. S. Johnson, Computers and intractability : a guide to the theory of NPcompleteness, 1979.

P. A. Geelen, Dual viewpoint heuristics for binary constraint satisfaction problems, Proceedings of the 10th ECAI European Conference on Artificial Intelligence, pp.31-35, 1992.

I. P. Gent, K. Petrie, and J. Puget, Symmetry in Constraint Programming, Handbook for Constraint Programming, 2006.
DOI : 10.1016/S1574-6526(06)80014-3

I. P. Gent and T. Walsh, CSPlib: A Benchmark Library for Constraints, A shorter version appears in the Proceedings of the 5th International Conference on Principles and Practices of Constraint Programming (CP- 99), 1999.
DOI : 10.1007/978-3-540-48085-3_36

V. Halava, T. Harju, and M. Hirvensalo, UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES, International Journal of Foundations of Computer Science, vol.18, issue.05, pp.931-948, 2007.
DOI : 10.1142/S0129054107005066

M. Heule and T. Walsh, Symmetry within solutions, Proceedings of the 24th National Conference on AI. AAAI, 2010.

G. Katsirelos, N. Narodytska, and T. Walsh, On the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry, Proceedings of the 16th International Conference on the Principles and Practice of Constraint Programming, pp.305-320, 2010.
DOI : 10.1007/978-3-642-15396-9_26

URL : https://hal.archives-ouvertes.fr/hal-00865476

P. Kilby, J. Slaney, S. Thiebaux, and T. Walsh, Backbones and backdoors in satisfiability, Proceedings of the 20th National Conference on AI. AAAI, 2005.

T. Mancini and M. Cadoli, Detecting and Breaking Symmetries by Reasoning on Problem Specifications, 6th International Symposium on Abstraction, Reformulation and Approximation, pp.165-181, 2005.
DOI : 10.1007/11527862_12

C. Mears, M. J. García-de-la-banda, M. Wallace, and B. Demoen, A Novel Approach For Detecting Symmetries in CSP Models, 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.158-172, 2008.
DOI : 10.1007/978-3-540-68155-7_14

C. Mears, T. Niven, M. Jackson, and M. Wallace, Proving Symmetries by Model Transformation, 17th International Conference on Principles and Practice of Constraint Programming, pp.591-605, 2011.
DOI : 10.1007/978-3-642-23786-7_45

J. Puget, Automatic Detection of Variable and Value Symmetries, Proceedings of 11th International Conference on Principles and Practice of Constraint Programming (CP 2005), ed., P. van Beek, pp.475-489, 2005.
DOI : 10.1007/11564751_36

J. Puget, Breaking All Value Symmetries in Surjection Problems, Proceedings of 11th International Conference on Principles and Practice of Constraint Programming (CP2005), 2005.
DOI : 10.1007/11564751_37

F. Rossi, C. J. Petrie, and V. Dhar, On the equivalence of constraint satisfaction problems, Proceedings of the 9th European Conference on Artificial Intelligence (ECAI'90), pp.550-556, 1990.

T. Walsh, Permutation Problems and Channelling Constraints, Proceedings of 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 2001.
DOI : 10.1007/3-540-45653-8_26

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=