Proof Simplification and Automated Theorem Proving

08/09/2018
by   Michael Kinyon, et al.
0

The proofs first generated by automated theorem provers are far from optimal by any measure of simplicity. In this paper I describe a technique for simplifying automated proofs. Hopefully this discussion will stimulate interest in the larger, still open, question of what reasonable measures of proof simplicity might be.

READ FULL TEXT
research
02/03/2019

Automated ZFC Theorem Proving with E

I introduce an approach for automated reasoning in first order set theor...
research
09/07/2020

Generative Language Modeling for Automated Theorem Proving

We explore the application of transformer-based language models to autom...
research
08/26/2019

Converting ALC Connection Proofs into ALC Sequents

The connection method has earned good reputation in the area of automate...
research
05/30/2019

Towards Finding Longer Proofs

We present a reinforcement learning (RL) based guidance system for autom...
research
01/13/2020

Interactive Visualization of Saturation Attempts in Vampire

Many applications of formal methods require automated reasoning about sy...
research
05/23/2022

HyperTree Proof Search for Neural Theorem Proving

We propose an online training procedure for a transformer-based automate...
research
07/07/2020

An Embellished Account of Agafonov's Proof of Agafonov's Theorem

We give an account of Agafonov's original proof of his eponymous theorem...

Please sign up or login with your details

Forgot password? Click here to reset