Search Results for author:
Found 11 papers, 0 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.
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.
Learning Planning Action Models from State Traces
In one level (L1), the states in the traces are labeled with action names, so we can deduce the number and names of the actions, but we still need to work out the number and types of parameters.
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.
Improving ENIGMA-Style Clause Selection While Learning From History
We re-examine the topic of machine-learned clause selection guidance in saturation-based theorem provers.
Vampire With a Brain Is a Good ITP Hammer
Vampire has been for a long time the strongest first-order automatic theorem prover, widely used for hammer-style proof automation in ITPs such as Mizar, Isabelle, HOL, and Coq.
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.
Proceedings of the Second International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements
These are the post-proceedings of the second ARCADE workshop, which took place on the 26th August 2019 in Natal, Brazil, colocated with CADE-27.
Logic in Computer Science
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.
Selecting the Selection
Modern saturation-based Automated Theorem Provers typically implement the superposition calculus for reasoning about first-order logic with or without equality.
Duality in STRIPS planning
The duality sheds new light on STRIPS planning by allowing a transfer of ideas from one search approach to the other.
