Efficient Conflict Driven Learning in a Boolean Satisfiability Solver (2001)

by Lintao Zhang , Conor F. Madigan , Matthew H. Moskewicz
Venue:In ICCAD
Citations:292 - 8 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
704 Symbolic Model Checking without BDDs – Armin Biere , Alessandro Cimatti, Edmund Clarke, Yunshan Zhu - 1999
374 GRASP: A Search Algorithm for Propositional Satisfiability – JoaƤo P. Marques-silva, Karem A. Sakallah - 1999
1084 A computing procedure for quantification theory – Martin Davis, Hilary Putnam - 1960
194 SATO: an Efficient Propositional Prover – Hantao Zhang - 1997
204 Using CSP look-back techniques to solve real-world SAT instances – Roberto J. Bayardo - 1997
2927 Graph-based algorithms for Boolean function manipulation – Randal E. Bryant - 1986
358 GRASP - A New Search Algorithm for Satisfiability – Joso L Marques Silva - 1996
43 An Efficient Algorithm for Unit Propagation – Hantao Zhang, Mark E. Stickel - 1996
239 BerkMin: a fast and robust sat-solver – Evgueni Goldberg, Yakov Novikov - 2002
161 Improvements To Propositional Satisfiability Search Algorithms – Jon William Freeman - 1995
115 Combinational test generation using satisfiability – P R Stephan, R K Brayton, A L Sangiovanni-Vincentelli - 1992
256 Test pattern generation using Boolean satisfiability – Tracy Larrabee - 1992
158 Using CSP look-back techniques to solve realworld SAT instances – Robert Schrag - 1997
113 Finding bugs with a constraint solver – D Jackson, M Vaziri - 2000
315 Boosting combinatorial search through randomization – Carla P. Gomes - 1998
4 Logic Sysntheiss and Verification Algorithms – G Hachtel, F Somenzi - 1996
263 Symbolic Model Checking Using SAT Procedures instead of BDDs – A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, Y. Zhu - 1999