Search Results for author:
Found 6 papers, 2 papers with code
Regularization in Spider-Style Strategy Discovery and Schedule Construction
To achieve the best performance, automatic theorem provers often rely on schedules of diverse proving strategies to be tried out (either sequentially or in parallel) on a given problem.
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.
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.
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.
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.
