Abstract

We give an introduction to, and a survey of, results in the theory of automatability, which is the "proof complexity" analogue of the proof search problem that is solved by constraint programming solvers.

Video Recording