Journal of Northeastern University Natural Science ›› 2020, Vol. 41 ›› Issue (1): 44-48.DOI: 10.12068/j.issn.1005-3026.2020.01.008

• Information & Control • Previous Articles     Next Articles

Learnt Clauses Optimize Method Based on Restart Strategy

LI Zhuang, LIU Lei, ZHANG Tong-bo, LYU Shuai   

  1. College of Computer Science and Technology, Jilin University, Changchun 130012, China.
  • Received:2019-03-19 Revised:2019-03-19 Online:2020-01-15 Published:2020-02-01
  • Contact: LYU Shuai
  • About author:-
  • Supported by:
    -

Abstract: With the background of optimization of the learnt clauses database, a new optimization method for learnt clauses based on the original MiniSAT solver was proposed. Based on game theory, this method adjusts the growth parameters after several restarts on the basis of the real-time feedback of the current solver, in order to be as close as possible to the balance point of clauses in the learnt clauses database. This makes the storage capacity of the learnt clause database reach the Pareto optimality as much as possible. Experiments showed that the proposed method is effective and outperforms existing optimization methods in random SAT problems. This method neither affects the speed of unit propagation because of too many clauses in the learnt clause database, nor destroys the integrity of learning because of too few clauses in the learnt clause database.

Key words: DPLL(Davis-Putnam-Logemann-Loveland), clause learning, learnt clauses database, MiniSAT solver, Pareto optimality

CLC Number: