论文信息 - Yet another Local Search Solver and Lingeling and Friends Entering the SAT Competition 2014

Yet another Local Search Solver and Lingeling and Friends Entering the SAT Competition 2014

This paper serves as solver description for the SAT solvers Lingeling and its two parallel variants Treengeling and Plingeling, as well as for our new local search solver YalSAT entering the Competition 2014. For Lingeling and its variants we only list important differences to earlier version of these solvers as used in the SAT Competition 2013. For further information we refer to the solver description [1] of the SAT Competition 2013 or source code.

Armin Biere

[1] Armin Biere,et al. Automated Testing and Debugging of SAT and QBF Solvers , 2010, SAT.

[2] Adrian Balint,et al. Improving Stochastic Local Search for SAT with a New Probability Distribution , 2010, SAT.

[3] Ofer Strichman,et al. Theory and Applications of Satisfiability Testing-- Sat 2010: 13th International Conference, Sat 2010 Edinburgh, Uk, July 2010: Proceedings , 2010, SAT 2010.

[4] Uwe Schöning,et al. Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break , 2012, SAT.

[5] Gilles Audemard,et al. Refining Restarts Strategies for SAT and UNSAT , 2012, CP.

[6] Armin Biere,et al. Model-Based Testing for Verification Back-Ends , 2013, TAP@STAF.

[7] Armin Biere. Lingeling, Plingeling and Treengeling Entering the SAT Competition 2013 , 2013 .

[8] Armin Biere,et al. Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses , 2014, SAT.