F. A. Aloul, A. Ramani, I. L. Markov, and K. A. Sakallak, Solving difficult instances of boolean satisfiability in the presence of symmetry, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.22, issue.9, pp.1117-1137, 2003.
DOI : 10.1109/TCAD.2003.816218

F. A. Aloul, A. Ramani, I. L. Markov, and K. A. Sakallak, Symmetry breaking for pseudo-boolean satisfiabilty, ASPDAC'04, pp.884-887, 2004.

G. Audemard, L. Bordeaux, and Y. Hamadi, Saïd Jabbour, and Lakhdar Sais. A generalized framework for conflict analysis, SAT, pp.21-27, 2008.

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

P. Beame, H. A. Kautz, and A. Sabharwal, Towards understanding and harnessing the potential of clause learning, J. Artif. Intell. Res. (JAIR), vol.22, pp.319-351, 2004.

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.

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

N. Eén, S. Niklas, and . ´-'orensson, An Extensible SAT-solver, Lecture Notes in Computer Science, vol.2919, pp.502-518, 2003.
DOI : 10.1007/978-3-540-24605-3_37

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, Proceedings CP'2003, 2003.
DOI : 10.1007/978-3-540-45193-8_23

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

C. P. Gomes, B. Selman, and N. Crato, Heavy-tailed distributions in combinatorial search, CP, pp.121-135, 1997.
DOI : 10.1007/BFb0017434

P. Hertel, F. Bacchus, T. Pitassi, and A. Van-gelder, Clause learning can effectively psimulate general propositional resolution, AAAI, pp.283-290, 2008.

J. Huang, The effect of restarts on the efficiency of clause learning, IJCAI'07 : Proceedings of the 20th international joint conference on Artifical intelligence, pp.2318-2323, 2007.

J. Roberto, R. Bayardo-jr, and . Schrag, Using csp look-back techniques to solve real-world sat instances, AAAI/IAAI, pp.203-208, 1997.

T. Junttila and P. Kaski, Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs, Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics, pp.135-149253, 1985.
DOI : 10.1137/1.9781611972870.13

K. Pipatsrisawat and A. Darwiche, A new clause learning scheme for efficient unsatisfiability proofs, AAAI, pp.1481-1484, 2008.

K. Pipatsrisawat and A. Darwiche, On the Power of Clause-Learning SAT Solvers with Restarts, CP, pp.654-668, 2009.
DOI : 10.1007/11591191_40

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. F. Puget, Symmetry breaking revisited, International conference on constraint programming, pp.446-461, 2002.

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.

J. P. Silva and K. A. Sakallah, Grasp a new search algorithm for satisfiability, ICCAD, pp.220-227, 1996.

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

L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik, Efficient conflict driven learning in boolean satisfiability solver, ICCAD, pp.279-285, 2001.