Lemmas: Generation, Selection, Application

03/10/2023
by   Michael Rawson, et al.
0

Noting that lemmas are a key feature of mathematics, we engage in an investigation of the role of lemmas in automated theorem proving. The paper describes experiments with a combined system involving learning technology that generates useful lemmas for automated theorem provers, demonstrating improvement for several representative systems and solving a hard problem not solved by any system for twenty years. By focusing on condensed detachment problems we simplify the setting considerably, allowing us to get at the essence of lemmas and their role in proof search.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2012

Theorem Proving in Large Formal Mathematics as an Emerging AI Field

In the recent years, we have linked a large corpus of formal mathematics...
research
06/14/2016

DeepMath - Deep Sequence Models for Premise Selection

We study the effectiveness of neural sequence models for premise selecti...
research
03/05/2018

Prototyping "Systems that Explain Themselves" for Education

"Systems that Explain Themselves" appears a provocative wording, in part...
research
08/09/2013

MaLeS: A Framework for Automatic Tuning of Automated Theorem Provers

MaLeS is an automatic tuning framework for automated theorem provers. It...
research
06/01/2023

Axioms vs. rewrite rules: from completeness to cut elimination

Combining a standard proof search method, such as resolution or tableaux...
research
11/15/2019

Smarter Features, Simpler Learning?

Earlier work on machine learning for automated reasoning mostly relied o...
research
04/01/2019

Towards Intuitive Reasoning in Axiomatic Geometry

Proving lemmas in synthetic geometry is often a time-consuming endeavour...

Please sign up or login with your details

Forgot password? Click here to reset