A New Algorithm for Solving SAT Problems
Haojun Zhang · Computer Knowledge and Technology · 2010
Based on researches of the complete algorithm and the non-complete algorithm, combined with advantages that a complete algorithm can carry out a complete solution and non-complete algorithm solve faster. A new algorithm for solving SAT problems has been proposed-groups on the clause, the solution algorithm of the group. The algorithm is complete in groups on the SAT clause, while the local search method is used to solve with a relatively high speed in a group solving. Experimental results show that the method can significantly improve the efficiency.