Monte Carlo Connection Prover

11/18/2016
by   Michael Färber, et al.
0

Monte Carlo Tree Search (MCTS) is a technique to guide search in a large decision space by taking random samples and evaluating their outcome. In this work, we study MCTS methods in the context of the connection calculus and implement them on top of the leanCoP prover. This includes proposing useful proof-state evaluation heuristics that are learned from previous proofs, and proposing and automatically improving suitable MCTS strategies in this context. The system is trained and evaluated on a large suite of related problems coming from the Mizar proof assistant, showing that it is capable to find new and different proofs. To our knowledge, this is the first time MCTS has been applied to theorem proving.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2018

Machine Learning Guidance and Proof Certification for Connection Tableau

Connection calculi allow for very compact implementations of goal-direct...
research
05/19/2018

Reinforcement Learning of Theorem Proving

We introduce a theorem proving algorithm that uses practically no domain...
research
05/08/2018

Machine Learning Guidance and Proof Certification for Connection Tableaux

Connection calculi allow for very compact implementations of goal-direct...
research
02/12/2018

ProofWatch: Watchlist Guidance for Large Theories in E

Watchlist (also hint list) is a mechanism that allows related proofs to ...
research
04/02/2018

Learning to Prove with Tactics

We implement a automated tactical prover TacticToe on top of the HOL4 in...
research
05/31/2021

The Role of Entropy in Guiding a Connection Prover

In this work we study how to learn good algorithms for selecting reasoni...
research
04/15/2020

Prolog Technology Reinforcement Learning Prover

We present a reinforcement learning toolkit for experiments with guiding...

Please sign up or login with your details

Forgot password? Click here to reset