arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.04135cs.LOcs.CC
收藏

基于有序决策策略的CDCL证明系统

On CDCL-based proof systems with the ordered decision strategy

Nathan Mull, Shuo Pang, Alexander Razborov

摘要:

我们证明了冲突驱动的子句学习SAT求解器与有序决策策略和决策学习计划是等价的有序决议。我们还证明了,通过替换这个学习计划与其相反,停止后的第一个新的条款回溯时,他们成为等同于一般决议。据我们所知,这是第一次从理论上研究特定决策策略和小句学习之间的相互作用。对于这两个结果,我们允许非确定性的求解器的能力,执行单位传播,冲突分析,并重新启动,在某种程度上,是类似于以前的作品在文献中。为了帮助介绍我们的结果,并可能在未来的研究,我们定义了一个模型和语言来讨论基于CDCL的证明系统,允许简洁和精确的定理语句。

英文摘要:

We prove that conflict-driven clause learning SAT-solvers with the ordered decision strategy and the DECISION learning scheme are equivalent to ordered resolution. We also prove that, by replacing this learning scheme with its opposite that stops after the first new clause when backtracking, they become equivalent to general resolution. To the best of our knowledge, this is the first theoretical study of the interplay between specific decision strategies and clause learning. For both results, we allow nondeterminism in the solver's ability to perform unit propagation, conflict analysis, and restarts, in a way that is similar to previous works in the literature. To aid the presentation of our results, and possibly future research, we define a model and language for discussing CDCL-based proof systems that allows for succinct and precise theorem statements.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑