Experimental Study on Strategy of Combining SAT Algorithms

摘要

The effectiveness of many SAT algorithms is mainly reflected by their significant perfor- mances on one or several classes of specific SAT problems. Different kinds of SAT algorithms all have their own hard instances respectively. therefore, to get the better performance on all kinds of problems, SAT solver should know how to select different algorithms according to the feature of instances. In this paper the differences of several effective SAT algorithms are analyzed and two new parameters φ and δ are proposed to characterize the feature of SAT instances. Experiments are performed to study the relationship between SAT algorithms and some statistical parameters including φ, δ. Based on this analysis, a strategy is presented for designing a faster SAT tester by carefully combining some existing SAT algorithms. With this strategy, a faster SAT tester to solve many kinds of SAT problem is obtained.