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)
1 6 th International Workshop on "Boolean Problems" 2004, Abstract The theory of hierarchical Boolean satisfiability (SAT) solving proposed in this paper is based on a strict axiomatic system and introduces a new important notion of implicativity. The theory makes evident that increasing implicativity is the core of SAT-solving. We provide a theoretical(More)
The verification problem for the case of the description of a functional indeterminacy set by a system of partially specified Boolean functions is considered. The formal approach based on the reduction of the verification problem to a satisfiability test of the conjunctive normal form is suggested. Three approaches to the solution of the verification(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)
The problem of verification of logical descriptions of combinational devices is considered for incompletely functionally defined initial descriptions represented as systems of partially defined Boolean functions on intervals of input variable values. Verification methods based on simulation of combinational circuits for cases of input stimuli represented by(More)