Learn More
We describe a SAT-solver, BerkMin, that inherits suchfeatures of GRASP, SATO, and Chaff as clause recording,fast BCP, restarts, and conflict clause "aging". At thesame time BerkMin introduces a new decision makingprocedure and a new method of clause databasemanagement. We experimentally compare BerkMin withChaff, the leader among SAT-solvers used in the(More)
In the paper, we consider the problem of checking whether cubes from a set S are implicants of a DNF formula D, at the same time minimizing the overall time taken by the checks. An obvious but inefficient way of solving the problem is to perform all the checks independently. In the paper, we consider a different approach. The key idea is that when checking(More)
  • 1