PaInleSS: a Framework for Parallel SAT Solving.

International audienceOver the last decade, parallel SAT solving has been widelystudied from both theoretical and practical aspects. There are now numeroussolvers that dier by parallelization strategies, programming languages,concurrent programming, involved libraries, etc.Hence, comparing the eciency of the theoretical approaches is a challengingtask. Moreover, the introduction of a new approach needs eithera deep understanding of the existing solvers, or to start from scratch theimplementation of a new tool.We present PaInleSS: a framework to build parallel SAT solvers formany-core environments. Thanks to its genericity and modularity, it providesthe implementation of basics for parallel SAT solving like clauseexchanges, Portfolio and Divide-and-Conquer strategies. It also enablesusers to easily create their own parallel solvers based on new strategies.Our experiments show that our framework compares well with some ofthe best state-of-the-art solvers