The Quest for Efficient Boolean Satisfiability Solvers (2002)

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

Documents Related by Co-Citation

1119 Chaff: Engineering an Efficient SAT Solver – Matthew W. Moskewicz , Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik - 2001
742 A machine program for theorem proving – Martin Davis, George Logemann, Donald Loveland - 1962
292 Efficient Conflict Driven Learning in a Boolean Satisfiability Solver – Lintao Zhang, Conor F. Madigan, Matthew H. Moskewicz - 2001
263 Symbolic Model Checking Using SAT Procedures instead of BDDs – A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, Y. Zhu - 1999
62 N.: ICS: Integrated canonizer and solver – J C Filliatre, S Owre, H Rue, Shankar
534 A Machine Program for Theorem-Proving – M Davis, G Logemann, D Loveland - 1962
564 Constraint Processing – R Dechter - 2003
431 Planning as satisfiability – Henry Kautz, Bart Selman - 1992
1084 A computing procedure for quantification theory – Martin Davis, Hilary Putnam - 1960
463 An Extensible SAT-solver – N Eén, N Sörensson - 2003
46 A Hybrid SAT-Based Decision Procedure for Separation Logic with Uninterpreted Functions – Sanjit A. Seshia, Shuvendu K. Lahiri, Randal E. Bryant - 2003
358 GRASP - A New Search Algorithm for Satisfiability – Joso L Marques Silva - 1996
204 CVC Lite: A new implementation of the cooperating validity checker – Clark Barrett, Sergey Berezin - 2004
24 Partition-Based Decision Heuristics for Image Computation using SAT and BDDs – Aarti Gupta, Zijiang Yang, Pranav Ashar - 2001
397 Network-based heuristics for constraint satisfaction problems – R Dechter, J Pearl - 1987
2927 Graph-based algorithms for Boolean function manipulation – Randal E. Bryant - 1986
5 Reasoning with Goals to Engineer Requirements – C Rolland
12 Algorithms and Experiments on Finding Minimal Models – Paolo Liberatore - 2000
35 Requirements engineering in the year 00: a research perspective, in: The – A V Lamsweerde - 2000