Speeding up SAT for EDA

This paper presents performance results for a new SAT solver designed specifically for EDA applications. The new solver significantly outperforms most efficient SAT solvers-Chaff, SATO, and GRASP-on a large set of benchmarks. Performance improvements for standard benchmark groups vary from 1.5/spl times/ to 60/spl times/. They were achieved through a new decision-making strategy and more efficient Boolean constraint propagation (BCP).