  This study presents a novel heuristic algorithm called the "Minimal Positive
Negative Product Strategy" to guide the CDCL algorithm in solving the Boolean
satisfiability problem. It provides a mathematical explanation for the
superiority of this algorithm over widely used heuristics such as the Dynamic
Largest Individual Sum (DLIS) and the Variable State Independent Decaying Sum
(VSIDS). Experimental results further confirm the effectiveness of this
heuristic strategy in problem-solving.
