Abstract. We present a technique for checking instances of the satisfiability (SAT) problem based on a combination of the Davis-Putnam (DP) procedure and stochastic methods. We first use the DP procedure to some extent, so as to partition and reduce the search space. If the reduction does not lead to an answer, a stochastic algorithm is then used to search each subspace. This approach is proven to be efficient for several types of SAT instances. A parallel implementation of the method is described and some experimental results are reported. 1 Introduction The Satisfiability (SAT) problem in the propositional logic is very well known. It is a key problem in computer science. It also plays an important role in real world applications such as planning, hardware verification and testing. Since SAT is an NP-complete problem, we do not expect that there is an efficient algorithm which can determine the satisfiability of every instance of the problem. But it is still worthwhile to do research on practical techniques which can solve many SAT instances efficiently
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.