Machine Learning Literature
With focus on the relationship of machine learning to symbolic computation,
computer algebra, automated reasoning, automatic programming, etc.
Tree Search, Game Playing, Reinforcement Learning, Pattern Analysis
- Browne, Cameron et al. (2012):
A Survey of Monte Carlo Tree Search Methods
- Kishimoto, Akihiro et al. (2019):
Depth-First Proof-Number Search with Heuristic Edge Cost and Application to
Chemical Synthesis Planning
- Kipf, Thomas N. et al. (2017):
Semi-Supervised Classification with Graph Convolutional Networks
- Mnih, Volodymyr et al. (2013):
Playing Atari with Deep Reinforcement Learning
- Scarselli, Franco et al. (2009):
The Graph Neural Network Model
- Schadd, Maarten P.D. et al. (2011):
Single-Player Monte-Carlo Tree Search for SameGame
- Shawe-Taylor, John et al. (2016):
Kernel Methods for Pattern Analysis
- Silver, David et al. (2016):
Mastering the game of Go with deep neural networks and tree search
- Silver, David et al. (2017):
Mastering the game of Go without human knowledge
- Sutton, Richard S. (2018):
Reinforcement Learning - An Introduction
- Tai, Kai Sheng et al. (2015):
Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks
- Wang, Minjie et al. (2019):
Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks
Symbolic Computation and Machine Learning, Neuro-Symbolic AI
- Buchberger, Bruno (2023):
Automated programming, symbolic computation, machine learning: my personal view
- Marra, Guiseppe et al. (2024):
From statistical relational to neurosymbolic artificial intelligence:
A survey
- Saker, Md Kamruzzaman et al. (2018):
Neuro-Symbolic Artificial Intelligence - Current Trends
- Segler, Marwin H. S. et al. (2018):
Planning chemical syntheses with deep neural networks and symbolic AI
- Wolfram, Stephen (2023):
Wolfram|Alpha as the Way to Bring Computational Knowledge Superpowers to ChatGPT
Symbolic Object Representations
- Allamanis, Miltiadis et al. (2017):
Learning Continuous Semantic Representations of Symbolic Expressions
- Chvalovský, Karel (2019):
Top-Down Neural Model For Formulae
- Crouse, Maxwell et al. (2019):
Improving Graph Neural Network Representations of Logical Formulae with Subgraph Pooling
- Dumancic, Sebastijan et al. (2019):
Learning Relational Representations with Auto-encoding Logic Programs
- Goller, Christoph et al. (1996):
Learning Task-Dependent Distributed Representations by
Backpropagation Through Structure
- Kaliszyk, Cezary et al. (2015):
Efficient Semantic Features for Automated Reasoning over Large Theories
- Mikolov, Tomas et al. (2013):
Distributed Representations of Words and Phrases and their Compositionality
- Müller, Dennis et al. (2021):
Disambiguating Symbolic Expressions in Informal Documents
- Olšák, Miroslav et al. (2019):
Property Invariant Embedding for Automated Reasoning
- Paliwal, Marc et al. (2020):
Graph Representations for Higher-Order Logic and Theorem Proving
- Parsert, Julian et al. (2020):
Property Preserving Encoding of First-order Logic
- Purgal, Stanislaw et al. (2021):
A Study of Continuous Vector Representations for Theorem Proving
- Rocktäschel, Tim et al. (2017):
End-to-End Differentiable Proving
- Wang, Mingzhe et al. (2017):
Premise Selection for Theorem Proving by Deep Graph Embedding
- Wang, Qingxian et al. (2021):
JEFL: Joint Embedding of Formal Proof Libraries
Computer Mathematics/Algebra/Geometry
- Barket, Rashid et al. (2023):
Generating Elementary Integrable Expressions
- Barket, Rashid et al. (2024):
Symbolic Integration Algorithm Selection with Machine Learning: LSTMs vs Tree LSTMs
- Huang, Zongyan et al. (2024):
Applying Machine Learning to the Problem of Choosing a Heuristic to Select
the Variable Ordering for Cylindrical Algebraic Decomposition
- Jia, Fuqi et al. (2024):
Suggesting Variable Order for Cylindrical Algebraic
Decomposition via Reinforcement Learning
- Lample, Guillame et al. (2019):
Deep Learning for Symbolic Mathematics
- Lenat, Doublas B. (1976):
AM: An Artificial Intelligence Approach to Discovery in Mathematics
as Heuristic Search
- Pickering, L. et al. (2024):
Explainable AI Insights for Symbolic Computation: A case study on selecting the
variable ordering for cylindrical algebraic decomposition
- Simpson, M.C. et al. (2016):
Automatic Algorithm Selection in Computational
Software Using Machine Learning
- Trinh, Trieu et al. (2024):
Solving olympiad geometry without human demonstrations
Automatic Formalization
- Kaliszyk, Cezary et al. (2014):
Developing Corpus-Based Translation Methods between Informal and Formal
Mathematics: Project Description
- Kaliszyk, Cezary et al. (2017):
Automating Formalization by Statistical and Semantic Parsing of Mathematics
- Wang, Qingxian et al. (2018):
First Experiments with Neural Translation of Informal to Formal Mathematics
- Wang, Qingxian et al. (2020):
Exploration of Neural Machine Translation in
Autoformalization of Mathematics in Mizar
- Youssef, Abdou et al. (2018):
Deep Learning for Math Knowledge Processing
Program Synthesis, Rule Learning, Logic Programming
- Evans, Richard et al. (2019):
Learning Explanatory Rules from Noisy Data
- Fierens, Daan et al. (2013):
Inference and Learning in Probabilistic Logic
Programs using Weighted Boolean Formulas
- Gauthier, Thibault (2020):
Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic
- Gauthier, Thibault et al. (2023):
Alien Coding
- Glanois, Claire et al. (2021):
Neuro-Symbolic Hierarchical Rule Induction
- Landwehr, Niels et al. (2006):
kFOIL: Learning Simple Relational Kernels
- Landwehr, Niels et al. (2007):
Integrating Naıve Bayes and FOIL
- Langley, Patrick W. (1977):
BACON: A Production System That Discovers Empirical Laws
- Manhaeve, Robin et al. (2018):
DeepProbLog: Neural Probabilistic Logic Programming
- Manhaeve, Robin et al. (2019):
Neural Probabilistic Logic Programming in DeepProbLog
- Manhaeve, Robin et al. (2021):
Neuro-Symbolic AI = Neural + Logical + Probabilistic AI
- Purgal, Stanislaw J. et al. (2023):
Learning Higher-Order Logic Programs From Failures
- Purgal, Stanislaw J. et al. (2023):
Differentiable Inductive Logic Programming in High-Dimensional Space
- Quinlinian, J.R. (1990):
Learning Logical Definitions from Relations
Knowledge Graphs
- Amayuelas, Alfonso et al. (2011):
Neural Methods for Logical Reasoning over Knowledge Graphs
- Shi, Ming et al. (2024):
Convolutional Neural Network Knowledge Graph Link Prediction
Model Based on Relational Memory
- Trouillon, Théo et al. (2016):
Complex Embeddings for Simple Link Prediction
SAT and SMT Solving
- Balunović, Mislav et al. (2018):
Learning to Solve SMT Formulas
- Chang, Oscar (2023):
Assessing SATNet’s Ability to Solve the Symbol Grounding Problem
- El Ouraoui, Daniel et al. (2019):
Machine Learning for Instance Selection in SMT Solving
- Holden, Sean B. (2021):
Machine Learning for Automated Theorem Proving: Learning to Solve
SAT and QSAT
- Jakubuv, Jan et al. (2023):
Selecting Quantifiers for Instantiation in SMT
- Piepenbrock, Jelle et al. (2022):
Machine Learning Meets The Herbrand Universe
- Piepenbrock, Jelle et al. (2024):
First Experiments with Neural cvc5
- Pimpalkhare, Nikhil et al. (2021):
MedleySolver: Online SMT Algorithm Selection
- Scott, Joseph et al. (2021):
MachSMT: A Machine Learning-based Algorithm Selector for SMT Solvers
- Selsam, Daniel et al. (2019):
Learning a SAT Solver from Single-Bit Supervision
- Topan, Sever et al. (2021):
Techniques for Symbol Grounding with SATNet
- Wang, Po-Wei et al. (2019):
SATNet: Bridging deep learning and logical reasoning using a differentiable
satisfiability solver
First-/Higher-Order Logic
Surveys:
- Abdelaziz, Ibrahim et al. (2021):
Learning to Guide a Saturation-Based Theorem Prover
- Alama, Jesse et al. (2022):
Premise Selection for Mathematics by Corpus Analysis and Kernel Methods
- Alemi, Alexander A. et al. (2016):
DeepMath - Deep Sequence Models for Premise Selection
- Aygün, Eser et al. (2021):
Proving Theorems using Incremental Learning and Hindsight Experience Replay
- Bansal, Kshitij et al. (2019):
HOList: An Environment for Machine Learning of Higher-Order Theorem Proving
- Bártek, Filip et al. (2021):
Neural Precedence Recommender
- Bártek, Filip et al. (2023):
How Much Should This Symbol Weigh? A GNN-Advised Clause Selection
- Blanchette, Jasmin C. et al. (2015):
Hammering towards QED
- Blanchette, Jasmin C. et al. (2016):
A Learning-Based Fact Selector for Isabelle/HOL
- Blauuwbroek, Lasse et al. (2020):
The Tactician - A Seamless, Interactive Tactic Learner and Prover for Coq
- Bridge, James P. (2010):
Machine learning and automated theorem proving
- Chvalovský, Karel et al. (2019):
ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E
- Chvalovský, Karel et al. (2021):
Learning Theorem Proving Components
- Chvalovský, Karel et al. (2023):
Guiding an Instantiation Prover with Graph Neural Networks
- Crouse, Maxwell et al. (2021):
A Deep Reinforcement Learning Approach to First-Order Logic Theorem Proving
- Evans, Richard et al. (2018):
Can Neural Networks Understand Logical Entailment?
- Färber, Michael et al. (2011):
Internal Guidance for Satallax
- Färber, Michael et al. (2015):
Random Forests for Premise Selection
- Färber, Michael et al. (2019):
Monte Carlo Tableau Proof Search
- Färber, Michael et al. (2021):
Machine Learning Guidance for Connection Tableaux
- First, Emily et al. (2020):
TacTok: Semantics-Aware Proof Synthesis
- First, Emily et al. (2022):
Diversity-Driven Automated Formal Verification
- Fuchs, Matthias (1998):
A Feature-based Learning Method for Theorem Proving
- Gauthier, Thibault et al. (2015):
Premise Selection and External Provers for HOL4
- Gauthier, Thibault et al. (2016):
Initial Experiments with Statistical Conjecturing over Large Formal Corpora
- Gauthier, Thibault et al. (2021):
TacticToe: Learning to Prove with Tactics
- Goertzel; Zarathustra et al. (2019):
ENIGMAWatch: ProofWatch Meets ENIGMA
- Goertzel; Zarathustra et al. (2021):
Fast and Slow Enigmas and Parental Guidance
- Goller, Christoph et al. (1999):
Learning Search-Control Heuristics for Automated Deduction Systems with
Folding Architecture Networks
- Grandsen, Thomas et al. (2015):
SEPIA: Search for Proofs Using Inferred Automata
- Holden, Edvard K. et al. (2021):
Heterogeneous Heuristic Optimisation and
Scheduling for First-Order Theorem Proving
- Holden, Edvard K. et al. (2023):
Graph Sequence Learning for Premise Selection
- Huang, Daniel et al. (2018):
GamePad: A Learning Environment for Theorem Proving
- Jakubuv, Jan et al. (2016):
BliStrTune: Hierarchical Invention of Theorem Proving Strategies
- Jakubuv, Jan et al. (2017):
ENIGMA: Efficient Learning-based Inference Guiding Machine
- Jakubuv, Jan et al. (2018):
Enhancing ENIGMA Given Clause Guidance
- Jakubuv, Jan et al. (2019):
ENIGMA Anonymous: Symbol-Independent Inference
Guiding Machine (System Description)
- Jakubuv, Jan et al. (2019):
Hammering Mizar by Learning Clause Guidance
- Jiang, Albert Q. et al. (2022):
Thor: Wielding Hammers to Integrate Language
Models and Automated Theorem Provers
- Jiang, Albert Q. et al. (2023):
Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs
- Johansson, Moa et al. (2023):
Exploring Mathematical Conjecturing with Large Language Models
- Kaliszyk, Cezary et al. (2013):
Stronger Automation for Flyspeck by Feature Weighting and Strategy Evolution
- Kaliszyk, Cezary et al. (2014):
Learning-Assisted Automated Reasoning with Flyspeck
- Kaliszyk, Cezary et al. (2014):
Machine Learner for Automated Reasoning 0.4 and 0.5
- Kaliszyk, Cezary et al. (2015):
Learning-assisted theorem proving with millions of lemmas
- Kaliszyk, Cezary et al. (2015):
FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover
- Kaliszyk, Cezary et al. (2015):
System description: E.T. 0.1
- Kaliszyk, Cezary et al. (2017):
HolStep: A Machine Learning Dataset for Higher-order Logic Theorem Proving
- Kaliszyk, Cezary et al. (2018):
Reinforcement Learning of Theorem Proving
- Komendantskay, Ekaterina et al. (2012):
Machine learning in Proof General: Interfacing Interfaces
- Kühlwein, Daniel et al. (2012):
Overview and Evaluation of Premise Selection Techniques for Large Theory Mathematics
- Kühlwein, Daniel et al. (2013):
MaSh: Machine Learning for Sledgehammer
- Kühlwein, Daniel et al. (2015):
MaLeS: A Framework for Automatic Tuning of Automated Theorem Provers
- Lample, Guillame et al. (2022):
HyperTree Proof Search for Neural Theorem Proving
- Loos, Sarah et al. (2017):
Deep Network Guided Proof Search
- Nagashima, Yutaka et al. (2018):
PaMpeR: Proof Method Recommendation System for Isabelle/HOL
- Pierre, Marc et al. (2023):
The Mathematical Game
- Pioetrowski, Bartosz et al. (2018):
ATPboost: Learning Premise Selection in Binary Setting with ATP Feedback
- Pioetrowski, Bartosz et al. (2020):
Stateful Premise Selection by Recurrent Neural Networks
- Pioetrowski, Bartosz et al. (2023):
Machine-Learned Premise Selection for Lean
- Purgal, Stanislaw J. al (2022):
Adversarial Learning to Reason in an Arbitrary Logic
- Rabe, Markus N. et al. (2020):
Mathematical Reasoning via Self-supervised Skip-tree Training
- Rawson, Michael et al. (2019):
A Neurally-Guided Parallel Theorem Prover
- Rawson, Michael et al. (2020):
Directed Graph Networks for Logical Reasoning (Extended Abstract)
- Rawson, Michael et al. (2020):
Directed Graph Networks for Logical Entailment
- Rawson, Michael et al. (2021):
lazyCoP: Lazy Paramodulation Meets Neurally Guided Search
- Rute, Jason et al. (2023):
Graph2Tac: Learning hierarchical representations of math concepts
in theorem proving
- Rute, Jason et al. (2024):
Graph2Tac: Online Representation Learning of Formal Math Concepts
- Sanchez-Stern, Alex et al. (2022):
Passport: Improving Automated Formal Verification Using Identifiers
- Sanchez-Stern, Alex et al. (2024):
Generating Correctness Proofs with Neural Networks
- Schäfer, Simon (2015):
Breeding Theorem Proving Heuristics with Genetic Algorithms
- Schulz, Stephan (2000):
Learning Search Control Knowledge for Equational Deduction
- Shankar, Natarajan (2013):
Automated Reasoning, Fast and Slow
- Sharma, Rahul et al. (2011):
Interpolants as Classifiers
- Steen, Alexander et al. (2016):
Agent-Based HOL Reasoning
- Suda, Martin (2021):
Improving ENIGMA-style Clause Selection while Learning From History
- Suda, Martin (2021):
Vampire with a Brain Is a Good ITP Hammer
- Urban, Josef (1998):
Experimenting with Machine Learning in Automatic Theorem Proving
- Urban, Josef et al. (2007):
MaLARea: a Metasystem for Automated Reasoning in Large Theories
- Urban, Josef et al. (2008):
MaLARea SG1 - Machine Learner for Automated Reasoning with Semantic Guidance
- Urban, Josef et al. (2011):
MaLeCoP: Machine Learning Connection Prover
- Urban, Josef (2014):
BliStr: The Blind Strategymaker
- Urban, Josef et al. (2020):
First Neural Conjecturing Datasets and Experiments
- Wang, Mingzhe et al. (2020):
Learning to Prove Theorems by Learning to Generate Theorems
- Whalen, Daniel (2016):
Holophrasm: a neural Automated Theorem Prover for higher-order logic
- Yang, Kaiyu et al. (2019):
Learning to Prove Theorems via Interacting with Proof Assistants
- Yang, Kaiyu et al. (2023):
LeanDojo: Theorem Proving with Retrieval-Augmented Language Models
- Zhang, Liao et al. (2021):
Online Machine Learning Techniques for Coq: A Comparison.
- Zhang, Liao et al. (2023):
Learning Proof Transformations and Its Applications in Interactive Theorem
Proving
- Ziener, Marco et al. (2017):
Mixing automated theorem proving and machine learning -
Bridging the gap between numerical and symbolic reasoning with a
potpourri of computer science
- Zombori, Zsolt et al. (2019):
Towards Finding Longer Proofs
- Zombori, Zsolt et al. (2021):
The Role of Entropy in Guiding a Connection Prover