| 基于演化算法的SAT问题求解 |
| |
| 引用本文： | 夏建勋.基于演化算法的SAT问题求解[J].广东电脑与电讯,2007(3):14-16. |
| |
| 作者姓名： | 夏建勋 |
| |
| 作者单位： | 孝感学院计算机科学系 湖北孝感432000 |
| |
| 摘 要： | SAT问题即布尔可满足性问题是逻辑学的一个基本问题,也是计算机科学和人工智能研究的核心问题。寻找求解SAT问题的快速算法不仅在理论研究上而且在许多应用领域都具有极其重要的意义。本文讨论了基于演化算法的SAT问题求解方法。
|
| 关 键 词： | SAT问题 NP问题 演化算法 |
The Solution To The SAT Based On Evolutionary Algorithm |
| |
| Xia Jianxun.The Solution To The SAT Based On Evolutionary Algorithm[J].Computer & Telecommunication,2007(3):14-16. |
| |
| Authors: | Xia Jianxun |
| |
| Abstract: | SAT(Boolean Satisfiablity Problem)is not only a fundamental problem of logic,but also a core problem of computer science and artificial intelligence.It is very important to searching the solution to SAT not only in the field of theory but also in the field of practice.So,the paper discusses the solution to the SAT based on the evolutionary algorithm. |
| |
| Keywords: | SAT problem NP problem evolutionary algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
