pith. machine review for the scientific record. sign in

arxiv: 1606.04442 · v2 · submitted 2016-06-14 · 💻 cs.AI · cs.LG· cs.LO

Recognition: unknown

DeepMath - Deep Sequence Models for Premise Selection

Authors on Pith no claims yet
classification 💻 cs.AI cs.LGcs.LO
keywords modelspremiseselectiondeepprovingsequencetasktheorem
0
0 comments X
read the original abstract

We study the effectiveness of neural sequence models for premise selection in automated theorem proving, one of the main bottlenecks in the formalization of 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 to theorem proving on a large scale.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Re$^2$Math: Benchmarking Theorem Retrieval in Research-Level Mathematics

    cs.AI 2026-05 unverdicted novelty 7.0

    Re²Math is a new benchmark that evaluates AI models on retrieving and verifying the applicability of theorems from math literature to advance steps in partial proofs, accepting any sufficient theorem while controlling...