|
Our new trail saving technique offers different tradeoffs in comparison with chronological backtracking and often yields superior performance. 与按时间顺序回溯相比，我们新的跟踪保存技术提供了不同的权衡，并且通常会产生卓越的性能。 |
|
|
Using C-bt is not a panacea however. Its application must be limited for peak effectiveness. 然而，使用C-bt并不是万能的。必须限制其应用以达到最佳效果。
|
|
|
We have performed many experiments on decision and deletion heuristics in solvers of the MapleSAT family [16,19,15,14,17,22] , which have performed very well in recent SAT solver competitions.
14. Stepan Kochemazov, Oleg Zaikin, Victor Kondratiev, and Alexander Semenov. Maplelcmdistchronobt-dl, duplicate learnts heuristic-aided solvers at the sat race 2019. Proceedings of SAT Race, pages 24–24, 2019. 15. Jia Hui Liang, Vijay Ganesh, Pascal Poupart, and Krzysztof Czarnecki. Learning rate based branching heuristic for sat solvers. In International Conference on Theory and Applications of Satisfiability Testing, pages 123–140. Springer, 2016. 16. Jia Hui Liang, Chanseok Oh, Vijay Ganesh, Krzysztof Czarnecki, and Pascal Poupart. Maple-comsps, maplecomsps lrb, maplecomsps chb. SAT Competition, page 52, 2016. 17. Alexander Nadel and Vadim Ryvchin. Chronological backtracking. In International Conference on Theory and Applications of Satisfiability Testing, pages 111–121. Springer, 2018. 19. Chanseok Oh. Improving SAT solvers by exploiting empirical characteristics of CDCL. PhD thesis, New York University, 2016. 22. Xindi Zhang and Shaowei Cai. Relaxed backtracking with rephasing. SAT COMPETITION 2020, page 15. |
|
|
‘’‘’Even if the theoretical reasons behind the practical success of SAT solvers are largely unclear, we know in practice what ingredients are needed, and how they must be incorporated in any SAT solver targeting application instances.‘’‘’ |
|
|
子句生成程序 Gilles Audemard，Laurent Simon: On the Glucose SAT Solver A CDCL-based SAT solver can be formulated as a resolution proof system.[48,11]. Consequently, the practical incarnation of modern SAT solvers can be seen as a clauses producer procedure with a deletion strategy. 译文：一个基于cdcl的SAT求解器可以被表述为一个解决证明系统。48,11.因此，现代SAT求解器的实际体现可以被视为具有删除策略的子句生成程序。 |
|
|
We address this particular problem in this paper and provide two contribu tions. First, an analytic and empirical analysis that substantiates the observations about work repetition in modern SAT solvers that use non–chronological backtracking. Second, a low–overhead technique that helps reduce work repetition in such solvers. 我们在本文中解决了这个特殊的问题，并提供了两个贡献。首先，分析和实证分析证实了使用非时间回溯的现代SAT解算器中关于工作重复的观察。其次，低开销技术有助于减少此类求解器的重复工作。 |
|
|
We briefly review the CDCL algorithm [3, 6]. We assume that the reader is familiar with notions of propositional satisfiability (propositional variable, literal, clause, unit clause, unit propagation, and so on). 我们假设读者熟悉命题可满足性的概念(命题变量、文字、子句、单位子句、单位传播等等)。CDCL算法重复以下两个操作，直到发生冲突。
We assume that the reader is familiar with notions of propositional satisfiability (propositional variable, literal, clause, unit clause, unit propagation, and so on). The CDCL algorithm repeats the following two operations until a conflict occurs.
参考文献：命题逻辑及CDCL求解器基本概念最早引用文献 3. Bayardo Jr., R.J., Schrag, R.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of the 14th National Conference on Artificial Intelligence (AAAI 1997), pp. 203–208 (1997)
6. Marques-Silva, J.P., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506–521 (1999) |
|
