Difference between revisions of "Painless"

From LRDE

 
(5 intermediate revisions by the same user not shown)
Line 9: Line 9:
   
 
== Awards ==
 
== Awards ==
  +
  +
P-MCOMSPS won 1st in the [https://satcompetition.github.io/2021/ SAT Competition 2021] parallel track!
  +
* Source code is available [https://github.com/vvallade/painless-sat-competition-2021 here].
  +
  +
P-MCOMSPS-STR won 1st in the [https://satcompetition.github.io/2020/ SAT Competition 2020] parallel track!
  +
* [https://www.lrde.epita.fr/dload/papers/p-mcomsps-str-20.pdf See solver description for details.]
  +
* Source code is available [https://github.com/vvallade/p-mcomsps-str here].
  +
 
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!
 
* [https://www.lrde.epita.fr/dload/painless/painless-mcomsps-18.pdf See solver description for details.]
 
* [https://www.lrde.epita.fr/dload/painless/painless-mcomsps-18.pdf See solver description for details.]
Line 19: Line 27:
   
 
== Related Publications ==
 
== Related Publications ==
  +
  +
=== Conference Articles ===
  +
  +
* [[Publications/nejati.20.cp|A Machine Learning Based Splitting Heuristic for Divide-and-Conquer Solvers]] in ''Proceedings of the 26 th International Conference on Principles and Practice of Constraint Programming (CP'20)''
  +
* [[Publications/vallade.20.nfm|On the Usefulness of Clause Strengthening in Parallel SAT Solving]] in ''Proceedings of the 12th NASA Formal Methods Symposium (NFM'20)''
  +
* [[Publications/vallade.20.sat|Community and LBD-based Clause Sharing Policy for Parallel SAT Solving]] in ''Proceedings of the 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT'20)''
 
* [[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)''
 
* [[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)''
 
* [[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)''
  +
  +
=== SAT Competitions ===
  +
  +
* [https://www.lrde.epita.fr/dload/papers/p-mcomsps-str-20.pdf P-MCOMSPS-STR: a Painless-based Portfolio of MapleCOMSPS with Clause Strengthening.] in ''Proceedings of SAT Competition 2020: 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-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''

Latest revision as of 13:36, 3 November 2021

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

P-MCOMSPS won 1st in the SAT Competition 2021 parallel track!

  • Source code is available here.

P-MCOMSPS-STR won 1st in the SAT Competition 2020 parallel track!

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


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

Related Publications

Conference Articles

SAT Competitions