Towards Finding Longer Proofs

05/30/2019
by   Zsolt Zombori, et al.
0

We present a reinforcement learning (RL) based guidance system for automated theorem proving geared towards Finding Longer Proofs (FLoP). FLoP focuses on generalizing from short proofs to longer ones of similar structure. To achieve that, FLoP uses state-of-the-art RL approaches that were previously not applied in theorem proving. In particular, we show that curriculum learning significantly outperforms previous learning-based proof guidance on a synthetic dataset of increasingly difficult arithmetic problems.

READ FULL TEXT
research
08/09/2018

Proof Simplification and Automated Theorem Proving

The proofs first generated by automated theorem provers are far from opt...
research
04/02/2019

Hammering Mizar by Learning Clause Guidance

We describe a very large improvement of existing hammer-style proof auto...
research
09/27/2022

Structure in Theorem Proving: Analyzing and Improving the Isabelle Archive of Formal Proofs

The Isabelle Archive of Formal Proofs has grown to a significant size in...
research
05/25/2019

Learning to Reason in Large Theories without Imitation

Automated theorem proving in large theories can be learned via reinforce...
research
05/23/2022

HyperTree Proof Search for Neural Theorem Proving

We propose an online training procedure for a transformer-based automate...
research
12/20/2021

Proving Theorems using Incremental Learning and Hindsight Experience Replay

Traditional automated theorem provers for first-order logic depend on sp...
research
02/09/2018

ATPboost: Learning Premise Selection in Binary Setting with ATP Feedback

ATPboost is a system for solving sets of large-theory problems by interl...

Please sign up or login with your details

Forgot password? Click here to reset