Proving Theorems using Incremental Learning and Hindsight Experience Replay

by   Eser Aygün, et al.

Traditional automated theorem provers for first-order logic depend on speed-optimized search and many handcrafted heuristics that are designed to work best over a wide range of domains. Machine learning approaches in literature either depend on these traditional provers to bootstrap themselves or fall short on reaching comparable performance. In this paper, we propose a general incremental learning algorithm for training domain specific provers for first-order logic without equality, based only on a basic given-clause algorithm, but using a learned clause-scoring function. Clauses are represented as graphs and presented to transformer networks with spectral features. To address the sparsity and the initial lack of training data as well as the lack of a natural curriculum, we adapt hindsight experience replay to theorem proving, so as to be able to learn even when no proof can be found. We show that provers trained this way can match and sometimes surpass state-of-the-art traditional provers on the TPTP dataset in terms of both quantity and quality of the proofs.



There are no comments yet.


page 1

page 2

page 3

page 4


Learning to Reason

Automated theorem proving has long been a key task of artificial intelli...

Training a First-Order Theorem Prover from Synthetic Data

A major challenge in applying machine learning to automated theorem prov...

Deriving Theorems in Implicational Linear Logic, Declaratively

The problem we want to solve is how to generate all theorems of a given ...

Towards Finding Longer Proofs

We present a reinforcement learning (RL) based guidance system for autom...

HolStep: A Machine Learning Dataset for Higher-order Logic Theorem Proving

Large computer-understandable proofs consist of millions of intermediate...

Adversarial Learning to Reason in an Arbitrary Logic

Existing approaches to learning to prove theorems focus on particular lo...

Learning to Prove from Synthetic Theorems

A major challenge in applying machine learning to automated theorem prov...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.