F. Aloul, A. Ramani, I. Markov, and K. Sakallah, 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. Aloul, K. Sakallah, and I. Markov, Efficient symmetry breaking for Boolean satisfiability, IEEE Transactions on Computers, vol.55, issue.5, pp.549-558, 2006.
DOI : 10.1109/TC.2006.75

A. Biere, A. Cimatti, E. Clarke, and Y. Zhu, Symbolic model checking without BDDs, TACAS 1999, pp.193-207
DOI : 10.21236/ada360973
URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=1426&context=compsci

J. Crawford, M. Ginsberg, E. Luks, and A. Roy, Symmetry-Breaking Predicates for Search Problems, pp.148-159, 1996.

M. Davis, G. Logemann, and D. Loveland, A machine program for theorem-proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.
DOI : 10.1145/368273.368557

J. Devriendt, B. Bogaerts, and M. Bruynooghe, Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT, SAT 2017, pp.83-100, 2017.
DOI : 10.1007/978-3-642-02777-2_22
URL : https://lirias.kuleuven.be/bitstream/123456789/600896/1/SAT-SEL.pdf

J. Devriendt, B. Bogaerts, M. Bruynooghe, and M. Denecker, Improved Static Symmetry Breaking for SAT, SAT 2016, pp.104-122, 2016.
DOI : 10.1016/j.dam.2005.10.018

J. Devriendt, B. Bogaerts, B. De-cat, M. Denecker, and C. Mears, Symmetry Propagation: Improved Dynamic Symmetry Breaking in SAT, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence, pp.7-9, 2012.
DOI : 10.1109/ICTAI.2012.16

N. Eén and N. Sörensson, An extensible SAT-solver, SAT 2003, pp.502-518, 2004.

M. Järvisalo, L. Berre, D. Roussel, O. Simon, and L. , The International SAT Solver Competitions, AI Magazine, vol.33, issue.1, pp.89-92, 2012.
DOI : 10.1609/aimag.v33i1.2395

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-149, 2007.
DOI : 10.1137/1.9781611972870.13
URL : http://www.cs.helsinki.fi/u/pkaski/junttilat.pdf

H. Katebi, K. A. Sakallah, and I. L. Markov, Symmetry and Satisfiability: An Update, SAT 2010, pp.113-127
DOI : 10.1007/978-3-642-02777-2_22
URL : http://www.eecs.umich.edu/%7Eimarkov/pubs/conf/sat10-sym.pdf

H. A. Kautz and B. Selman, Planning as satisfiability, In: ECAI, vol.92, pp.359-363, 1992.

E. Luks and A. Roy, The Complexity of Symmetry-Breaking Formulas, Annals of Mathematics and Artificial Intelligence, vol.41, issue.1, pp.19-45, 2004.
DOI : 10.1023/B:AMAI.0000018578.92398.10

E. M. Luks and A. Roy, The Complexity of Symmetry-Breaking Formulas, Annals of Mathematics and Artificial Intelligence, vol.41, issue.1, pp.19-45, 2004.
DOI : 10.1023/B:AMAI.0000018578.92398.10

I. Lynce and J. Marques-silva, SAT in Bioinformatics: Making the Case with Haplotype Inference, SAT 2006, pp.136-141, 2006.
DOI : 10.1007/11814948_16

J. P. Marques-silva and K. Sakallah, GRASP: a search algorithm for propositional satisfiability, IEEE Transactions on Computers, vol.48, issue.5, pp.506-521, 1999.
DOI : 10.1109/12.769433
URL : https://eprints.soton.ac.uk/262032/1/jpms-tcomp99.pdf

F. Massacci and L. Marraro, Logical cryptanalysis as a SAT problem, Journal of Automated Reasoning, vol.24, issue.1/2, pp.165-203, 2000.
DOI : 10.1023/A:1006326723002

A. Sabharwal, SymChaff: exploiting symmetry in a structure-aware satisfiability solver, Constraints, vol.35, issue.2, pp.478-505, 2009.
DOI : 10.1007/978-1-4612-0333-9

B. Schaafsma, M. J. Heule, and H. Van-maaren, Dynamic Symmetry Breaking by Simulating Zykov Contraction, SAT 2009, pp.223-236978, 2009.
DOI : 10.1016/j.dam.2006.07.016
URL : http://www.st.ewi.tudelft.nl/~marijn/publications/Zykov_SAT2009.pdf