A reinforcement learning algorithm accomplishes the task of synthesizing a set-theoretical formula that evaluates to given truth values for given assignments.
We set a precedent for statistically guided synthesis of Diophantine equations by solving 78. 5% of the generated test problems.
This paper describes a large set of related theorem proving problems obtained by translating theorems from the HOL4 standard library into multiple logical formalisms.
Logic in Computer Science
Techniques combining machine learning with translation to automated reasoning have recently become an important component of formal proof assistants.