Abstract: Boolean satisfiability is a famous problem in theory computer and artificial intelligence, many problems can be solved by the means of solving SAT problems. In this paper, the solving technology for SAT problems in EDA fields was studied. Major solving approaches were summarized, and these different approaches were sorted and compared.Problems existed in this fields were discussed, hot research issues and the development trends in the future were pointed out.

Key words: Boolean satisfiability, EDA,Solving approach