Papers
arxiv:1606.04442

DeepMath - Deep Sequence Models for Premise Selection

Published on Jun 14, 2016
Authors:
,
,
,
,
,

Abstract

Deep learning is applied for large-scale premise selection in automated theorem proving using a two-stage neural sequence model.

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.

Community

Sign up or log in to comment

Get this paper in your agent:

hf papers read 1606.04442
Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/1606.04442 in a model README.md to link it from this page.

Datasets citing this paper 1

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/1606.04442 in a Space README.md to link it from this page.

Collections including this paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.