Rango proves 32.0% of Coq theorems in a large benchmark by retrieving relevant in-project proofs and lemmas at each step, outperforming prior proof synthesis tools.
TacticZero: Learning to Prove Theorems from Scratch with Deep Reinforcement Learning
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We propose a novel approach to interactive theorem-proving (ITP) using deep reinforcement learning. The proposed framework is able to learn proof search strategies as well as tactic and arguments prediction in an end-to-end manner. We formulate the process of ITP as a Markov decision process (MDP) in which each state represents a set of potential derivation paths. This structure allows us to introduce a novel backtracking mechanism which enables the agent to efficiently discard (predicted) dead-end derivations and restart from promising alternatives. We implement the framework in the HOL4 theorem prover. Experimental results show that the framework outperforms existing automated theorem provers (i.e., hammers) available in HOL4 when evaluated on unseen problems. We further elaborate the role of key components of the framework using ablation studies.
citation-role summary
citation-polarity summary
fields
cs.SE 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Rango: Adaptive Retrieval-Augmented Proving for Automated Software Verification
Rango proves 32.0% of Coq theorems in a large benchmark by retrieving relevant in-project proofs and lemmas at each step, outperforming prior proof synthesis tools.