Towards Finding Longer Proofs

May 30, 2019 · The Ethereal · 🏛 International Conference on Theorem Proving with Analytic Tableaux and Related Methods

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Zsolt Zombori, Adrián Csiszárik, Henryk Michalewski, Cezary Kaliszyk, Josef Urban arXiv ID 1905.13100 Category cs.LO: Logic in CS Cross-listed cs.AI, cs.LG Citations 18 Venue International Conference on Theorem Proving with Analytic Tableaux and Related Methods Last Checked 2 months ago

Abstract

We present a reinforcement learning (RL) based guidance system for automated theorem proving geared towards Finding Longer Proofs (FLoP). Unlike most learning based approaches, we focus on generalising from very little training data and achieving near complete confidence. We use several simple, structured datasets with very long proofs to show that FLoP can successfully generalise a single training proof to a large class of related problems. On these benchmarks, FLoP is competitive with strong theorem provers despite using very limited search, due to its ability to solve problems that are prohibitively long for other systems.