自顶向下的自动定理证明(给蒂莫西爵士的笔记)
Top-down Automated Theorem Proving (Notes for Sir Timothy)
AI总结:
本文提出一种自顶向下的自动定理证明方法,主张编码领域概念并模拟人类数学家可能出错的证明方式,以替代传统自底向上的形式化推理路径。
摘要:
我们描述一种用于自动定理证明(ATP)的“自顶向下”方法。研究人员可以有用地考察数学家在实践中使用的定理形式,仔细审视它们如何不同以及如何在实际中被证明,并对所有相关领域概念进行编码。这些概念编码了任何领域中很大一部分知识。此外,研究人员应当编写能够产生人类数学家所书写(并发表)的那类证明的程序;这意味着证明有时可能有错误;这也意味着做出有时无效的推理。这种方法旨在与历史上占主导地位的“自底向上”方法形成对比:对基本类型(通常是集合)、公理和(有效)推理规则进行编码,并从这个基础逐步构建到数学实践的定理及其未解决问题。一个重要的事实是,数学家发表在数学期刊上的实际证明看起来并不像罗素与怀特海《数学原理》(或像 Lean 这样自动化部分形式化工作的现代计算机系统)中的形式化证明。我们相信,数学实践中的某些“缺乏严谨性”是类人的,并且可以且应当被用于自动定理证明。
英文摘要:
We describe a "top down" approach for automated theorem proving (ATP). Researchers might usefully investigate the forms of the theorems mathematicians use in practice, carefully examine how they differ and are proved in practice, and code all relevant domain concepts. These concepts encode a large portion of the knowledge in any domain. Furthermore, researchers should write programs that produce proofs of the kind that human mathematicians write (and publish); this means proofs that might sometimes have mistakes; and this means making inferences that are sometimes invalid. This approach is meant to contrast with the historically dominant "bottom up" approach: coding fundamental types (typically sets), axioms and rules for (valid) inference, and building up from this foundation to the theorems of mathematical practice and to their outstanding questions. It is an important fact that the actual proofs that mathematicians publish in math journals do not look like the formalized proofs of Russell & Whitehead's Principia Mathematica (or modern computer systems like Lean that automate some of this formalization). We believe some "lack of rigor" (in mathematical practice) is human-like, and can and should be leveraged for ATP.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。