证明门与CDCL求解器的效率
Proofdoors and Efficiency of CDCL Solvers
AI总结:
本文提出证明门参数,用于解释CDCL求解器在电路验证中的效率,证明具有小证明门的公式有短的分辨率证明,并展示某些CDCL求解器能高效生成此类证明。
摘要:
我们提出一个名为证明门的新参数,试图解释CDCL SAT求解器在电路(特别是算术验证)应用中公式的效率。非正式地说,给定一个在n个变量上的不可满足的CNF公式F,证明门分解由将子句分块为A1,…,Ak以及连接这些块的插值物序列组成。直观上,证明门捕捉到不可满足公式可以通过分块推理来反驳,同时仅维护到目前为止获得的信息摘要(即插值物)以供后续推理步骤使用。我们证明了几个定理,支持证明门可以解释CDCL求解器在某些电路验证问题中的效率。首先,我们证明具有小证明门(即每个插值物大小为O(n),每个块Ai路径宽度小,每个插值物子句对前一个插值物的逆向依赖最多O(log(n)))的公式有短的分辨率(Res)证明。其次,我们证明某些CDCL求解器配置可以在多项式时间内计算此类证明。第三,我们证明浮点数加法的交换性(miter)公式具有小证明门和短Res证明,尽管它们具有大的路径宽度。第四,我们通过将证明门与部分有序分辨率证明系统联系起来,确定了证明门框架的局限性:我们证明了糟糕的算术miter实例分解会迫使部分有序分辨率证明指数级增长,即使不同的分解(即小证明门)允许短证明。
英文摘要:
We propose a new parameter called proofdoor in an attempt to explain the efficiency of CDCL SAT solvers over a certain class of formulas derived from circuit (esp., arithmetic) verification applications. Informally, given an unsatisfiable CNF formula F over n variables, a proofdoor decomposition consists of a chunking of the clauses into A_1, ..., A_k together with a sequence of interpolants connecting these chunks. Intuitively, a proofdoor captures the idea that an unsatisfiable formula can be refuted by reasoning chunk by chunk, while maintaining only a summary of the information (i.e., interpolants) gained so far for subsequent reasoning steps. We prove several theorems in support of the proposition that proofdoors can explain the efficiency of CDCL solvers for some class of circuit verification problems. First, we show that formulas with small proofdoors (i.e., where each interpolant is O(n) sized, each chunk A_i has small pathwidth, and each interpolant clause has at most O(log n) backward dependency on the previous interpolant) have short resolution (Res) proofs, and a certain configuration of CDCL solvers can compute such proofs in time polynomial in n. Second, we show that commutativity (miter) formulas over floating-point addition have small proofdoors and hence short Res proofs, even though they have large pathwidth. Third, we identify limits of the proofdoor framework: we show that a poor decomposition of arithmetic miter instances can force exponentially large interpolants, and hence our framework derives exponentially large Res refutations from such a decomposition, even when a different decomposition (i.e., a small proofdoor) yields short proofs. As a byproduct, these interpolant lower bounds imply new lower bounds for the partially ordered resolution proof system.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。