swMATH ID: 14233
Software Authors: KhudaBukhsh, Ashiqur R.; Xu, Lin; Hoos, Holger H.; Leyton-Brown, Kevin
Description: SATenstein: automatically building local search SAT solvers from components. Designing high-performance solvers for computationally hard problems is a difficult and often time-consuming task. Although such design problems are traditionally solved by the application of human expertise, we argue instead for the use of automatic methods. In this work, we consider the design of stochastic local search (SLS) solvers for the propositional satisfiability problem (SAT). We first introduce a generalized, highly parameterized solver framework, dubbed SATenstein, that includes components drawn from or inspired by existing high-performance SLS algorithms for SAT. The parameters of SATenstein determine which components are selected and how these components behave; they allow SATenstein to instantiate many high-performance solvers previously proposed in the literature, along with trillions of novel solver strategies. We used an automated algorithm configuration procedure to find instantiations of SATenstein that perform well on several well-known, challenging distributions of SAT instances. Our experiments show that SATenstein solvers achieved dramatic performance improvements as compared to the previous state of the art in SLS algorithms; for many benchmark distributions, our new solvers also significantly outperformed all automatically tuned variants of previous state-of-the-art algorithms.
Homepage: http://www.cs.ubc.ca/labs/beta/Projects/SATenstein/
Keywords: SAT; stochastic local search; automatic algorithm configuration
Related Software: Paramils; SMAC; irace; SPOT; SATzilla; MiniSat; UBCSAT; emili; Lingeling; SAT competition; PicoSAT; AClib; ACOTSP; DIMACS; SCIP; ParaDisEO; aspeed; Auto-WEKA; Treengeling; Plingeling
Cited in: 17 Publications

Citations by Year