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 条
  • [41] Proof Score Approach to Verification of Liveness Properties
    Ogata, Kazuhiro
    Futatsugi, Kokichi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2008, E91D (12): : 2804 - 2817
  • [42] EXPERIMENTAL VERIFICATION OF PROOF-TEST LOGIC
    COLLIPRI.JE
    KIZER, DE
    METALS ENGINEERING QUARTERLY, 1969, 9 (04): : 43 - &
  • [43] The value of verification: Positive experience of industrial proof
    King, S
    Hammond, J
    Chapman, R
    Pryor, A
    FM'99-FORMAL METHODS, VOL II, 1999, 1709 : 1527 - 1545
  • [44] Dominator trees and fast verification of proof nets
    Murawski, AS
    Ong, CHL
    15TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2000, : 181 - 191
  • [45] Preservation of proof obligations for hybrid verification methods
    Barthe, Gilles
    Kunz, Cesar
    Pichardie, David
    Samborski-Forlese, Julian
    SEFM 2008: SIXTH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND FORMAL METHODS, PROCEEDINGS, 2008, : 127 - 136
  • [46] Theorem proving and proof verification in the system SAD
    Lyaletski, A
    Paskevich, A
    Verchinine, K
    MATHEMATICAL KNOWLEDGE MANAGEMENT, PROCEEDINGS, 2004, 3119 : 236 - 250
  • [47] AN IMPERSONATION-PROOF IDENTITY VERIFICATION SCHEME
    SIMMONS, GJ
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 293 : 211 - 215
  • [48] A PROOF SYSTEM FOR GRAPH (NON)-ISOMORPHISM VERIFICATION
    Bankovic, Milan
    Drecun, Ivan
    Maric, Filip
    LOGICAL METHODS IN COMPUTER SCIENCE, 2021, 19 (01)
  • [49] A DAA Scheme Using Batch Proof and Verification
    Chen, Liqun
    TRUST AND TRUSTWORTHY COMPUTING, PROCEEDINGS, 2010, 6101 : 166 - 180
  • [50] Relativity without light: A new proof of Ignatowski's theorem
    Anker, Jean-Philippe
    Ziegler, Francois
    JOURNAL OF GEOMETRY AND PHYSICS, 2020, 158