ENIGMAWatch: ProofWatch meets ENIGMA
From MaRDI portal
Abstract: In this work we describe a new learning-based proof guidance -- ENIGMAWatch -- for saturation-style first-order theorem provers. ENIGMAWatch combines two guiding approaches for the given-clause selection implemented for the E ATP system: ProofWatch and ENIGMA. ProofWatch is motivated by the watchlist (hints) method and based on symbolic matching of multiple related proofs, while ENIGMA is based on statistical machine learning. The two methods are combined by using the evolving information about symbolic proof matching as an additional information that characterizes the saturation-style proof search for the statistical learning methods. The new system is experimentally evaluated on a large set of problems from the Mizar Library. We show that the added proof-matching information is considered important by the statistical machine learners, and that it leads to improvements in E's Performance over ProofWatch and ENIGMA.
Recommendations
Cited in
(11)- Enhancing ENIGMA given clause guidance
- Improving ENIGMA-style clause selection while learning from history
- ENIGMA-NG: efficient neural and gradient-boosted inference guidance for \(\mathrm{E}\)
- ENIGMA: efficient learning-based inference guiding machine
- Internal guidance for Satallax
- Make E Smart Again (Short Paper)
- ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (System Description)
- Prolog Technology Reinforcement Learning Prover
- Hammering Mizar by Learning Clause Guidance (Short Paper).
- Learning guided automated reasoning: a brief survey
- Fast and slow enigmas and parental guidance
This page was built for publication: ENIGMAWatch: ProofWatch meets ENIGMA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2180529)