期刊文献+

SAT问题求解器重启策略对比分析 被引量:2

Comparative Analysis of Restart Strategy of Satisfiability Problem Solver
在线阅读 下载PDF
导出
摘要 已有研究表明,在SAT求解器中引入重启可以极大地提高求解性能,并已出现了许多不同重启策略.目前还缺少全面的对比分析研究.为了避免重启策略选择的随意性,同时启发设计更好的重启策略,本文选择了具有代表性的7种重启策略,以目前广泛采用的Minisat为基本求解器,在国际SAT2011竞赛中实际应用类基准测试集之上进行了实验对比分析.结果表明:(1)不同重启策略对SAT求解器的求解过程和求解性能影响巨大;(2)在应用类测试集上,几何序列调度策略的平均综合性能优于其他策略;(3)在限定范围内,重启频率越大,求解器综合性能越好;(4)增量变化的重启频率可以克服固定重启频率导致不完备搜索的问题. It has been proved that the introduction of restart can greatly improve solving performance in the SAT solver, and many dif- ferent restart strategies appear accordingly. However, no comprehensive comparative analysis has been made for them currently. To avoid the arbitrariness of the restart strategy selection and inspire the designing of better restart strategy, seven representative restart strategies are selected to make a series of experimental comparative analysis. We take Minisat which is currently widely used as the basic solver, and take some application benchmarks from the international SAT 2011 competition as our testing cases. The experimen- tal results show that { i} restart strategy can enormously impact on the solving process and performance of SAT solver; ( ii ) the geo- metric sequence scheduling strategy is superior to other strategies at average comprehensive performance with respect to application benchmarks; ( iii ) within limits, the solving performance may be better if the restart frequency is greater; ( iv )the restart frequency with incremental changes can avoid leading to incomplete search.
出处 《小型微型计算机系统》 CSCD 北大核心 2013年第12期2729-2733,共5页 Journal of Chinese Computer Systems
基金 国家教育部少数民族高级骨干人才培养基金项目(教民[2008-8])资助 国家自然科学基金项目(61073062 61100090)资助 东北大学中央高校基本科研业务费项目(N11024006)资助
关键词 可满足性问题 求解器 冲突驱动子句学习 重启策略 satisfiability problem solver conflict-driven clause learning restart strategy
  • 相关文献

参考文献3

二级参考文献37

  • 1郑日荣,毛宗源,罗欣贤.一种加快基于信息熵的人工免疫算法运行速度的方法[J].计算机测量与控制,2004,12(11):1082-1084. 被引量:2
  • 2邱中华,高洁,朱跃星.应用免疫算法求解博弈问题[J].系统工程学报,2006,21(4):398-404. 被引量:10
  • 3李阳阳,焦李成.求解SAT问题的量子免疫克隆算法[J].计算机学报,2007,30(2):176-183. 被引量:45
  • 4陈昊.基于演化算法的SAT问题求解[J].湖北大学学报(自然科学版),2007,29(2):138-140. 被引量:3
  • 5Ivancic F, Yang Z, Ganai M K, et al. Efficient SAT-Based Bounded Model Checking for Software Verifications [J ]. Theoretical Computer Science,2008, 404(3):256-274.
  • 6Stephan P, Brayton R, Sangiovanni V A. Combinational Test Generation Using Satisfiabitity [J]. IEEE Trans on Computer-Aided Design of Integrated Circuits and Systems, 1996,15 : 1167-1176.
  • 7Kautz H, Selman B. Planning as Satisfiability[C]//Proc of the European Conf on Artificial Intelligence, 1992:359-363.
  • 8Davis M, Putnam H. A Computing Procedure for Quantification Theory[J]. Journal of the ACM, 1960,7(3):201-215.
  • 9Davis M, Logemann G, Loveland D. A Machine Program for Theorem Proving[J]. Communications of the ACM, 1962,5 (7) : 394-397.
  • 10Selman B, Kautz H, Cohen t3. Local Search Strategies for Satisfiability Testing[C]//Proc of th 2nd DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1996:521-532.

共引文献5

同被引文献12

  • 1罗二海,荆明娥,尹文波,周电,唐璞山.动静态结合排序决策的可满足性问题解决器[J].计算机辅助设计与图形学学报,2006,18(10):1472-1477. 被引量:3
  • 2Huang J. The effect of restarts on the efficiency of clause learning [ C ]//Proceedings of the 20th International Joint Conference on Artificial Intelligence. Morgan: Kaufmann Publishers Inc,2007:2318 - 2323.
  • 3Biere A. PicoSAT essentials [ J ]. Journal on Satisfiability, Boolean Modeling and Computation ,2008,4 ( 5 ) :75 - 97.
  • 4Haim S ,Heule M J H. Towards ultra rapid restarts[ R ]. Delft:UNSW and TU Delft,2010.
  • 5Rarnos A, van der Tak P, Heule M. Between restarts and backjumps[ C]//Theory and Applications of Satisfiability Testing-SAT 2011. Berlin : Springer,2011:216 - 229.
  • 6van der Tak P, Ramos A, Heule M. Reusing the assignment trail in CDCL solvers system description[J]. Journal on Satisfiability , Boolean Modeling and Computation, 2011,7 (7) :133 -138.
  • 7Balint A,Belov A, Diepold D, et al. Solver and benchmark descriptions [ C ]//Proceedings of SAT Challenge 2012. Helsinki : University of Helsinki ,2012:38.
  • 8Audemard G,Simon L. Refining restarts strategies for SAT and UNSAT [ C]//Principles and Practice of Constraint Programming. Berlin : Springer,2012 : 118 - 126.
  • 9E6n N, S/Srensson N. An extensible SAT-solver[ C]//Theory and Applications of Satisfiability Testing. Berlin: Springer, 2004:333 - 336.
  • 10Davis M,Logemann G, Loveland D. A machine program for theorem-proving [ J ]. Communications of the ACM, 1962,5 (7) :394-397.

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部