A weight-balanced branching rule for SAT

We analyze the search methods for the propositional satisfiability problem (SAT), and propose a branching rule that better balances the two factors, reaching a solution and simplifying the problem, when selecting the next value setting in the depth-first search. The results of computational experiments support our analyses and show effectiveness of our new branching rule on various problems.