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 条
  • [21] Simultaneous identity verification and membership proof
    Ren, J
    Erfani, S
    2002 45TH MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL III, CONFERENCE PROCEEDINGS, 2002, : 696 - 699
  • [22] Proof verification and the hardness of approximation problems
    Princeton Univ, Princeton, United States
    J ACM, 3 (501-555):
  • [23] Proof verification and the hardness of approximation problems
    Arora, S
    Lund, C
    Motwani, R
    Sudan, M
    Szegedy, M
    JOURNAL OF THE ACM, 1998, 45 (03) : 501 - 555
  • [24] Proof reuse for deductive program verification
    Beckert, B
    Klebanov, V
    PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND FORMAL METHODS, 2004, : 77 - 86
  • [25] A Proof Slicing Framework for Program Verification
    Le, Ton Chanh
    Gherghina, Cristian
    Voicu, Razvan
    Chin, Wei-Ngan
    FORMAL METHODS AND SOFTWARE ENGINEERING, 2013, 8144 : 53 - 69
  • [26] Flexible proof reuse for software verification
    Hunter, C
    Robinson, P
    Strooper, P
    ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY: PROCEEDINGS, 2004, 3116 : 211 - 225
  • [27] Computer-assisted discovery and proof
    Bailey, David H.
    Borwein, Jonathan M.
    TAPAS IN EXPERIMENTAL MATHEMATICS, 2008, 457 : 21 - +
  • [28] PROBABILITY AND THE PROCESSES OF DISCOVERY, PROOF, AND CHOICE
    SCHUM, DA
    BOSTON UNIVERSITY LAW REVIEW, 1986, 66 (3-4) : 825 - 876
  • [29] Milk biloactives: discovery and proof of concept
    Rowan, AM
    Haggarty, NW
    Ram, S
    AUSTRALIAN JOURNAL OF DAIRY TECHNOLOGY, 2005, 60 (02) : 114 - 120
  • [30] An illustration of the explanatory and discovery functions of proof
    de Villiers, Michael
    PYTHAGORAS, 2012, 33 (03)