Skip to Main content Skip to Navigation
Conference papers

PaInleSS: a Framework for Parallel SAT Solving.

Ludovic Le Frioux 1 Souheib Baarir 1 Julien Sopena 2 Fabrice Kordon 1 
1 MoVe - Modélisation et Vérification
LIP6 - Laboratoire d'Informatique de Paris 6
2 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : souheib baarir Connect in order to contact the contributor
Submitted on : Friday, June 16, 2017 - 3:28:57 PM
Last modification on : Friday, January 21, 2022 - 3:22:03 AM



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⟩



Record views