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

集合阻塞子句证明的下界

Lower bounds for set-blocked clauses proofs

Emre Yolcu

AI总结:

本文研究 BC${}^-$、RAT${}^-$、SBC${}^-$、GER${}^-$ 等无新变量扩展归结系统,通过鸽巢原理二进制编码的指数下界证明 SBC${}^-$ 严格弱于 ER,并确立其与 RAT${}^-$、GER${}^-$ 的指数分离。

摘要:

我们研究具有推理规则的命题证明系统,这些推理规则形式化了作出“不失一般性”成立的假设这一能力的受限版本;该能力通常被非形式地用于缩短证明。我们研究的每个系统都建立在归结(resolution)之上。它们被称为 BC${}^-$、RAT${}^-$、SBC${}^-$ 和 GER${}^-$,分别表示阻塞子句、归结非对称重言式、集合阻塞子句和广义扩展归结——全部“不使用新变量”。它们可以被视为扩展归结(ER)的弱版本,因为它们的定义方式是:首先推广扩展规则,然后去掉引入新变量的能力。除 SBC${}^-$ 外,已知它们严格位于归结与扩展归结之间。此前,人们利用它们能够有效模拟 ER 这一事实,证明了这些系统之间的若干分离结果。我们回答了遗留的开放问题:我们证明了鸽巢原理的一种二进制编码的 SBC${}^-$ 证明具有指数下界,从而将 ER 与 SBC${}^-$ 分离开来。利用这一新的分离,我们证明 RAT${}^-$ 和 GER${}^-$ 都与 SBC${}^-$ 存在指数级分离。这补全了它们相对强弱关系的图景。

英文摘要:

We study propositional proof systems with inference rules that formalize restricted versions of the ability to make assumptions that hold without loss of generality, commonly used informally to shorten proofs. Each system we study is built on resolution. They are called BC${}^-$, RAT${}^-$, SBC${}^-$, and GER${}^-$, denoting respectively blocked clauses, resolution asymmetric tautologies, set-blocked clauses, and generalized extended resolution - all "without new variables." They may be viewed as weak versions of extended resolution (ER) since they are defined by first generalizing the extension rule and then taking away the ability to introduce new variables. Except for SBC${}^-$, they are known to be strictly between resolution and extended resolution. Several separations between these systems were proved earlier by exploiting the fact that they effectively simulate ER. We answer the questions left open: We prove exponential lower bounds for SBC${}^-$ proofs of a binary encoding of the pigeonhole principle, which separates ER from SBC${}^-$. Using this new separation, we prove that both RAT${}^-$ and GER${}^-$ are exponentially separated from SBC${}^-$. This completes the picture of their relative strengths.

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

↑