资源分类
》 资源 》论文》DeepMath - Deep Sequence Models for Premise Selection

DeepMath - Deep Sequence Models for Premise Selection

2020-02-05 | |  52 |   51 |   0

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 handengineered 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.

上一篇：Learning in Games: Robustness of Fast Convergence

下一篇：Theoretical Comparisons of Positive-Unlabeled Learning against Positive-Negative Learning

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...