arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.05266cs.LO
收藏

循环(且可靠)的证明

Circular (Yet Sound) Proofs

Albert Atserias, Massimo Lauria

AI总结:

本文提出允许有环的“循环证明”并证明其可靠性,发现循环归结比有向无环图状归结更强大且等价于Sherali-Adams,同时证明Frege系统中循环证明可转为树状证明且仅含多项式级开销。

摘要:

命题逻辑中的证明通常被表示为派生公式的树,或者作为替代,被表示为派生公式的有向无环图。当进行例如证明大小的定量考量时,树状与有向无环图状结构之间的区别尤为重要。在此,我们分析了基于规则的证明系统中一种更一般的结构限制类型。在这个定义中,证明是派生公式的有向图,其中允许存在环,只要每个公式被派生的次数至少与它作为前提被需要的次数一样多。我们将此类证明称为“循环证明”。我们证明,对于所有具有单一或多个结论的标准推理规则集,循环证明是可靠的。我们从循环归结(即归结的循环版本)开始研究循环证明的证明复杂性。我们立刻发现循环归结比有向无环图状归结更强大,因为正如我们所展示的,鸽巢原理的命题编码具有多项式大小的循环归结证明。此外,对于从子句派生子句的推导,我们令人惊讶地表明,循环归结等价于Sherali-Adams,这是一个以线性规划为基础、通过多项式不等式进行推理的证明系统。作为推论,我们得到:1)寻找常数宽度的循环归结证明的多项式时间(基于LP的)算法;2)将循环归结与有向无环图状归结区分开的例子,如鸽巢原理及其变体;3)循环归结的指数级困难情况。与循环归结的情况相反,对于Frege,我们表明循环证明可以转换为树状证明,且最多只有多项式级的额外开销。

英文摘要:

Proofs in propositional logic are typically presented as trees of derived formulas or, alternatively, as directed acyclic graphs of derived formulas. This distinction between tree-like vs. dag-like structure is particularly relevant when making quantitative considerations regarding, for example, proof size. Here we analyze a more general type of structural restriction for proofs in rule-based proof systems. In this definition, proofs are directed graphs of derived formulas in which cycles are allowed as long as every formula is derived at least as many times as it is required as a premise. We call such proofs "circular". We show that, for all sets of standard inference rules with single or multiple conclusions, circular proofs are sound. We start the study of the proof complexity of circular proofs at Circular Resolution, the circular version of Resolution. We immediately see that Circular Resolution is stronger than Dag-like Resolution since, as we show, the propositional encoding of the pigeonhole principle has circular Resolution proofs of polynomial size. Furthermore, for derivations of clauses from clauses, we show that Circular Resolution is, surprisingly, equivalent to Sherali-Adams, a proof system for reasoning through polynomial inequalities that has linear programming at its base. As corollaries we get: 1) polynomial-time (LP-based) algorithms that find Circular Resolution proofs of constant width, 2) examples that separate Circular from Dag-like Resolution, such as the pigeonhole principle and its variants, and 3) exponentially hard cases for Circular Resolution. Contrary to the case of Circular Resolution, for Frege we show that circular proofs can be converted into tree-like proofs with at most polynomial overhead.

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

↑