Chaff: engineering an efficient SAT solver

@article{Moskewicz2001ChaffEA,
  title={Chaff: engineering an efficient SAT solver},
  author={M. Moskewicz and Conor F. Madigan and Ying Zhao and Lintao Zhang and S. Malik},
  journal={Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)},
  year={2001},
  pages={530-535}
}
Boolean satisfiability is probably the most studied of the 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… Expand
Fast bit-vector satisfiability
The External Interface for Extending WASP
Tuning Parallel SAT Solvers
Exploiting Satisfiability Solvers for Efficient Logic Synthesis
Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers
Améliorer SAT dans le cadre incrémental
Efficient satisfiability solver
Efficient Path Delay Test Generation with Boolean Satisfiability
Just-In-Time Compilation of Knowledge Bases
...
1
2
3
4
5
...

References

SHOWING 1-3 OF 3 REFERENCES
benchmarks available at ftp://dimacs.rutgers.edu/pub/challenge/sat
  • benchmarks available at ftp://dimacs.rutgers.edu/pub/challenge/sat
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms