摘要
SAT问题即布尔可满足性问题是逻辑学的一个基本问题,也是计算机科学和人工智能研究的核心问题。寻找求解SAT问题的快速算法不仅在理论研究上而且在许多应用领域都具有极其重要的意义。本文讨论了基于演化算法的SAT问题求解方法。
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.
出处
《电脑与电信》
2007年第3期14-16,共3页
Computer & Telecommunication
