A Modified DP Algorithm for Solving Hard SAT Problems
Guoyi Zhang · 2002
DP algorithm is one of the most efficient complete algorithms for solving SAT (satisfiability) problems. The branching literal strategy of DP algorithm is discussed and analyzed in this paper. Based on estimating the number of unsatisfiable solutions, an efficient strategy of branching literals is proposed. Experimental results demonstrate that the average computation time of hard SAT instances has been improved.