Proof verification and proof discovery for relativity

被引:9
|
作者
Govindarajalulu, Naveen Sundar [1 ,2 ]
Bringsjord, Selmer [1 ,2 ]
Taylor, Joshua [1 ,2 ]
机构
[1] Rensselaer Polytech Inst, Dept Comp Sci, Rensselaer AI & Reasoning RAIR Lab, Troy, NY 12180 USA
[2] Rensselaer Polytech Inst, Dept Cognit Sci, Troy, NY 12180 USA
关键词
Proof verification; Logic and relativity; Automated physics; Theorem proving in physics; Axiomatizations in physics;
D O I
10.1007/s11229-014-0424-3
中图分类号
N09 [自然科学史]; B [哲学、宗教];
学科分类号
01 ; 0101 ; 010108 ; 060207 ; 060305 ; 0712 ;
摘要
The vision of machines autonomously carrying out substantive conjecture generation, theorem discovery, proof discovery, and proof verification in mathematics and the natural sciences has a long history that reaches back before the development of automatic systems designed for such processes. While there has been considerable progress in proof verification in the formal sciences, for instance the Mizar project' and the four-color theorem, now machine verified, there has been scant such work carried out in the realm of the natural sciences-until recently. The delay in the case of the natural sciences can be attributed to both a lack of formal analysis of the so-called "theories" in such sciences, and the lack of sufficient progress in automated theorem proving. While the lack of analysis is probably due to an inclination toward informality and empiricism on the part of nearly all of the relevant scientists, the lack of progress is to be expected, given the computational hardness of automated theorem proving; after all, theoremhood in even first-order logic is Turing-undecidable. We give in the present short paper a compressed report on our building upon these formal theories using logic-based AI in order to achieve, in relativity, both machine proof discovery and proof verification, for theorems previously established by humans. Our report is intended to serve as a springboard to machine-produced results in the future that have not been obtained by humans.
引用
收藏
页码:2077 / 2094
页数:18
相关论文
共 50 条
  • [31] PROOF OF THE POSITIVE MASS CONJECTURE IN GENERAL-RELATIVITY
    SCHOEN, R
    YAU, ST
    COMMUNICATIONS IN MATHEMATICAL PHYSICS, 1979, 65 (01) : 45 - 76
  • [32] TOWARDS A SINGULARITY-PROOF SCHEME IN NUMERICAL RELATIVITY
    SEIDEL, E
    SUEN, WM
    PHYSICAL REVIEW LETTERS, 1992, 69 (13) : 1845 - 1848
  • [33] PROOF OF THE POSITIVE-ACTION CONJECTURE IN QUANTUM RELATIVITY
    SCHOEN, RM
    YAU, ST
    PHYSICAL REVIEW LETTERS, 1979, 42 (09) : 547 - 548
  • [34] Small Steps toward Hypercomputation via Infinitary Machine Proof Verification and Proof Generation
    Govindarajulu, Naveen Sundar
    Licato, John
    Bringsjord, Selmer
    UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION, 2013, 7956 : 102 - 112
  • [35] Selene: Pioneering Automated Proof in Software Verification
    Zhang, Lichen
    Lu, Shuai
    Duan, Nan
    PROCEEDINGS OF THE 62ND ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, VOL 1: LONG PAPERS, 2024, : 1776 - 1789
  • [36] A scheduling strategy for parallel proof checking and verification
    He Pei
    Kang Lishan
    Xiao Zengliang
    Xiao Zhuoyu
    PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL, VOLS 1 AND 2, 2008, : 1823 - +
  • [37] Verification of Proof Steps for Tutoring Mathematical Proofs
    Dietrich, Dominik
    Buckley, Mark
    ARTIFICIAL INTELLIGENCE IN EDUCATION: BUILDING TECHNOLOGY RICH LEARNING CONTEXTS THAT WORK, 2007, 158 : 560 - +
  • [38] Lectures on proof verification and approximation algorithms - Introduction
    LECTURES ON PROOF VERIFICATION AND APPROXIMATION ALGORITHMS, 1998, 1367 : 1 - +
  • [39] A PROOF SYSTEM FOR GRAPH (NON)-ISOMORPHISM VERIFICATION
    Banković M.
    Drecun I.
    Marić F.
    Logical Methods in Computer Science, 2023, 19 (01):
  • [40] Appendix: Conjectures concerning proof, design, and verification
    Wos, L
    THEOREM PROVING IN HIGHER ORDER LOGICS, PROCEEDINGS, 2000, 1869 : 526 - 533