1. The interplay of randomization and learning on real-world instances of satisfiability;Baptista,2000
2. Using CSP look-back techniques to solve real-world SAT instances;Bayardo,1997
3. Near optimal separation of treelike and general resolution;Ben-Sasson,2000
4. Symbolic model checking using SAT procedures instead of BDDs;Biere,1999
5. Logic Minimization Algorithms for VLSI Synthesis;Brayton,1984