Imitation Learning for Connection-Tableau Construction
An automated theorem prover builds a proof step by step, choosing at each point what to add and what to remove. We cast this construction as a policy acting in a transition system induced by a formal calculus, which fixes which steps are sound: for clausal connection tableaux, leanCoP-style search and plCoP/rlCoP-style planning then become stateful policies over one interface, and policy-learning…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
