PaInleSS: a Framework for Parallel SAT Solving. - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

PaInleSS: a Framework for Parallel SAT Solving.

Ludovic Le Frioux
  • Function : Author
  • PersonId : 1010412
Souheib Baarir
  • Function : Author
  • PersonId : 961876
Julien Sopena
Fabrice Kordon


Over the last decade, parallel SAT solving has been widely studied from both theoretical and practical aspects. There are now numerous solvers that di er by parallelization strategies, programming languages, concurrent programming, involved libraries, etc. Hence, comparing the eciency of the theoretical approaches is a challenging task. Moreover, the introduction of a new approach needs either a deep understanding of the existing solvers, or to start from scratch the implementation of a new tool. We present PaInleSS: a framework to build parallel SAT solvers for many-core environments. Thanks to its genericity and modularity, it provides the implementation of basics for parallel SAT solving like clause exchanges, Portfolio and Divide-and-Conquer strategies. It also enables users to easily create their own parallel solvers based on new strategies. Our experiments show that our framework compares well with some of the best state-of-the-art solvers.
No file

Dates and versions

hal-01540785 , version 1 (16-06-2017)



Ludovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon. PaInleSS: a Framework for Parallel SAT Solving.. The 20th International Conference on Theory and Applications of Satisfiability Testing, Aug 2017, Melbourne, Australia. pp.233-250, ⟨10.1007/978-3-319-66263-3_15⟩. ⟨hal-01540785⟩
1469 View
0 Download



Gmail Facebook X LinkedIn More