计算机科学 ›› 2009, Vol. 36 ›› Issue (9): 17-20.
• 综述 • 上一篇 下一篇
王秀芹,王昊,马光胜
出版日期:
发布日期:
基金资助:
WANG Xiu-qin, WANG Hao, MA Guang-sheng
Online:
Published:
摘要： 可满足性问题是理论计算机和人工智能中的著名问题，很多问题都可以通过可满足性求解方法解决。对EDA领域中可满足性问题的求解技术进行了研究。总结了目前主要的求解方法，并对不同的方法进行了详细的分类和比较。讨论了该领域研究中存在的问题，并指出了近期研究热点和未来发展趋势。
关键词: 布尔可满足性，电子设计自动化，求解方法
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
王秀芹,王昊,马光胜. EDA领域中可满足性问题求解方法研究[J]. 计算机科学, 2009, 36(9): 17-20. https://doi.org/
WANG Xiu-qin, WANG Hao, MA Guang-sheng. Survey on Solving SAT Problems in FDA[J]. Computer Science, 2009, 36(9): 17-20. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2009/V36/I9/17
Cited
首页