paper-with-me

Papers

Learning to Prove Theorems via Interacting with Proof Assistants

2019-05-21 · Kaiyu Yang, Jia Deng

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/princeton-vl/CoqGym.

📄 PDF Abstract BibTeX arXiv:1905.09381

Code (1)

princeton-vl/CoqGym 공식 구현 pytorch

Tasks

Automated Theorem ProvingMathematical ProofsMathematical Reasoning

Similar Papers 제목 키워드 기반

Automatically Proving Mathematical Theorems with Evolutionary Algorithms and Proof Assistants

2016-02-24 · Li-An Yang, Jui-Pin Liu, Chao-Hong Chen, Ying-ping Chen

Mathematical theorems are human knowledge able to be accumulated in the form of symbolic representation, and proving theorems has been considered intelligent behavior. Based on the BHK interpretation and the Curry-Howard…

Evolutionary AlgorithmsSentence

Generating Millions Of Lean Theorems With Proofs By Exploring State Transition Graphs

2025-02-16 · David Yin, Jing Gao

Large Language Models (LLMs) have demonstrated significant potential in generating mathematical proofs. However, a persistent challenge is that LLMs occasionally make mistakes, while even a minor mistake can invalidate a…

Automated Theorem ProvingMathematical Proofs

Rango: Adaptive Retrieval-Augmented Proving for Automated Software Verification

2024-12-18 · Kyle Thompson, Nuno Saavedra, Pedro Carrott, Kevin Fisher 외

Formal verification using proof assistants, such as Coq, enables the creation of high-quality software. However, the verification process requires significant expertise and manual effort to write proofs. Recent work has …

Retrieval

Baldur: Whole-Proof Generation and Repair with Large Language Models

2023-03-08 · Emily First, Markus N. Rabe, Talia Ringer, Yuriy Brun

Formally verifying software properties is a highly desirable but labor-intensive task. Recent work has developed methods to automate formal verification using proof assistants, such as Coq and Isabelle/HOL, e.g., by trai…

ImProver: Agent-Based Automated Proof Optimization

2024-10-07 · Riyaz Ahuja, Jeremy Avigad, Prasad Tetali, Sean Welleck

Large language models (LLMs) have been used to generate formal proofs of mathematical theorems in proofs assistants such as Lean. However, we often want to optimize a formal proof with respect to various criteria, depend…

Language ModellingLarge Language Model