Difference between revisions of "Painless"


Line 6: Line 6:
[http://www.lrde.epita.fr/dload/painless/painless-v1.zip painless-v1]
[http://www.lrde.epita.fr/dload/painless/painless-v1.zip painless-v1]
[http://www.lrde.epita.fr/dload/painless/painless-v2.zip painless-v2]
[http://www.lrde.epita.fr/dload/painless/painless-dc.zip painless-v2]
== Awards ==
== Awards ==

Revision as of 10:17, 30 January 2020

PArallel INstantiabLE Sat Solver (Painless) is a framework written in C++ that simplifies the implementation and evaluation of new parallel SAT solvers for many-core environments. The components of Painless can be instantiated independently to produce a new complete solver. The guiding principle is to separate the technical components dedicated to some specific aspect of concurrent programming, from the components implementing heuristics and optimizations embedded in a parallel SAT solver.

Painless has been developed by the LRDE, the MoVe team at LIP6, and the DELYS team at LIP6 / Inria.

Source Code (GPLv3)




Painless-MapleCOMSPS won 1st in the SAT Competition 2018 parallel track!

Painless-MapleCOMSPS won 3rd in the SAT Competition 2017 parallel track!

Related Publications