Download PDFOpen PDF in browser

Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning

14 pagesPublished: July 28, 2014


Preprocessing techniques are crucial for SAT solvers when it comes to reaching state-
of-the-art performance as it was shown by the results of the last SAT Competitions. The
usefulness of a preprocessing technique depends highly on its own parameters, on the in-
stances on which it is applied and on the used solver. In this paper we first give an extended
analysis of the performance gain reached by using different preprocessing techniques in-
dividually in combination with CDCL solvers on application instances and SLS solvers
on crafted instances. Further, we provide an analysis of combinations of preprocessing
techniques by means of automated algorithm configuration, where we search for optimal
preprocessor configurations for different scenarios. Our results show that the performance
of CDCL and especially of SLS solvers can be further improved when using appropriate
preprocessor configurations. The solvers augmented with the best found preprocessing
configurations outperform the original solvers on the instances from the SAT Challenge
2012, achieving new state-of-the-art results.

Keyphrases: Algorithm Configuration, SAT preprocessing, SAT solving

In: Daniel Le Berre (editor). POS-13. Pragmatics of SAT 2013, vol 29, pages 1--14

BibTeX entry
  author    = {Adrian Balint and Norbert Manthey},
  title     = {Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning},
  booktitle = {POS-13. Pragmatics of SAT 2013},
  editor    = {Daniel Le Berre},
  series    = {EPiC Series in Computing},
  volume    = {29},
  pages     = {1--14},
  year      = {2014},
  publisher = {EasyChair},
  bibsource = {EasyChair,},
  issn      = {2398-7340},
  url       = {},
  doi       = {10.29007/28ww}}
Download PDFOpen PDF in browser