Browse > Miscellaneous > Automated Theorem Proving

Automated Theorem Proving

16 papers with code · Miscellaneous

Leaderboards

Greatest papers with code

HOList: An Environment for Machine Learning of Higher-Order Theorem Proving

5 Apr 2019tensorflow/deepmath

We present an environment, benchmark, and deep learning driven automated theorem prover for higher-order logic.

AUTOMATED THEOREM PROVING

HolStep: A Machine Learning Dataset for Higher-order Logic Theorem Proving

1 Mar 2017tensorflow/deepmath

We propose various machine learning tasks that can be performed on this dataset, and discuss their significance for theorem proving.

AUTOMATED THEOREM PROVING

jsCoq: Towards Hybrid Theorem Proving Interfaces

25 Jan 2017ejgallego/jscoq

We describe jsCcoq, a new platform and user environment for the Coq interactive proof assistant.

AUTOMATED THEOREM PROVING

Learning to Prove Theorems via Interacting with Proof Assistants

21 May 2019princeton-vl/CoqGym

Proof assistants offer a formalism that resembles human mathematical reasoning, representing theorems in higher-order logic and proofs as high-level tactics.

AUTOMATED THEOREM PROVING MATHEMATICAL PROOFS

GamePad: A Learning Environment for Theorem Proving

ICLR 2019 ml4tp/gamepad

In this paper, we introduce a system called GamePad that can be used to explore the application of machine learning methods to theorem proving in the Coq proof assistant.

AUTOMATED THEOREM PROVING

GamePad: A Learning Environment for Theorem Proving

ICLR 2019 ml4tp/gamepad

In this paper, we introduce a system called GamePad that can be used to explore the application of machine learning methods to theorem proving in the Coq proof assistant.

AUTOMATED THEOREM PROVING

Holophrasm: a neural Automated Theorem Prover for higher-order logic

8 Aug 2016dwhalen/holophrasm

I propose a system for Automated Theorem Proving in higher order logic using deep learning and eschewing hand-constructed features.

AUTOMATED THEOREM PROVING

DeepMath - Deep Sequence Models for Premise Selection

NeurIPS 2016 JUrban/deepmath

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.

AUTOMATED THEOREM PROVING

Generating Correctness Proofs with Neural Networks

Under submission to POPL 2020 2019 UCSD-PL/proverbot9001

Foundational verification allows programmers to build software which has been empirically shown to have high levels of assurance in a variety of important domains.

AUTOMATED THEOREM PROVING