Search Results for author:
Found 11 papers, 4 papers with code
Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2
We present AlphaGeometry2, a significantly improved version of AlphaGeometry introduced in Trinh et al. (2024), which has now surpassed an average gold medalist in solving Olympiad geometry problems.
Graph2Tac: Online Representation Learning of Formal Math Concepts
We extensively benchmark two such online solvers implemented in the Tactician platform for the Coq proof assistant: First, Tactician's online $k$-nearest neighbor solver, which can learn from recent proofs, shows a $1. 72\times$ improvement in theorems proved over an offline equivalent.
Machine Learning Meets The Herbrand Universe
In particular, we develop a GNN2RNN architecture based on an invariant graph neural network (GNN) that learns from problems and their solutions independently of symbol names (addressing the abundance of skolems), combined with a recurrent neural network (RNN) that proposes for each clause its instantiations.
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.
The Role of Entropy in Guiding a Connection Prover
This leads us to explore how the entropy of the inference selection implemented via the neural network influences the proof search.
ω-categorical structures avoiding height 1 identities
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable if the model-complete core of the template has a pseudo-Siggers polymorphism, and NP-complete otherwise.
Logic Logic in Computer Science Rings and Algebras
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.
Property Invariant Embedding for Automated Reasoning
This encoding represents symbols only by nodes in the graph, without giving the network any knowledge of the original labels.
