通过合并消解学习CDCL的极限
Limits of CDCL Learning via Merge Resolution
AI总结:
本文研究CDCL求解器模拟消解证明的开销紧致性,证明带合并文字的标准学习方案至多引入线性开销,并构造出需要二次CDCL证明长度的公式,揭示其下界。
摘要:
在Atserias等人以及Pipatsrisawat和Darwiche于2009年独立完成的开创性工作中,他们证明了CDCL求解器能够以多项式开销模拟消解证明。然而,此前的工作并未讨论该模拟的紧致性,即这一开销需要多大。本文通过关注采用标准学习方案的CDCL求解器所生成证明的一个重要性质来研究该问题,即一个学习子句的推导过程中至少存在一次推理,其中某个文字同时出现在两个前提中(即合并文字)。具体而言,我们证明此类证明能够以至多线性开销模拟消解证明,但也存在公式使得这种开销是必要的;更准确地说,存在具有线性长度消解证明的公式,却需要二次长度的CDCL证明。
英文摘要:
In their seminal work, Atserias et al. and independently Pipatsrisawat and Darwiche in 2009 showed that CDCL solvers can simulate resolution proofs with polynomial overhead. However, previous work does not address the tightness of the simulation, i.e., the question of how large this overhead needs to be. In this paper, we address this question by focusing on an important property of proofs generated by CDCL solvers that employ standard learning schemes, namely that the derivation of a learned clause has at least one inference where a literal appears in both premises (aka, a merge literal). Specifically, we show that proofs of this kind can simulate resolution proofs with at most a linear overhead, but there also exist formulas where such overhead is necessary or, more precisely, that there exist formulas with resolution proofs of linear length that require quadratic CDCL proofs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。