Abstract
AbstractWe present , a powerful local search SAT solver that effectively solves hard combinatorial problems. Its unique approach of transferring clause weights in local minima enhances its efficiency in solving problem instances. Since it is implemented on top of , benefits from practical techniques such as restart strategies and thread parallelization. Our implementation includes a parallel version that shares data structures across threads, leading to a significant reduction in memory usage. Our experiments demonstrate that outperforms similar solvers on a vast set of SAT competition benchmarks. Notably, with the parallel configuration of , we improve lower bounds for several van der Waerden numbers.
Publisher
Springer Nature Switzerland
Reference17 articles.
1. SAT Competition 2022. https://satcompetition.github.io/2022/downloads.html, 2022.
2. Cesare Tinelli Aaron Stump, Geoff Sutcliffe. StarExec. https://www.starexec.org/starexec/public/about.jsp, 2013.
3. Tanbir Ahmed, Oliver Kullmann, and Hunter S. Snevily. On the van der Waerden numbers w(2; 3, t). Discrete Applied Mathematics, 174:27–51, 2014.
4. Adrian Balint. Engineering stochastic local search for the satisfiability problem. PhD thesis, University of Ulm, 2014.
5. Adrian Balint, Armin Biere, Andreas Fröhlich, and Uwe Schöning. Improving implementation of SLS solvers for SAT and new heuristics for k-SAT with long clauses. In Proceedings of SAT-2014, pages 302–316, 2014.