The Quest for Efficient Boolean Satisfiability Solvers (2002)

by Lintao Zhang , Sharad Malik
Citations:130 - 2 self

Documents Related by Co-Citation

1143 Chaff: Engineering an Efficient SAT Solver – Matthew W. Moskewicz , Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik - 2001
752 A Machine Program for Theorem Proving – M Davis, G Logemann, D Loveland - 1962
541 A machine program for theorem-proving – Martin Davis, George Logemann, Dondald Loveland - 1962
572 Constraint Processing – R Dechter - 2003
1082 A computing procedure for quantification theory – M DAVIS, H PUTNAM - 1960
474 N.: An extensible SAT-solver – N Eén, Sörensson - 2004
435 Planning as satisfiability – Henry Kautz, Bart Selman - 1992
2976 Graph-based algorithms for Boolean function manipulation – Randal E. Bryant - 1986
292 Efficient Conflict Driven Learning in a Boolean Satisfiability Solver – Lintao Zhang, Conor F. Madigan, Matthew H. Moskewicz - 2001