DPLL算法中变量决策启发式策略.pdfVIP

Software Engineering and Applications 软件工程与应用, 2016, 5(1), 47-55 Published Online February 2016 in Hans. /journal/sea /10.12677/sea.2016.51006 Heuristic Strategies for Deciding Variables in DPLL Algorithm Wenxiu Liu, Jianguo Jiang, Qianhui Li School of Mathematics, Liaoning Normal University, Dalian Liaoning th th th Received: Jan. 29 , 2016; accepted: Feb. 12 , 2016; published: Feb. 19 , 2016 Copyright © 2016 by authors and Hans Publishers Inc. This work is licensed under the Creative Commons Attribution International License (CC BY). /licenses/by/4.0/ Abstract Aiming at the problem of the resolution efficiency of propositional satisfiability problem for propositional formula φ (CNF Form), based on the study of the DPLL complete algorithm and the research of the word order processing under different forms, a new algorithm for solving SAT problem is proposed. The algorithm groups propositional formula φ according to the length of clause, and sorts the words according to the number of polarity occurrence frequency in the initial sort. Then it considers the number of occurrences of the plus or minus words in variables and gets the value of high numbers. Algorithm instance shows that the new algorithm can reduce the num- ber of rules in the process of using, reduce the solving steps, cut off the unsatisfy space of solution as soon as possible, so as to improve the solution efficiency. Keywords DPLL Algorithm, Heuristic Strategy, Propositional Satisfiability Problem DPLL算法中的变量决策启发式策略 刘文秀，江建国，李千卉 辽宁师范大学数学学院，辽宁 大连 收稿日期：2016年1月29 日；录用日期：2016年2月12 日；发布日期：2016年2月19 日 文章引用: 刘文秀, 江建国, 李千卉. DPLL 算法中的变量决策启发式策略[J]. 软件工程与应