# Automated Theorem Proving

86 papers with code • 9 benchmarks • 8 datasets

The goal of **Automated Theorem Proving** is to automatically generate a proof, given a conjecture (the target theorem) and a knowledge base of known facts, all expressed in a formal language. Automated Theorem Proving is useful in a wide range of applications, including the verification and synthesis of software and hardware systems.

Source: Learning to Prove Theorems by Learning to Generate Theorems

## Libraries

Use these libraries to find Automated Theorem Proving models and implementations## Most implemented papers

# Logical Neural Networks

We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning).

# Measuring Systematic Generalization in Neural Proof Generation with Transformers

We observe that models that are not trained to generate proofs are better at generalizing to problems based on longer proofs.

# Learning Maximally Monotone Operators for Image Recovery

Recently, several works have proposed to replace the operator related to the regularization by a more sophisticated denoiser.

# Learning to Match Mathematical Statements with Proofs

The task is designed to improve the processing of research-level mathematical texts.

# Learning Symbolic Rules for Reasoning in Quasi-Natural Language

In this work, we ask how we can build a rule-based system that can reason with natural language input but without the manual construction of rules.

# Linear algebra with transformers

Transformers can learn to perform numerical computations from examples only.

# ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics

We introduce ProofNet, a benchmark for autoformalization and formal proving of undergraduate-level mathematics.

# Towards Large Language Models as Copilots for Theorem Proving in Lean

In this paper, we explore LLMs as copilots that assist humans in proving theorems.

# Lectures on Jacques Herbrand as a Logician

We give some lectures on the work on formal logic of Jacques Herbrand, and sketch his life and his influence on automated theorem proving.

# HOL(y)Hammer: Online ATP Service for HOL Light

HOL(y)Hammer is an online AI/ATP service for formal (computer-understandable) mathematics encoded in the HOL Light system.