| 基于关键文字的求解SAT问题的启发式算法 |
| |
| 引用本文： | 秦永彬,张秋菊. 基于关键文字的求解SAT问题的启发式算法[J]. 计算机与数字工程, 2010, 38(10): 1-4 |
| |
| 作者姓名： | 秦永彬 张秋菊 |
| |
| 作者单位： | 贵州大学计算机科学与信息学院,贵阳,550025 |
| |
| 基金项目： | 国家自然科学基金，贵州省省长基金，贵州大学自然科学青年基金 |
| |
| 摘 要： | 逻辑公式的可满足问题的求解方法是近几年研究的重点,通过对逻辑公式的关键文字和骨干变元集的研究与分析,使用启发式算法寻找公式的关键文字,在公式化简中引入关键文字规则,给出了一种新的求解SAT问题的启发式算法。
|
| 关 键 词： | 关键文字 骨干变元集 可满足（SAT） 启发式算法 |
A Heuristic Algorithm for Solving the Satisfiability Problem Based on the Key Literal |
| |
| Qin Yongbin,Zhang Qiuju. A Heuristic Algorithm for Solving the Satisfiability Problem Based on the Key Literal[J]. Computer and Digital Engineering, 2010, 38(10): 1-4 |
| |
| Authors: | Qin Yongbin Zhang Qiuju |
| |
| Affiliation: | Qin Yongbin Zhang Qiuju(College of Computer Science and Information,Guizhou University,Guiyang550025) |
| |
| Abstract: | The solution method of the satisfiability problem of the logic formula is the focus of the study in recently years.Through the study and analysis of the key word and backbone of the logic formula,using the heuristic algorithm to search the key literal of the formula,introducing the rule of the key literal into the simplification of the formula,and giving out a new heuristic algorithm for the satisfiability problem. |
| |
| Keywords: | key literal backbone satisfiability heuristic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
