Journal of Northeastern University Natural Science ›› 2014, Vol. 35 ›› Issue (7): 935-938.DOI: 10.12068/j.issn.1005-3026.2014.07.006

• Information & Control • Previous Articles     Next Articles

An Dynamic Restart Strategy for Solving SAT Problem

GUO Ying, ZHANG Changsheng, ZHANG Bin   

  1. School of Information Science & Engineering, Northeastern University, Shenyang 110819, China.
  • Received:2013-04-01 Revised:2013-04-01 Online:2014-07-15 Published:2014-04-11
  • Contact: ZHANG Bin
  • About author:-
  • Supported by:
    -

Abstract: In order to reduce the computational costs in conflictdriven clause learning solvers, an improved adaptive heuristic restart strategy named 2WSAT was proposed, which was based on two questions including“when to restart”and“where to restart”. In this strategy, the conflict decision levels and variable’s restart times were taken as important solving state parameters, so that overall performance could be improved by escaping from wrong search branches and choosing better decision variables. Comparative experiments were conducted among 2WSAT and two modern solvers, using the practical application benchmarks. The results showed that 2WSAT has higher scores in many key indicators such as solving speed, memory usage, conflicts number, propagation number etc.

Key words: propositional satisfiability problem, restart strategy, heuristic, conflict decision level, variable’s restart times

CLC Number: