Difference between revisions of "Painless"
From LRDE
Line 8: | Line 8: | ||
== Awards == |
== Awards == |
||
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! |
||
⚫ | |||
− | |||
− | [ |
+ | * Source code is available [http://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! |
||
+ | * [http://www.lrde.epita.fr/dload/painless/painless-maplecomsps-17.pdf See solver description for details.] |
||
− | |||
⚫ | |||
⚫ | |||
− | |||
− | Source code is available [https://baldur.iti.kit.edu/sat-competition-2017/solvers/parallel/painless.zip here] |
||
== Related Publications == |
== Related Publications == |
Revision as of 17:30, 13 February 2019
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
- Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework in Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS).
- painless-mcomsps and painless-mcomsps-sym in Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions
- Painless: a Framework for Parallel SAT Solving in Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT).
- painless-maplecomsps in Proceedings of SAT Competition 2017: Solver and Benchmark Descriptions