paper-with-me

Papers

DeepMath - Deep Sequence Models for Premise Selection

2016-06-14 · NeurIPS 2016 12 · Alex A. Alemi, Francois Chollet, Niklas Een, Geoffrey Irving, Christian Szegedy, Josef Urban

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.

📄 PDF Abstract BibTeX arXiv:1606.04442

Code (2)

BartoszPiotrowski/ATPboost
JUrban/deepmath

Tasks

Automated Theorem Proving

Similar Papers 제목 키워드 기반

DeepMath-103K: A Large-Scale, Challenging, Decontaminated, and Verifiable Mathematical Dataset for Advancing Reasoning

2025-04-15 · Zhiwei He, Tian Liang, Jiahao Xu, Qiuzhi Liu 외

The capacity for complex mathematical reasoning is a key benchmark for artificial intelligence. While reinforcement learning (RL) applied to LLMs shows promise, progress is significantly hindered by the lack of large-sca…

Mathematical ReasoningReinforcement Learning (RL)

Combining Textual and Structural Information for Premise Selection in Lean

2025-10-24 · Job Petrovčič, David Eliecer Narvaez Denis, Ljupčo Todorovski arxiv

Premise selection is a key bottleneck for scaling theorem proving in large formal libraries. Yet existing language-based methods often treat premises in isolation, ignoring the web of dependencies that connects them. We …

Premise Selection for Mathematics by Corpus Analysis and Kernel Methods

2011-08-17 · Jesse Alama, Tom Heskes, Daniel Kühlwein, Evgeni Tsivtsivadze 외

Smart premise selection is essential when using automated reasoning as a tool for large-theory formal proof development. A good method for premise selection in complex mathematical libraries is the application of machine…

Mathematical Proofs

Active entailment encoding for explanation tree construction using parsimonious generation of hard negatives

2022-08-02 · Alex Bogatu, Zili Zhou, Dónal Landers, André Freitas

Entailment trees have been proposed to simulate the human reasoning process of explanation generation in the context of open--domain textual question answering. However, in practice, manually constructing these explanati…

Explanation GenerationQuestion Answering

IJS at TextGraphs-16 Natural Language Premise Selection Task: Will Contextual Information Improve Natural Language Premise Selection?

2022-10-01 · COLING (TextGraphs) 2022 10 · Thi Hong Hanh Tran, Matej Martinc, Antoine Doucet, Senja Pollak

Natural Language Premise Selection (NLPS) is a mathematical Natural Language Processing (NLP) task that retrieves a set of applicable relevant premises to support the end-user finding the proof for a particular statement…