Difference between revisions of "Painless"
From LRDE
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] |
||
− | == |
+ | == Awards == |
+ | 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.] |
||
+ | |||
+ | Source code is available [https://sat2018.forsyte.tuwien.ac.at/solvers/parallel/painless-mcomsps.zip here] |
||
+ | |||
+ | |||
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! |
||
Line 13: | Line 20: | ||
Source code is available [https://baldur.iti.kit.edu/sat-competition-2017/solvers/parallel/painless.zip here] |
Source code is available [https://baldur.iti.kit.edu/sat-competition-2017/solvers/parallel/painless.zip here] |
||
− | == Related |
+ | == Related Publications == |
* [[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 painless-maplecomsps] in ''Proceedings of SAT Competition 2017: Solver and Benchmark Descriptions'' |
* [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 08:38, 20 August 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
Awards
PaInless-MapleCOMSPS won 1st in the SAT Competition 2018 parallel track!
See solver description for details.
Source code is available here
PaInless-MapleCOMSPS won 3rd in the SAT Competition 2017 parallel track!
See solver description for details.
Source code is available here
Related Publications
- 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