Difference between revisions of "Painless"
From LRDE
Line 1: | Line 1: | ||
− | PArallel INstantiabLE Sat Solver ( |
+ | 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 [http://lrde.epita.fr/ LRDE] and the [https://www.lip6.fr/recherche/team.php?id=720 MoVe team] at [https://www.lip6.fr/ LIP6]. |
|
== Source Code == |
== Source Code == |
||
Line 21: | Line 21: | ||
== Related Publications == |
== Related Publications == |
||
− | * [[Publications/le-frioux.17.sat| |
+ | * [[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.19.tacas|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'19)''. |
||
* [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'' |
||
* [https://www.lrde.epita.fr/dload/painless/painless-mcomsps-18.pdf painless-mcomsps and painless-mcomsps-sym] in ''Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions'' |
* [https://www.lrde.epita.fr/dload/painless/painless-mcomsps-18.pdf painless-mcomsps and painless-mcomsps-sym] in ''Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions'' |
Revision as of 14:15, 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
- Painless: a Framework for Parallel SAT Solving in Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT'17).
- 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'19).
- painless-maplecomsps in Proceedings of SAT Competition 2017: Solver and Benchmark Descriptions
- painless-mcomsps and painless-mcomsps-sym in Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions