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

### Cached

### Download Links

- [www.math.ucsd.edu]
- [math.ucsd.edu]
- [www.ece.cmu.edu]
- [www.icsd.aegean.gr]
- [eigold.tripod.com]
- DBLP

### Other Repositories/Bibliography

Citations: | 255 - 5 self |

### BibTeX

@INPROCEEDINGS{Goldberg02berkmin:a,

author = {Evgueni Goldberg and Yakov Novikov},

title = {BerkMin: a fast and robust sat-solver},

booktitle = {},

year = {2002},

pages = {142--149}

}

### Years of Citing Articles

### OpenURL

### Abstract

We describe a SAT-solver, BerkMin, that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause “aging”. At the same time BerkMin introduces a new decision making procedure and a new method of clause database management. We experimentally compare BerkMin with Chaff, the leader among SAT-solvers used in the EDA domain. Experiments show that our solver is more robust than Chaff. BerkMin solved all the instances we used in experiments including very large CNFs from a microprocessor verification benchmark suite. On the other hand, Chaff was not able to complete some instances even with the timeout limit of 16 hours. 1.

### Citations

1219 | Chaff: Engineering an Efficient SAT Solver
- Moskewicz, Madigan, et al.
- 2001
(Show Context)
Citation Context ...esis [5], equivalence checking [6,9], and model checking [4] reduce to the satisfiability problem. In the last decade substantial progress has been made in the development of practical SAT algorithms =-=[1,2,8,11,12,13,15,18]-=-. All of them are search algorithms that aim at finding a satisfying assignment by variable splitting. Search algorithms of that kind are descendants of the DPLL-algorithm [7]. DPLL-algorithm can be c... |

776 |
A machine program for theorem proving
- Davis, Logemann, et al.
- 1962
(Show Context)
Citation Context ...ithms [1,2,8,11,12,13,15,18]. All of them are search algorithms that aim at finding a satisfying assignment by variable splitting. Search algorithms of that kind are descendants of the DPLL-algorithm =-=[7]-=-. DPLL-algorithm can be considered as a special case of general resolution which is called tree-like resolution. It was shown in [3] that there is exponential gap between the performance of tree-like ... |

411 | GRASP: A Search Algorithm for Propositional Satisfiability
- Marques-Silva, Sakallah
- 1999
(Show Context)
Citation Context ...esis [5], equivalence checking [6,9], and model checking [4] reduce to the satisfiability problem. In the last decade substantial progress has been made in the development of practical SAT algorithms =-=[1,2,8,11,12,13,15,18]-=-. All of them are search algorithms that aim at finding a satisfying assignment by variable splitting. Search algorithms of that kind are descendants of the DPLL-algorithm [7]. DPLL-algorithm can be c... |

390 |
Logic Minimization Algorithms for VLSI Synthesis
- Brayton, McMullen, et al.
- 1984
(Show Context)
Citation Context ...atisfy (set to 1) all the disjunctions of F by some assignment of values to variables from {x1,…,xn}. A disjunction of F is also called a clause of F. Many problems such as ATPG [16], logic synthesis =-=[5]-=-, equivalence checking [6,9], and model checking [4] reduce to the satisfiability problem. In the last decade substantial progress has been made in the development of practical SAT algorithms [1,2,8,1... |

295 | Symbolic model checking using SAT procedures instead of BDDs
- Biere, Cimatti, et al.
- 1999
(Show Context)
Citation Context ...assignment of values to variables from {x1,…,xn}. A disjunction of F is also called a clause of F. Many problems such as ATPG [16], logic synthesis [5], equivalence checking [6,9], and model checkin=-=g [4]-=- reduce to the satisfiability problem. In the last decade substantial progress has been made in the development of practical SAT algorithms [1,2,8,11,12,13,15,18]. All of them are search algorithms th... |

221 | Using CSP Look-Back Techniques to Solve Real-World SAT Instances
- Bayardo, Schrag
- 1997
(Show Context)
Citation Context ...esis [5], equivalence checking [6,9], and model checking [4] reduce to the satisfiability problem. In the last decade substantial progress has been made in the development of practical SAT algorithms =-=[1,2,8,11,12,13,15,18]-=-. All of them are search algorithms that aim at finding a satisfying assignment by variable splitting. Search algorithms of that kind are descendants of the DPLL-algorithm [7]. DPLL-algorithm can be c... |

168 | Improvements to Propositional Satisfiability Search Algorithms
- Freeman
- 1995
(Show Context)
Citation Context |

127 | Combinational test generation using satisfiability - Stephan, Brayton, et al. - 1996 |

105 |
An efficient propositional prover
- SATO
- 1997
(Show Context)
Citation Context |

51 | Near-optimal separation of treelike and general resolution. Manuscript. Available as ECCC TR 00-005 at the page http://www.eccc.uni-trier.de/eccc-local/Lists/TR-2000.html
- Ben-Sasson, Impagliazzo, et al.
(Show Context)
Citation Context ...earch algorithms of that kind are descendants of the DPLL-algorithm [7]. DPLL-algorithm can be considered as a special case of general resolution which is called tree-like resolution. It was shown in =-=[3]-=- that there is exponential gap between the performance of tree-like resolution and that of general resolution. Modern SAT-solvers have made at least two steps towards general resolution trying to elim... |

44 | Using Sat for combinational equivalence checking
- Goldberg, Prasad
(Show Context)
Citation Context ...disjunctions of F by some assignment of values to variables from {x1,…,xn}. A disjunction of F is also called a clause of F. Many problems such as ATPG [16], logic synthesis [5], equivalence checkin=-=g [6,9]-=-, and model checking [4] reduce to the satisfiability problem. In the last decade substantial progress has been made in the development of practical SAT algorithms [1,2,8,11,12,13,15,18]. All of them ... |

35 |
Tight Integration of Combinational Verification Methods
- Burch
(Show Context)
Citation Context ...disjunctions of F by some assignment of values to variables from {x1,…,xn}. A disjunction of F is also called a clause of F. Many problems such as ATPG [16], logic synthesis [5], equivalence checkin=-=g [6,9]-=-, and model checking [4] reduce to the satisfiability problem. In the last decade substantial progress has been made in the development of practical SAT algorithms [1,2,8,11,12,13,15,18]. All of them ... |

26 |
The impact of branching heuristics in propositional satisfiability algorithms
- Silva
- 1999
(Show Context)
Citation Context ... of SATZ are different from ours). BerkMin uses a relatively complex decision making procedure. However this complexity has been justified in numerous experiments. This fact refutes the claim made in =-=[14]-=- that for SAT-solvers using clause recording the quality of decision making is of no great importance. 5. Clause database management Before starting the next iteration (i.e. building a new search tree... |

16 |
A constrained-based approach to narrow search for Satisfiability // Information processing letters.-1999
- Li
(Show Context)
Citation Context |

8 | The interplay of randomization and learning on real-world instances of satisfiability
- Baptista
- 2000
(Show Context)
Citation Context |

6 |
Logic Minimization Algorithms for VLSI Synthesis
- al
- 1984
(Show Context)
Citation Context ...atisfy (set to 1) all the disjunctions of F by some assignment of values to variables from {x1,…,xn}. A disjunction of F is also called a clause of F. Many problems such as ATPG [16], logic synthesi=-=s [5]-=-, equivalence checking [6,9], and model checking [4] reduce to the satisfiability problem. In the last decade substantial progress has been made in the development of practical SAT algorithms [1,2,8,1... |

6 |
Boosting combinational search through randomization
- Gomes, Kautz
- 1997
(Show Context)
Citation Context ...lver abandons the current search tree (without completing it) and starts a new one. So instead of one complete search tree the SATsolver constructs a set of incomplete (except the last one) trees. In =-=[1,10]-=- the usefulness of restarts was proven experimentally. Restarts are effectively used in Chaff [13]. We introduce a new SAT solver called BerkMin (BerkMin stands for Berkeley-Minsk, the cities where th... |

5 |
benchmark suite. Available from http://www.ece.cmu.edu/~mvelev
- CMU
(Show Context)
Citation Context ...Fs that are relatively easy for BerkMin and that cannot be solved by Chaff even with the timeout limit of 16 hours. In particular, BerkMin solved all the instances of the benchmark suite fvp-unsat2.0 =-=[17]-=- in less than two hours. This class consists of large unsatisfiable CNFs (except one instance) describing verification of pipelined microprocessors. The proof of unsatisfiability of the instance pipe6... |