Difference between revisions of "Painless"

From LRDE

Line 3: Line 3:
 
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] and the [https://www.lip6.fr/recherche/team.php?id=720 MoVe team] at [https://www.lip6.fr/ LIP6].
   
== Code ==
+
== SAT Competition ==
  +
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 ==
 
[http://www.lrde.epita.fr/dload/painless/painless-v1.zip painless-v1]
 
[http://www.lrde.epita.fr/dload/painless/painless-v1.zip painless-v1]
  +
[https://baldur.iti.kit.edu/sat-competition-2017/solvers/parallel/painless.zip painless-MapleCOMSPS-17]
   
 
== Related publication(s) ==
 
== Related publication(s) ==

Revision as of 15:42, 6 November 2017

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.

SAT Competition

PaInless-MapleCOMSPS won 3rd in the SAT Competition 2017 parallel track! See solver description for details.

Source Code

painless-v1 painless-MapleCOMSPS-17

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)