{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T04:19:03Z","timestamp":1791173943450,"version":"4.1.0"},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Preprocessing techniques are crucial for SAT solvers when it comes to reaching state-<\/jats:p><jats:p>of-the-art performance as it was shown by the results of the last SAT Competitions. The<\/jats:p><jats:p>usefulness of a preprocessing technique depends highly on its own parameters, on the in-<\/jats:p><jats:p>stances on which it is applied and on the used solver. In this paper we first give an extended<\/jats:p><jats:p>analysis of the performance gain reached by using different preprocessing techniques in-<\/jats:p><jats:p>dividually in combination with CDCL solvers on application instances and SLS solvers<\/jats:p><jats:p>on crafted instances. Further, we provide an analysis of combinations of preprocessing<\/jats:p><jats:p>techniques by means of automated algorithm configuration, where we search for optimal<\/jats:p><jats:p>preprocessor configurations for different scenarios. Our results show that the performance<\/jats:p><jats:p>of CDCL and especially of SLS solvers can be further improved when using appropriate<\/jats:p><jats:p>preprocessor configurations. The solvers augmented with the best found preprocessing<\/jats:p><jats:p>configurations outperform the original solvers on the instances from the SAT Challenge<\/jats:p><jats:p>2012, achieving new state-of-the-art results.<\/jats:p>","DOI":"10.29007\/28ww","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:02:53Z","timestamp":1516730573000},"page":"1--14","source":"Crossref","is-referenced-by-count":4,"title":["Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning"],"prefix":"10.29007","volume":"29","author":[{"given":"Adrian","family":"Balint","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Norbert","family":"Manthey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"11545","event":{"name":"POS-13. Pragmatics of SAT 2013"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:02:53Z","timestamp":1516730573000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/cLs5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/28ww","relation":{},"ISSN":["2398-7340"],"issn-type":[{"value":"2398-7340","type":"print"}],"subject":[]}}