Difference between revisions of "Painless"
From LRDE
Line 15: | Line 15: | ||
== Related publication(s) == |
== Related publication(s) == |
||
* [[Publications/le-frioux.17.sat|PaInleSS: a Framework for Parallel SAT Solving.]] in ''Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT'17)'' |
* [[Publications/le-frioux.17.sat|PaInleSS: a Framework for Parallel SAT Solving.]] in ''Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT'17)'' |
||
− | * [https://www.lrde.epita.fr/dload/painless/painless-maplecomsps-17.pdf |
+ | * [https://www.lrde.epita.fr/dload/painless/painless-maplecomsps-17.pdf painless-maplecomsps] in ''Proceedings of SAT Competition 2017: Solver and Benchmark Descriptions'' |
Revision as of 15:26, 12 June 2018
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
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)
- painless-maplecomsps in Proceedings of SAT Competition 2017: Solver and Benchmark Descriptions