Learning to Prove Theorems via Interacting with Proof Assistants

被引:0
|
作者
Yang, Kaiyu [1 ]
Deng, Jia [1 ]
机构
[1] Princeton Univ, Dept Comp Sci, Princeton, NJ 08544 USA
基金
美国国家科学基金会;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Humans prove theorems by relying on substantial high-level reasoning and problem-specific insights. Proof assistants offer a formalism that resembles human mathematical reasoning, representing theorems in higher-order logic and proofs as high-level tactics. However, human experts have to construct proofs manually by entering tactics into the proof assistant. In this paper, we study the problem of using machine learning to automate the interaction with proof assistants. We construct CoqGym, a large-scale dataset and learning environment containing 71K human-written proofs from 123 projects developed with the Coq proof assistant. We develop ASTactic, a deep learning-based model that generates tactics as programs in the form of abstract syntax trees (ASTs). Experiments show that ASTactic trained on CoqGym can generate effective tactics and can be used to prove new theorems not previously provable by automated methods. Code is available at https://github.com/princetcn-v1/CoqGym.
引用
收藏
页数:11
相关论文
共 50 条
  • [21] Proof Assistants for Natural Language Semantics
    Chatzikyriakidis, Stergios
    Luo, Zhaohui
    LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS: CELEBRATING 20 YEARS OF LACL (1996-2016), 2016, 10054 : 85 - 98
  • [22] Equality in Computer Proof-Assistants
    Grabowski, Adam
    Kornilowicz, Artur
    Schwarzweller, Christoph
    PROCEEDINGS OF THE 2015 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2015, 5 : 45 - 54
  • [23] Proof assistants: History, ideas and future
    H. Geuvers
    Sadhana, 2009, 34 : 3 - 25
  • [24] Prove it! Inferring Formal Proof Scripts from CafeOBJ Proof Scores
    Riesco, Adrian
    Ogata, Kazuhiro
    ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY, 2018, 27 (02)
  • [25] New pacemakers prove MRI-proof
    Ross, PE
    IEEE SPECTRUM, 2004, 41 (10) : 22 - +
  • [26] FAILING TO PROVE DANGER IS NO PROOF OF SAFETY - A REPLY
    GILBERT, ES
    PETERSEN, GR
    BUCHANAN, JA
    HEALTH PHYSICS, 1990, 59 (04): : 483 - 483
  • [27] USING (JCLR)-PROPERTY TO PROVE HYBRID FIXED POINT THEOREMS VIA QUASI F-CONTRACTIONS
    Nashine, Hemant Kumar
    Imdad, Mohammad
    Ahmadullah, Md
    TWMS JOURNAL OF PURE AND APPLIED MATHEMATICS, 2020, 11 (01): : 43 - 56
  • [28] USING REWRITING RULES FOR CONNECTION GRAPHS TO PROVE THEOREMS
    CHANG, CL
    SLAGLE, JR
    ARTIFICIAL INTELLIGENCE, 1979, 12 (02) : 159 - 178
  • [29] Using Ultrafilters to Prove Ramsey-type Theorems
    Fernandez-Breton, David J.
    AMERICAN MATHEMATICAL MONTHLY, 2022, 129 (02): : 116 - 132
  • [30] Pushing the Envelope: General Game Players Prove Theorems
    Haufe, Sebastian
    Thielscher, Michael
    AI 2010: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2010, 6464 : 1 - +