Chaff:engineering an efficient SAT solver. Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to this problem for problem instances encountered in a range of applications in Electronic Design Automation (EDA), as well as in Artificial Intelligence (AI). This study has culminated in the development of several SAT packages, both proprietary and in the public domain (e.g. GRASP, SATO) which find significant use in both research and industry. Most existing complete solvers are variants of the Davis-Putnam (DP) search algorithm. In this paper we describe the development of a new complete solver, Chaff, which achieves significant performance gains through careful engineering of all aspects of the search - especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy. Chaff has been able to obtain one to two orders of magnitude performance improvement on difficult SAT benchmarks in comparison with other solvers (DP or otherwise), including GRASP and SATO.

References in zbMATH (referenced in 570 articles )

Showing results 1 to 20 of 570.
Sorted by year (citations)

1 2 3 ... 27 28 29 next

  1. Achterberg, Tobias; Bixby, Robert E.; Gu, Zonghao; Rothberg, Edward; Weninger, Dieter: Presolve reductions in mixed integer programming (2020)
  2. Berkholz, Christoph; Nordström, Jakob: Supercritical space-width trade-offs for resolution (2020)
  3. Bromberger, Martin; Sturm, Thomas; Weidenbach, Christoph: A complete and terminating approach to linear integer solving (2020)
  4. Drechsler, Rolf (ed.); Soeken, Mathias (ed.): Advanced Boolean techniques. Selected papers from the 13th international workshop on Boolean problems, Bremen, Germany, September 19--21, 2018 (2020)
  5. Hebrard, Emmanuel; Katsirelos, George: Constraint and satisfiability reasoning for graph coloring (2020)
  6. Kiesl, Benjamin; Rebola-Pardo, Adrián; Heule, Marijn J. H.; Biere, Armin: Simulating strong practical proof systems with extended resolution (2020)
  7. Lagniez, Jean-Marie; Lonca, Emmanuel; Marquis, Pierre: Definability for model counting (2020)
  8. Lammich, Peter: Efficient verified (UN)SAT certificate checking (2020)
  9. Li, Chu-Min; Xiao, Fan; Luo, Mao; Manyà, Felip; Lü, Zhipeng; Li, Yu: Clause vivification by unit propagation in CDCL SAT solvers (2020)
  10. Weinzierl, Antonius; Taupe, Richard; Friedrich, Gerhard: Advancing lazy-grounding ASP solving techniques -- restarts, phase saving, heuristics, and more (2020)
  11. Abd El-Maksoud, Munira A.; Abdalla, Areeg: A novel SAT solver for the Van der Waerden numbers (2019)
  12. Everardo, Flavio; Janhunen, Tomi; Kaminski, Roland; Schaub, Torsten: The return of \textitxorro (2019)
  13. Wang, Wenxi; Søndergaard, Harald; Stuckey, Peter J.: Wombit: a portfolio bit-vector solver using word-level propagation (2019)
  14. Belahcène, K.; Labreuche, C.; Maudet, N.; Mousseau, V.; Ouerdane, W.: An efficient SAT formulation for learning multiple criteria non-compensatory sorting rules from examples (2018)
  15. Biere, Armin; Kröning, Daniel: SAT-based model checking (2018)
  16. Blanchette, Jasmin Christian; Fleury, Mathias; Lammich, Peter; Weidenbach, Christoph: A verified SAT solver framework with learn, forget, restart, and incrementality (2018)
  17. Cheng, Xi; Zhou, Min; Song, Xiaoyu; Gu, Ming; Sun, Jiaguang: Parallelizing SMT solving: lazy decomposition and conciliation (2018)
  18. Kreter, Stefan; Schutt, Andreas; Stuckey, Peter J.; Zimmermann, Jürgen: Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems (2018)
  19. Lauria, Massimo: Cliques enumeration and tree-like resolution proofs (2018)
  20. Lauria, Massimo: A note about (k)-DNF resolution (2018)

1 2 3 ... 27 28 29 next

Further publications can be found at: