Fetching the paper…
Reading the bibliography…
The paper describes a deep reinforcement learning framework based on self-supervised learning within the proof assistant HOL4.
Über die bausteine der mathematischen logik
Moses Schönfinkel · 1924
Earlier work this paper cites.
Enumerable sets are diophantine
J. V. MATIJASEVIC · 1970
Earlier work this paper cites.
A superposition oriented theorem prover
Laurent Fribourg · 1985
Earlier work this paper cites.
Efficient combinator code
Mike S. Joy, Victor J. Rayward-Smith, and F. Warren Burton · 1985
Earlier work this paper cites.
Definability on finite structures and the existence of one-way functions
Erich Grädel · 1994
Earlier work this paper cites.
Evolving combinators
Matthias Fuchs · 1997
Earlier work this paper cites.
Introduction to Reinforcement Learning
Richard S. Sutton and Andrew G. Barto · 1998
Earlier work this paper cites.
Efficient algorithms for generating elliptic curves over finite fields suitable for use in cryptography
Harald Baier · 2002
Earlier work this paper cites.
E - a brainiac theorem prover
Stephan Schulz · 2002
Earlier work this paper cites.
leanCoP: lean connection-based theorem proving
Jens Otten and Wolfgang Bibel · 2003
Earlier work this paper cites.
An efficient technique for synthesis and optimization of polynomials in gf(2 m )
Abusaleh M. Jabir, Dhiraj K. Pradhan, and Jimson Mathew · 2006
Earlier work this paper cites.
The on-line encyclopedia of integer sequences
Neil J. A. Sloane · 2007
Earlier work this paper cites.
A brief overview of HOL4
Konrad Slind and Michael Norrish · 2008
Earlier work this paper cites.
Satisfiability modulo theories
Clark W. Barrett, Roberto Sebastiani, Sanjit A. Seshia, and Cesare Tinelli · 2009
Earlier work this paper cites.
The TPTP problem library and associated infrastructure
Geoff Sutcliffe · 2009
Cited alongside, same era.
Nitpick: A counterexample generator for higher-order logic based on a relational model finder
Jasmin Christian Blanchette and Tobias Nipkow · 2010
Cited alongside, same era.
Number Theory: An Elementary Introduction Through Diophantine Problems
Daniel Duverney · 2010
Cited alongside, same era.
Mizar in a nutshell
Adam Grabowski, Artur Korniłowicz, and Adam Naumowicz · 2010
Cited alongside, same era.
Three years of experience with Sledgehammer, a practical link between automated and interactive theorem provers
Lawrence C. Paulson and Jasmin C. Blanchette · 2010
Cited alongside, same era.
A survey of Monte Carlo tree search methods
C. B. Browne, E. Powley, D. Whitehouse, S. M. Lucas, P. I. Cowling, P. Rohlfshagen, S. Tavener, D. Perez, S. Samothrakis, and S. Colton · 2012
Improving automation in interactive theorem provers by efficient encoding of lambda-abstractions
Lukasz Czajka · 2016
Later among the works it cites.
Easy-first dependency parsing with hierarchical tree LSTMs
Eliyahu Kiperwasser and Yoav Goldberg · 2016
Later among the works it cites.
TacticToe: Learning to reason with HOL4 tactics
Thibault Gauthier, Cezary Kaliszyk, and Josef Urban · 2017
Later among the works it cites.
ENIGMA: efficient learning-based inference guiding machine
Jan Jakubuv and Josef Urban · 2017
Later among the works it cites.
Deep network guided proof search
Sarah M. Loos, Geoffrey Irving, Christian Szegedy, and Cezary Kaliszyk · 2017
Later among the works it cites.
Mastering the game of Go without human knowledge
David Silver, Julian Schrittwieser, Karen Simonyan, Ioannis Antonoglou, Aja Huang, Arthur Guez, Thomas Hubert, Lucas Baker, Matthew Lai, Adrian Bolton, Yutian Chen, Timothy Lillicrap, Fan Hui, Laurent Sifre, George van den Driessche, Thore Graepel, and Demis Hassabis · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
The new Quickcheck for Isabelle - random, exhaustive and symbolic testing under one roof
Lukas Bulwahn · 2012
Cited alongside, same era.
Continuous upper confidence trees with polynomial exploration - consistency
David Auger, Adrien Couëtoux, and Olivier Teytaud · 2013
Cited alongside, same era.
Automating inductive proofs using theory exploration
Koen Claessen, Moa Johansson, Dan Rosén, and Nicholas Smallbone · 2013
Cited alongside, same era.
First-order theorem proving and vampire
Laura Kovács and Andrei Voronkov · 2013
Cited alongside, same era.
Efficient mini-batch training for stochastic optimization
Mu Li, Tong Zhang, Yuqiang Chen, and Alexander J. Smola · 2014
Cited alongside, same era.
Premise selection and external provers for HOL4
Thibault Gauthier and Cezary Kaliszyk · 2015
Cited alongside, same era.
Later among the works it cites.
Learning to prove with tactics
Thibault Gauthier, Cezary Kaliszyk, Josef Urban, Ramana Kumar, and Michael Norrish · 2018
Later among the works it cites.
Reinforcement learning of theorem proving
Cezary Kaliszyk, Josef Urban, Henryk Michalewski, and Miroslav Olsák · 2018
Later among the works it cites.
\lambda λ \lambda to ski, semantically - declarative pearl
Oleg Kiselyov · 2018
Later among the works it cites.
ENIGMA-NG: efficient neural and gradient-boosted inference guidance for E
Karel Chvalovský, Jan Jakubuv, Martin Suda, and Josef Urban · 2019
Closest in time.
Deepsynth: Program synthesis for automatic task segmentation in deep reinforcement learning
Mohammadhosein Hasanbeig, Natasha Yogananda Jeppu, Alessandro Abate, Tom Melham, and Daniel Kroening · 2019
Closest in time.
Hammering Mizar by learning clause guidance
Jan Jakubuv and Josef Urban · 2019
Closest in time.
CLS-SMT: bringing together combinatory logic synthesis and satisfiability modulo theories
Fadil Kallat, Tristan Schäfer, and Anna Vasileva · 2019
Closest in time.
Joint training of neural network ensembles
Andrew M. Webb, Charles Reynolds, Dan-Andrei Iliescu, Henry W. J. Reeve, Mikel Luján, and Gavin Brown · 2019
Closest in time.