A branching heuristic for testing propositional satisfiability
Jinchang Wang · 2002
This paper presents a heuristic criterion in selecting the branching variable in searching for a satisfiable solution to a propositional formula. The heuristic is a modification of the one used in the Jeroslow-Wang method (1990). It gives more chances by analysis to locate a satisfiable solution, and is supposed to reduce the searching tree and searching time in some cases.