16 papers with code ·
Miscellaneous

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

#2 best model for Automated Theorem Proving on HOList benchmark

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

#3 best model for Automated Theorem Proving on HolStep (Unconditional)

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

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

SOTA for Automated Theorem Proving on CoqGym

We approach the recognition of textual entailment using logical semantic representations and a theorem prover.

AUTOMATED THEOREM PROVING INFORMATION RETRIEVAL NATURAL LANGUAGE INFERENCE QUESTION ANSWERING

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.

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.

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

#3 best model for Automated Theorem Proving on Metamath set.mm

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.

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