A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
BerkMin: A fast and robust SAT-solver
Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition
Preserved Fulltext
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
doi:10.1109/date.2002.998262
dblp:conf/date/GoldbergN02
fatcat:utkibds4gvdnbpnract7j6yayi