Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning.

作者: Adrian Balint , Norbert Manthey

DOI: 10.29007/28WW

关键词:

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

参考文章(26)
Chu Min Li, Anbulagan Anbulagan, Heuristics based on unit propagation for satisfiability problems international joint conference on artificial intelligence. pp. 366- 371 ,(1997)
Marijn J. H. Heule, Matti Järvisalo, Armin Biere, Efficient CNF simplification based on binary implication graphs theory and applications of satisfiability testing. pp. 201- 215 ,(2011) , 10.1007/978-3-642-21581-0_17
Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown, Sequential model-based optimization for general algorithm configuration learning and intelligent optimization. pp. 507- 523 ,(2011) , 10.1007/978-3-642-25566-3_40
Norbert Manthey, Marijn J. H. Heule, Armin Biere, Automated Reencoding of Boolean Formulas Hardware and Software: Verification and Testing. pp. 102- 117 ,(2013) , 10.1007/978-3-642-39611-3_14
Dave A. D. Tompkins, Adrian Balint, Holger H. Hoos, Captain Jack: new variable selection heuristics in local search for SAT theory and applications of satisfiability testing. pp. 302- 316 ,(2011) , 10.1007/978-3-642-21581-0_24
Norbert Manthey, Coprocessor 2.0: a flexible CNF simplifier theory and applications of satisfiability testing. pp. 436- 441 ,(2012) , 10.1007/978-3-642-31612-8_34
Norbert Manthey, Tobias Philipp, Christoph Wernhard, Soundness of Inprocessing in Clause Sharing SAT Solvers Theory and Applications of Satisfiability Testing – SAT 2013. pp. 22- 39 ,(2013) , 10.1007/978-3-642-39071-5_4
Marijn JH Heule, Hans van Maaren, None, Look-ahead based SAT solvers Handbook of Satisfiability. pp. 155- 184 ,(2009) , 10.3233/978-1-58603-929-5-155
Adrian Balint, Daniel Diepold, Daniel Gall, Simon Gerber, Gregor Kapler, Robert Retz, EDACC - an advanced platform for the experiment design, administration and analysis of empirical algorithms learning and intelligent optimization. pp. 586- 599 ,(2011) , 10.1007/978-3-642-25566-3_46
Ludwig Krippahl, Pedro Barahona, PSICO: Solving Protein Structures with Constraint Programming and Optimization Constraints - An International Journal. ,vol. 7, pp. 317- 331 ,(2002) , 10.1023/A:1020577603762