Difference between revisions of "Painless"

From LRDE

(Awards)
Line 6: Line 6:
 
[http://www.lrde.epita.fr/dload/painless/painless-v1.zip painless-v1] last update oct. 30 2017
 
[http://www.lrde.epita.fr/dload/painless/painless-v1.zip painless-v1] last update oct. 30 2017
   
== Awards ==
+
== Award(s) ==
 
PaInless-MapleCOMSPS won 3rd in the [https://baldur.iti.kit.edu/sat-competition-2017/index.php?cat=results SAT Competition 2017] parallel track!
 
PaInless-MapleCOMSPS won 3rd in the [https://baldur.iti.kit.edu/sat-competition-2017/index.php?cat=results SAT Competition 2017] parallel track!
   

Revision as of 16:53, 6 November 2017

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 and the MoVe team at LIP6.

Source Code

painless-v1 last update oct. 30 2017

Award(s)

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

See solver description for details.

Source code is available here

Related publication(s)

PaInleSS: a Framework for Parallel SAT Solving. in Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT'17)