Skip to content
conftrace_
2016 NeurIPS NeurIPS 2016

DeepMath - Deep Sequence Models for Premise Selection

We study the effectiveness of neural sequence models for premise selection in automated theorem proving, a key bottleneck for progress in formalized mathematics. We propose a two stage approach for this task that yields good results for the premise selection task on the Mizar corpus while avoiding the hand-engineered features of existing state-of-the-art models. To our knowledge, this is the first time deep learning has been applied theorem proving on a large scale.

🧭 Keyword Pioneer - automated theorem proving

More from NeurIPS 2016

All NeurIPS 2016 papers →