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

by Evgueni Goldberg , Yakov Novikov
Citations:239 - 4 self

Active Bibliography

41 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.
21 The SAT2002 Competition – Laurent Simon, Daniel Le Berre, Edward A. Hirsch - 2002
5 The Effect of Structural Branching on the Efficiency of Clause Learning SAT Solving – Matti Järvisalo
2.2.1 Boolean Constraint Propagation (BCP)......... 30 – Beverly Sackler, Faculty Exact Sciences, Alexander Nadel
Understanding and Improving a Modern . . . – Alexander Nadel
21 Understanding the power of clause learning – Paul Beame, Henry Kautz, Ashish Sabharwal - 2003
Structural Heuristics for SAT-based ATPG – Daniel Tille, Stephan Eggersglüß, Hoang M. Le, Rolf Drechsler
292 Efficient Conflict Driven Learning in a Boolean Satisfiability Solver – Lintao Zhang, Conor F. Madigan, Matthew H. Moskewicz - 2001
15 SatEx: A Web-based Framework for SAT Experimentation – Laurent Simon, Philippe Chatalic - 2001
6 Cama: A multi-valued satisfiability solver – Cong Liu, Andreas Kuehlmann, Matthew W. Moskewicz - 2003
9 Satometer: How Much Have We Searched? – Fadi A. Aloul, Brian D. Sierawski, Karem A. Sakallah - 2002
A resolution based SAT-solver operating on complete – Eugene Goldberg
9C-3 Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets – Stefan Disch, Christoph Scholl
12 CirCUs: A hybrid satisfiability solver – Hoonsang Jin, Fabio Somenzi - 2004
Formal: A SEQUENTIAL ATPG-BASED BOUNDED MODEL CHECKING SYSTEM FOR VLSI CIRCUITS – Qiang Qiang - 2006
28 Formal Models of Heavy-Tailed Behavior in Combinatorial Search – Hubie Chen, Carla Gomes, Bart Selman - 2001
7 SEARCHING FOR TRUTH: TECHNIQUES FOR SATISFIABILITY OF BOOLEAN FORMULAS – Lintao Zhang, Sharad Malik, Aarti Gupta - 2003