BerkMin: a fast and robust sat-solver (2002)

by Evgueni Goldberg , Yakov Novikov
Citations:248 - 5 self

Active Bibliography

Academy of Sciences (Belarus), – Evgueni Goldberg, Yakov Novikov
43 Verification of proofs of unsatisfiability for CNF formulas – Evgueni Goldberg, Yakov Novikov
8 Local Search for Boolean Relations on the Basis of Unit Propagation – Yakov Novikov - 2003
Verification of Proofs of Unsatisfiability for CNF formulas – n.n.
1143 Chaff: Engineering an Efficient SAT Solver – Matthew W. Moskewicz , Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik - 2001
292 Efficient Conflict Driven Learning in a Boolean Satisfiability Solver – Lintao Zhang, Conor F. Madigan, Matthew H. Moskewicz - 2001
719 Symbolic Model Checking without BDDs – Armin Biere , Alessandro Cimatti, Edmund Clarke, Yunshan Zhu - 1999
2474 Compositional Model Checking – E. M. Clarke, D. E. Long, K. L. Mcmillan - 1999
620 Counterexample-guided Abstraction Refinement – Edmund Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, Helmut Veith - 2000