the National Natural Science Foundation of China (Grant Nos. 90207002, 90307017, 60773125 and 60676018);National Science Foundation (Grant Nos. CCR-0306298);China Postdoctoral Science Foundation (Grant No. KLH1202005);the Natural Science Foundation of Shanghai City (Grant No. 06ZR14016)
This paper presents a heuristic polarity decision-making algorithm for solving Boolean satisfiability (SAT). The algorithm inherits many features of the current state-of-the-art SAT solvers, such as fast BCP, clause...