BerkMin: A fast and robust Sat-solver

https://doi.org/10.1016/j.dam.2006.10.007Get rights and content
Under an Elsevier user license
open archive

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 resolution-based SAT-solvers. Experiments show that our program is more robust than Chaff being able to solve more instances than Chaff in a reasonable amount of time.

Keywords

Satisfiability testing
Decision-making procedure
Clause database management

Cited by (0)