**arXiv ID:** 2107.10034 **Authors:** Karel Chvalovský, Jan Jakubův, Miroslav Olšák, Josef Urban **Published:** 2021-07-21T12:00:05Z **Abstract:** Saturation-style automated theorem provers (ATPs) based on the given clause procedure are today the strongest general reasoners for classical first-order logic. The clause selection heuristics in such systems are, however, often evaluating clauses in isolation, ignoring other clauses. This has changed recently by equipping the E/ENIGMA system with ...
Installs into .claude/skills of the current project.
Sponsors
SSkills DirectorySkills Directory
Know which skills are safe — weekly.
SSkills DirectorySkills Directory
Is that skill safe to install?
Are you the author of Learning Theorem Proving Components?
Add the live security badge to your README. It updates with every re-scan.
[](https://www.skillsdirectory.com/skills/hiyenwong-learning-theorem-proving-components)
# Learning Theorem Proving Components
**arXiv ID:** 2107.10034
**Authors:** Karel Chvalovský, Jan Jakubův, Miroslav Olšák, Josef Urban
**Published:** 2021-07-21T12:00:05Z
**Abstract:**
Saturation-style automated theorem provers (ATPs) based on the given clause procedure are today the strongest general reasoners for classical first-order logic. The clause selection heuristics in such systems are, however, often evaluating clauses in isolation, ignoring other clauses. This has changed recently by equipping the E/ENIGMA system with a graph neural network (GNN) that chooses the next given clause based on its evaluation in the context of previously selected clauses. In this work, we describe several algorithms and experiments with ENIGMA, advancing the idea of contextual evaluation based on learning important components of the graph of clauses.
## Skill Description
This skill is generated from the arXiv paper: Learning Theorem Proving Components (2107.10034).
## How to Use
[To be filled in by the user or by future automation]
## References
- [arXiv:2107.10034](http://arxiv.org/abs/2107.10034v1)
