Difference between revisions of "Painless"

From LRDE

(Source Code (GPLv3))
 
(5 intermediate revisions by the same user not shown)
Line 9: Line 9:
   
 
== Awards ==
 
== Awards ==
  +
P-MCOMSPS-STR won 1st in the [https://satcompetition.github.io/2020/ SAT Competition 2020] parallel track!
  +
* [https://www.lrde.epita.fr/dload/papers/p-mcomsps-str-20.pdf See solver description for details.]
  +
* Source code is available [https://github.com/vvallade/p-mcomsps-str here].
  +
 
Painless-MapleCOMSPS won 1st in the [http://sat2018.forsyte.tuwien.ac.at/index.php?cat=results SAT Competition 2018] parallel track!
 
Painless-MapleCOMSPS won 1st in the [http://sat2018.forsyte.tuwien.ac.at/index.php?cat=results SAT Competition 2018] parallel track!
 
* [https://www.lrde.epita.fr/dload/painless/painless-mcomsps-18.pdf See solver description for details.]
 
* [https://www.lrde.epita.fr/dload/painless/painless-mcomsps-18.pdf See solver description for details.]

Latest revision as of 18:41, 5 March 2021

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-v1

painless-v2

Awards

P-MCOMSPS-STR won 1st in the SAT Competition 2020 parallel track!

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


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

Related Publications