SAT-Solving Based on Boundary Point Elimination
Goldberg E., Manolios P. (2011) SAT-Solving Based on Boundary Point Elimination. In: Barner S., Harris I., Kroening D., Raz O. (eds) Hardware and Software: Verification and Testing. HVC 2010. Lecture Notes in Computer Science, vol 6504. Springer, Berlin, Heidelberg
该文指出CDCL基于归结证明系统的求解器的缺点，并提出BEP-SAT求解方案。
| CDCL基于归结原理的求解器两个缺点 |
|
First,eager backtracking of a CDCL SAT-solver makes it hard to generate resolutions Second, a CDCL SAT-solver cannot efficiently perform existential quantification.译文：其次，CDCL sat求解器不能有效地执行存在性量化。 |
Abstract
| We study the problem of building structure-aware SAT-solvers based on resolution. In this study, we use the idea of treating a resolution proof as a process of Boundary Point Elimination (BPE). We identify two problems of using SAT-algorithms with Conflict Driven Clause Learning (CDCL) for structure-aware SAT-solving. We introduce a template of resolution based SAT-solvers called BPE-SAT that is based on a few generic implications of the BPE concept. BPE-SAT can be viewed as a generalization of CDCL SAT-solvers and is meant for building new structure-aware SAT-algorithms. We give experimental results substantiating the ideas of the BPE approach. In particular, to show the importance of structural information we compare an implementation of BPE-SAT and state-of-the-art SAT-solvers on narrow CNF formulas. |
Keywords
Boundary Point Equivalence Check Satisfying Assignment Partial Assignment Complete Assignment
内容较多且专业性强，建议成立小组专门研读。
附录中讲了一些很重要的概念：
|
A conflict clause is obtained by resolving clauses of F‘ in the reverse order. 译文：冲突子句是通过对F '的子句进行反向归结得到的。 |
|
CDCL SAT-Solvers are a Special Case of BPE-SAT One can make the following two conclusions based on the results of Table 5. First, the DP procedure is not competitive with CDCL SAT-solvers。Second,although both DP procedure and BPE-SAT are sensitive to the formula width,the sensitivity of the DP procedure is dramatically higher. DP程序远不如BEP-SAT好。 |
