Machine Learning and Reasoning (Summer 2020)

The course is registered at MFF and taking place either at CIIRC (Dejvicka) or in Karlin. Please fill in the form if you are interested in participating.

Abstract: The course will introduce modern AI methods and architectures that combine reasoning and learning. We will briefly introduce the main ideas behind today's automated and interactive theorem proving systems and other solvers, and the main reasoning corpora. Then we will go through several machine learning problems that correspond to the reasoning tasks, ranging from high-level knowledge selection and representation of the reasoning state and knowledge, to low-level guidance of reasoning, conjecturing and systems for automating computer understanding of math. The course is organized by Josef Urban and guest lectures will be given by ARG researchers working on the particular topics: Jan Jakubuv, Martin Suda, Mikolas Janota, Karel Chvalovsky, Chad Brown, Bob Veroff and Thibault Gauthier. For a brief overview of the area, see this talk at AGI'18 . In more detail, we plan to cover the following topics:

Topics

  • Theorem proving systems - Automated and interactive theorem proving, SMT
  • Reasoning and learning over very large knowledge bases (Premise selection, Hammers for interactive proof assistants HOL, Mizar and Isabelle).
  • Guiding saturation-style and connection-style reasoners (ENIGMA, Hints, ProofWatch, MaLeCoP, Deep guidance).
  • Guiding tactical interactive provers (TacTicToe).
  • Feedback loops between obtaining new knowledge by proving and learning, reinforcement learning and positive/negative proof mining (MaLARea, rlCoP, DeepMath, ATPBoost)
  • Learning for SAT, QBF, SMT and model finding.
  • Machine learning and reasoning for translation and alignment between different math corpora.
  • Topics in representation and conjecturing - hand-engineered features, neural and semantic representations, EnigmaWatch.~

Lectures

5th March 2020
Josef Urban
Machine Learning and Automated Reasoning - Introduction
3rd April 2020
Martin Suda and Jan Jakubuv
First-order saturation-style theorem proving and ML for it
17th April 2020
Karel Chvalovsky a Mirek Olsak
Neural representation of formulas and their use in theorem proving tasks
24th April 2020
Josef Urban and Robert Veroff
(Reinforcement) Learning and connection calculus, Prover9 and hints in Prover9
30th April 2020, 15:40 CET
Thibault Gauthier and Mikolas Janota
Guiding tactical interactive provers, HOL4, HOLyHammer and TacticToe; Machine Learning for Quantification and SMT
15th May 2020, 13:10 CET
Mikolas Janota and Chad Brown
Machine Learning for Quantification and SMT; Brief Introduction to Reasoning in Type Theory
29th May 2020, 13:10 CET
3rd June 2020, 16:00 CET
Progress meeting short talks: Michael Rawson and Zsolt Zombori
Directed Graph Networks; Update on plCoP
, Michael's paper, the plCoP paper, Complex Actions for plCoP abstract
TBA
TBA
TBA
TBA
TBA
TBA

Literature