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

自动定理证明辅助的子句集模式分析:案例研究[扩展论文]

Analysis of Clause set Schema Aided by Automated Theorem Proving: A Case Study [Extended Paper]

David Cerna, Alexander Leitsch

摘要:

CERES方法[8]是最近发展起来的一种用于证明模式的割消方法,证明模式是具有递归构造的证明序列。证明模式可以被认为是一种规避向LK演算添加归纳规则的方法。在这项工作中,我们在LKS演算[8]中形式化了无限鸽子洞原理的示意版本,我们称之为非内射断言模式(NiA-模式),并使用示意CERES方法提供的一些结构来分析从NiA-模式中提取的子句集模式。据我们所知,这是第一次appli-阳离子的构造建立证明分析的证明图式的数学论点,因为它的出版。我们讨论了自动定理证明(ATP)的作用,在示意性的证明分析,以及有关的形式化的NiA模式,即,示意性的分辨率演算的表达能力的示意CERES方法的缺点。最后,我们讨论了ATP在原理图证明分析中的使用。

英文摘要:

The schematic CERES method [8] is a recently developed method of cut elimination for proof schemata, that is a sequence of proofs with a recursive construction. Proof schemata can be thought of as a way to circumvent adding an induction rule to the LK-calculus. In this work, we formalize a schematic version of the infinitary pigeonhole principle, which we call the Non-injectivity Assertion schema (NiA-schema), in the LKS-calculus [8], and analyse the clause set schema extracted from the NiA-schema using some of the structure provided by the schematic CERES method. To the best of our knowledge, this is the first appli- cation of the constructs built for proof analysis of proof schemata to a mathematical argument since its publication. We discuss the role of Automated Theorem Proving (ATP) in schematic proof analysis, as well as the shortcomings of the schematic CERES method concerning the formalization of the NiA-schema, namely, the expressive power of the schematic resolution calculus. We conclude with a discussion concerning the usage of ATP in schematic proof analysis.

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

↑