论文信息 - P{re,i}cosat@sc'09 Picosat 193

P{re,i}cosat@sc'09 Picosat 193

In this note we describe the new features of PicoSAT version 913 as it was submitted to the SAT competition 2009. It also contains a description of our new solver PrecoSAT version 236, which tightly integrates various preprocessing techniques into a PicoSAT like core engine.

Armin Biere

[1] David Zuckerman,et al. Optimal Speedup of Las Vegas Algorithms , 1993, Inf. Process. Lett..

[2] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.

[3] Fahiem Bacchus,et al. Effective Preprocessing with Hyper-Resolution and Equality Reduction , 2003, SAT.

[4] Armin Biere,et al. Resolve and Expand , 2004, SAT.

[5] Armin Biere,et al. Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

[6] Ofer Strichman,et al. HaifaSat: A New Robust SAT Solver , 2005, Haifa Verification Conference.

[7] Armin Biere. (Q)CompSAT and (Q)PicoSAT at the SAT’06 Race , 2006 .

[8] Adaptive Restart Control for Conflict Driven SAT Solvers , 2008 .

[9] Lakhdar Sais,et al. A Generalized Framework for Conflict Analysis , 2008, SAT.

[10] Inês Lynce,et al. Conflict-Driven Clause Learning SAT Solvers , 2009, Handbook of Satisfiability.

[11] Armin Biere,et al. Minimizing Learned Clauses , 2009, SAT.