GUO Ying, ZHANG Changsheng, ZHANG Bin. An Dynamic Restart Strategy for Solving SAT Problem[J]. Journal of Northeastern University Natural Science, 2014, 35(7): 935-938.
[1] Huang 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. [2] Biere A.PicoSAT essentials[J].Journal on Satisfiability,Boolean Modeling and Computation,2008,4(5):75/97. [3] Haim S,Heule M J H.Towards ultra rapid restarts[R].Delft:UNSW and TU Delft,2010. [4] Ramos 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. [5] van 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. [6] Balint A,Belov A,Diepold D,et al.Solver and benchmark descriptions[C]//Proceedings of SAT Challenge 2012.Helsinki:University of Helsinki,2012:38. [7] Audemard G,Simon L.Refining restarts strategies for SAT and UNSAT[C]//Principles and Practice of Constraint Programming.Berlin:Springer,2012:118/126. [8] Eén N,Srensson N.An extensible SATsolver[C]//Theory and Applications of Satisfiability Testing.Berlin:Springer,2004:333/336. [9] 郭莹,张斌,张长胜.SAT问题求解器重启策略对比分析[J].小型微型计算机系统,2013,34(12):2724/2728.(Guo Ying,Zhang Bin,Zhang Changsheng.Comparative analysis of restart strategy of satisfiability problem solver[J].Journal of Chinese Computer Systems,2013,34(12):2724/2728.) [10] Davis M,Logemann G,Loveland D.A machine program for theoremproving[J].Communications of the ACM,1962,5(7):394/397.