EDA领域中可满足性问题求解方法研究  

Survey on Solving SAT Problems in EDA

作　　者：王秀芹[1] 王昊 马光胜[3] 

机构地区：[1]渤海大学信息科学与工程学院,锦州121013 [2]黑龙江科技学院电气与信息工程学院,哈尔滨150027 [3]哈尔滨工程大学计算机科学与技术学院,哈尔滨150001

出　　处：《计算机科学》2009年第9期17-20,31,共5页Computer Science

基　　金：国家自然科学基金(60273081);黑龙江省自然科学基金(QC2008C98)资助

摘　　要：可满足性问题是理论计算机和人工智能中的著名问题,很多问题都可以通过可满足性求解方法解决。对EDA领域中可满足性问题的求解技术进行了研究。总结了目前主要的求解方法,并对不同的方法进行了详细的分类和比较。讨论了该领域研究中存在的问题,并指出了近期研究热点和未来发展趋势。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.

关 键 词：布尔可满足性 电子设计自动化 求解方法 

分 类 号：TP407[自动化与计算机技术]