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

鸽子洞原理的最短DRAT证明

Towards the shortest DRAT proof of the Pigeonhole Principle

Isaac Grosof, Naifeng Zhang, Marijn J. H. Heule

摘要:

鸽子洞原理(PHP)在自动推理中得到了大量的研究,无论是理论上还是实践上。大多数求解器具有指数运行时间和证明长度,而一些专门的技术实现多项式运行时间和证明长度。几十年前,Cook人工构造了$O(n^4)$扩展分辨率证明,其中$n$表示鸽子的数量。现有的自动化技术仅在大型$n$的类似证明系统中超过Cook的证明。我们构造了已知最短的证明PHP在现代SAT解决,DRAT的标准证明格式。使用辅助变量,并通过递归地分解成较小的大小的原始程序,我们手动获得的证明长度$O(n^3)$和领先的系数$5/2$。

英文摘要:

The Pigeonhole Principle (PHP) has been heavily studied in automated reasoning, both theoretically and in practice. Most solvers have exponential runtime and proof length, while some specialized techniques achieve polynomial runtime and proof length. Several decades ago, Cook manually constructed $O(n^4)$ extended resolution proofs, where $n$ denotes the number of pigeons.Existing automated techniques only surpass Cook's proofs in similar proof systems for large $n$. We construct the shortest known proofs of PHP in the standard proof format of modern SAT solving, DRAT. Using auxiliary variables and by recursively decomposing the original program into smaller sizes, we manually obtain proofs having length $O(n^3)$ and leading coefficient $5/2$.

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

↑