Search Results for author:
Found 12 papers, 5 papers with code
Learning Guided Automated Reasoning: A Brief Survey
Automated theorem provers and formal proof assistants are general reasoning systems that are in theory capable of proving arbitrarily hard theorems, thus solving arbitrary problems reducible to mathematics and logical reasoning.
MizAR 60 for Mizar 50
As a present to Mizar on its 50th anniversary, we develop an AI/TP system that automatically proves about 60\% of the Mizar theorems in the hammer setting.
The Isabelle ENIGMA
We significantly improve the performance of the E automated theorem prover on the Isabelle Sledgehammer problems by combining learning and theorem proving in several ways.
Learning Theorem Proving Components
Saturation-style automated theorem provers (ATPs) based on the given clause procedure are today the strongest general reasoners for classical first-order logic.
Fast and Slow Enigmas and Parental Guidance
The second addition is motivated by fast weight-based rejection filters that are currently used in systems like E and Prover9.
First Neural Conjecturing Datasets and Experiments
We describe several datasets and first experiments with creating conjectures by neural methods.
ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (system description)
For the neural guidance, we use symbol-independent graph neural networks (GNNs) and their embedding of the terms and clauses.
ENIGMAWatch: ProofWatch Meets ENIGMA
In this work we describe a new learning-based proof guidance -- ENIGMAWatch -- for saturation-style first-order theorem provers.
Hammering Mizar by Learning Clause Guidance
We describe a very large improvement of existing hammer-style proof automation over large ITP libraries by combining learning and theorem proving.
ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E
We describe an efficient implementation of clause guidance in saturation-based automated theorem provers extending the ENIGMA approach.
ProofWatch: Watchlist Guidance for Large Theories in E
Watchlist (also hint list) is a mechanism that allows related proofs to guide a proof search for a new conjecture.
ENIGMA: Efficient Learning-based Inference Guiding Machine
ENIGMA is a learning-based method for guiding given clause selection in saturation-based theorem provers.
