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 条
  • [1] Learning to Prove Theorems by Learning to Generate Theorems
    Wang, Mingzhe
    Deng, Jia
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [2] Automated Theorem Proving via Interacting with Proof Assistants by Dynamic Strategies
    Mo, Guangshuai
    Xiong, Yan
    Huang, Wenchao
    Ma, Lu
    2020 6TH INTERNATIONAL CONFERENCE ON BIG DATA COMPUTING AND COMMUNICATIONS (BIGCOM 2020), 2020, : 71 - 75
  • [3] Automatically Proving Mathematical Theorems with Evolutionary Algorithms and Proof Assistants
    Yang, Li-An
    Liu, Jui-Pin
    Chen, Chao-Hong
    Chen, Ying-ping
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 4421 - 4428
  • [4] TacticZero: Learning to Prove Theorems from Scratch with Deep Reinforcement Learning
    Wu, Minchao
    Norrish, Michael
    Walder, Christian
    Dezfouli, Amir
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021,
  • [5] Exact learning via teaching assistants
    Arvind, V
    Vinodchandran, NV
    THEORETICAL COMPUTER SCIENCE, 2000, 241 (1-2) : 51 - 81
  • [6] How to Prove the Maxwell Conjecture Via Spatial Coupling - A Proof of Concept
    Giurgiu, Andrei
    Macris, Nicolas
    Urbanke, Rudiger
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012, : 458 - 462
  • [7] When to prove theorems by analogy?
    Lect Notes Artif Intell, (259):
  • [8] Learning how to Prove: From the Coq Proof Assistant to Textbook Style
    Boehne, Sebastian
    Kreitz, Christoph
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2018, (267): : 1 - 18
  • [9] PROOF OF LEVIKHINCHIN FORMULAS VIA BOCHNER AND KREINMILMAN THEOREMS
    VANDEV, DL
    DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1978, 31 (04): : 385 - 387
  • [10] Is it Easier to Prove Theorems that are Guaranteed to be True?
    Pass, Rafael
    Venkitasubramaniam, Muthuramakrishnan
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 1255 - 1267