Difference between revisions of "Painless"

From LRDE

(Related publication(s))
(Source Code (GPLv3))
(30 intermediate revisions by the same user not shown)
Line 1: Line 1:
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.
+
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].
+
Painless has been developed by the [http://lrde.epita.fr/ LRDE], the [https://www.lip6.fr/recherche/team.php?acronyme=MoVe MoVe team] at [https://www.lip6.fr/ LIP6], and the [https://www.lip6.fr/recherche/team.php?acronyme=DELYS DELYS team] at [https://www.lip6.fr/ LIP6] / [https://www.inria.fr/ Inria].
   
== Source Code ==
+
== Source Code (GPLv3) ==
[http://www.lrde.epita.fr/dload/painless/painless-v1.zip painless-v1] last update 30/10/2017
+
[http://www.lrde.epita.fr/dload/painless/painless-v1.zip painless-v1]
   
  +
[http://www.lrde.epita.fr/dload/painless/painless-v2.zip painless-v2]
== 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!
 
   
  +
== Awards ==
[http://www.lrde.epita.fr/dload/painless/painless-maplecomsps-17.pdf See solver description for details.]
 
  +
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 [http://sat2018.forsyte.tuwien.ac.at/solvers/parallel/painless-mcomsps.zip here].
   
Source code is available [https://baldur.iti.kit.edu/sat-competition-2017/solvers/parallel/painless.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!
== Related publication(s) ==
 
  +
* [http://www.lrde.epita.fr/dload/painless/painless-maplecomsps-17.pdf See solver description for details.]
[[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)''
 
  +
* Source code is available [https://baldur.iti.kit.edu/sat-competition-2017/solvers/parallel/painless.zip here].
   
  +
== Related Publications ==
[https://www.lrde.epita.fr/dload/painless/painless-maplecomsps-17.pdf| painless-maplecomsps] in ''Proceedings of SAT Competition 2017: Solver and Benchmark Descriptions''
 
  +
* [[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-mcomsps-18.pdf painless-mcomsps and painless-mcomsps-sym] in ''Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions''
  +
* [[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''

Revision as of 10:20, 30 January 2020

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, the MoVe team at LIP6, and the DELYS team at LIP6 / Inria.

Source Code (GPLv3)

painless-v1

painless-v2

Awards

Painless-MapleCOMSPS won 1st in the SAT Competition 2018 parallel track!


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

Related Publications