Hypertree proof search for neural theorem proving
We propose an online training procedure for a transformer-based automated theorem
prover. Our approach leverages a new search algorithm, HyperTree Proof Search (HTPS) …
prover. Our approach leverages a new search algorithm, HyperTree Proof Search (HTPS) …
Machine learning and information theory concepts towards an AI Mathematician
The current state of the art in artificial intelligence is impressive, especially in terms of
mastery of language, but not so much in terms of mathematical reasoning. What could be …
mastery of language, but not so much in terms of mathematical reasoning. What could be …
Learning to find proofs and theorems by learning to refine search strategies: The case of loop invariant synthesis
J Laurent, A Platzer - Advances in Neural Information …, 2022 - proceedings.neurips.cc
We propose a new approach to automated theorem proving where an AlphaZero-style agent
is self-training to refine a generic high-level expert strategy expressed as a nondeterministic …
is self-training to refine a generic high-level expert strategy expressed as a nondeterministic …
Towards tractable mathematical reasoning: Challenges, strategies, and opportunities for solving math word problems
Mathematical reasoning would be one of the next frontiers for artificial intelligence to make
significant progress. The ongoing surge to solve math word problems (MWPs) and hence …
significant progress. The ongoing surge to solve math word problems (MWPs) and hence …
Proving theorems using incremental learning and hindsight experience replay
Traditional automated theorem proving systems for first-order logic depend on speed-
optimized search and many handcrafted heuristics designed to work over a wide range of …
optimized search and many handcrafted heuristics designed to work over a wide range of …
Learning to guide a saturation-based theorem prover
Traditional automated theorem provers have relied on manually tuned heuristics to guide
how they perform proof search. Recently, however, there has been a surge of interest in the …
how they perform proof search. Recently, however, there has been a surge of interest in the …
Towards finding longer proofs
We present a reinforcement learning (RL) based guidance system for automated theorem
proving geared towards Finding Longer Proofs (FLoP). Unlike most learning based …
proving geared towards Finding Longer Proofs (FLoP). Unlike most learning based …
A Survey on Deep Learning for Theorem Proving
Theorem proving is a fundamental aspect of mathematics, spanning from informal reasoning
in mathematical language to rigorous derivations in formal systems. In recent years, the …
in mathematical language to rigorous derivations in formal systems. In recent years, the …
An empirical assessment of progress in automated theorem proving
An Empirical Assessment of Progress in Automated Theorem Proving | SpringerLink Skip to
main content Advertisement SpringerLink Account Menu Find a journal Publish with us Track …
main content Advertisement SpringerLink Account Menu Find a journal Publish with us Track …
The role of entropy in guiding a connection prover
In this work we study how to learn good algorithms for selecting reasoning steps in theorem
proving. We explore this in the connection tableau calculus implemented by leanCoP where …
proving. We explore this in the connection tableau calculus implemented by leanCoP where …