Learning to Prove Theorems by Learning to Generate Theorems

被引:0
|
作者
Wang, Mingzhe [1 ]
Deng, Jia [1 ]
机构
[1] Princeton Univ, Princeton, NJ 08544 USA
来源
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020 | 2020年 / 33卷
基金
美国国家科学基金会;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We consider the task of automated theorem proving, a key AI task. Deep learning has shown promise for training theorem provers, but there are limited human-written theorems and proofs available for supervised learning. To address this limitation, we propose to learn a neural generator that automatically synthesizes theorems and proofs for the purpose of training a theorem prover. Experiments on real-world tasks demonstrate that synthetic data from our approach improves the theorem prover and advances the state of the art of automated theorem proving in Metamath. Code is available at https://github.com/princeton-vl/MetaGen.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] 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,
  • [2] Learning to Prove Theorems via Interacting with Proof Assistants
    Yang, Kaiyu
    Deng, Jia
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [3] LEARNING THEOREMS
    Mycielski, Jan
    REAL ANALYSIS EXCHANGE, 2010, 36 (02) : 361 - 372
  • [4] When to prove theorems by analogy?
    Lect Notes Artif Intell, (259):
  • [5] 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
  • [6] How to prove inductive theorems?: QUODLIBET!
    Avenhaus, J
    Kühler, U
    Schmidt-Samoa, T
    Wirth, CP
    AUTOMATED DEDUCTION - CADE-19, PROCEEDINGS, 2003, 2741 : 328 - 333
  • [7] LIMIT THEOREMS FOR ADDITIVE LEARNING MODELS
    NORMAN, MF
    JOURNAL OF MATHEMATICAL PSYCHOLOGY, 1970, 7 (01) : 1 - 11
  • [8] CONVERGENCE THEOREMS FOR HYBRID LEARNING RULES
    BENAIM, M
    NEURAL COMPUTATION, 1995, 7 (01) : 19 - 24
  • [9] Learning to Find Proofs and Theorems by Learning to Refine Search Strategies
    Laurent, Jonathan
    Platzer, Andre
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35, NEURIPS 2022, 2022,
  • [10] The no-free-lunch theorems of supervised learning
    Sterkenburg, Tom F.
    Grunwald, Peter D.
    SYNTHESE, 2021, 199 (3-4) : 9979 - 10015