G. Audemard, S. Benoit-hoessen, J. Jabbour, C. Lagniez, and . Piette, SAT competition 2014. SAT COMPETITION, p.58, 2014.

G. Audemard, S. Benoit-hoessen, C. Jabbour, and . Piette, An effective distributed d&c approach for the satisfiability problem, Parallel, Distributed and Network-Based Processing (PDP), pp.183-187, 2014.

G. Audemard and L. Simon, Glucose: a solver that predicts learnt clauses quality, SAT Competition, pp.7-8, 2009.

G. Audemard and L. Simon, Refining restarts strategies for SAT and unsat, Principles and Practice of Constraint Programming, pp.118-126, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00790508

G. Audemard and L. Simon, On the glucose sat solver, International Journal on Artificial Intelligence Tools, vol.27, issue.01, p.1840001, 2018.

T. Balyo and C. Sinz, Parallel satisfiability, Handbook of Parallel Constraint Reasoning, pp.3-29, 2018.

A. Biere, M. Heule, and H. Van-maaren, Handbook of satisfiability, vol.185, 2009.

W. Blochinger, Towards robustness in parallel SAT solving, PARCO, pp.301-308, 2005.

A. Stephen and . Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing, pp.151-158, 1971.

N. Eén and N. Sörensson, An extensible SAT-solver, Theory and applications of satisfiability testing, pp.502-518, 2003.

P. Carla, B. Gomes, N. Selman, H. Crato, and . Kautz, Heavy-tailed phenomena in satisfiability and constraint satisfaction problems, Journal of automated reasoning, vol.24, issue.1-2, pp.67-100, 2000.

P. Carla, B. Gomes, H. Selman, and . Kautz, Boosting combinatorial search through randomization, vol.98, pp.431-437, 1998.

Y. Hamadi, S. Jabbour, and L. Sais, Manysat: a parallel SAT solver, Journal on Satisfiability, Boolean Modeling and Computation, vol.6, pp.245-262, 2008.

S. Hölldobler, N. Manthey, P. Steinke-van-hau-nguyen, and J. Stecklina, Modern parallel SAT-solvers, 2011.

B. Jurkowiak, C. M. Li, and G. Utard, Parallelizing satz using dynamic workload balancing, Electronic Notes in Discrete Mathematics, vol.9, pp.174-189, 2001.

B. Jurkowiak, C. M. Li, and G. Utard, A parallelization scheme based on work stealing for a class of SAT solvers, Journal of Automated Reasoning, vol.34, issue.1, pp.73-101, 2005.

-. Jp-marques, K. A. Silva, and . Sakallah, Grasp-a new search algorithm for satisfiability, 1996.

R. Martins, V. Manquinho, and I. Lynce, Improving search space splitting for parallel SAT solving, Tools with Artificial Intelligence (ICTAI), vol.1, pp.336-343, 2010.

R. Martins, V. Manquinho, and I. Lynce, An overview of parallel SAT solving, Constraints, vol.17, issue.3, pp.304-347, 2012.

T. Menouer and S. Baarir, Parallel satisfiability solver based on hybrid partitioning method, 25th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp.54-60, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01490410

K. Ohmura and K. Ueda, c-SAT: A parallel SAT solver for clusters, Theory and Applications of Satisfiability Testing-SAT 2009, pp.524-537, 2009.

L. Simon, Reasoning with propositional logic: From sat solvers to knowledge compilation, A Guided Tour of Artificial Intelligence Research, pp.115-152, 2020.

A. Stump, G. Sutcliffe, and C. Tinelli, Starexec: a cross-community infrastructure for logic solving, International Joint Conference on Automated Reasoning, pp.367-373, 2014.

N. Totla and A. Devarakonda, Massive parallelization of SAT solvers, 2013.

N. Totla and A. Devarakonda, Massive parallelization of SAT solvers, 2013.

H. Zhang, Sato: An efficient prepositional prover, Automated Deduction-CADE-14, pp.272-275, 1997.

H. Zhang, M. P. Bonacina, and J. Hsiang, Psato: a distributed propositional prover and its application to quasigroup problems, Journal of Symbolic Computation, vol.21, issue.4, pp.543-560, 1996.

L. Zhang, F. Conor, . Madigan, H. Matthew, S. Moskewicz et al., Efficient conflict driven learning in a boolean satisfiability solver, Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, pp.279-285, 2001.