mlsanityData to 14 Oct 2026

Machine Learning for Quantifier Selection in cvc5

arXiv 2408.14338 ↗First posted 26 Aug 2024cs.AI cs.LG cs.LOcited by 0

Not on the map. Why?

Abstract (arXiv)

In this work we considerably improve the state-of-the-art SMT solving on first-order quantified problems by efficient machine learning guidance of quantifier selection. Quantifiers represent a significant challenge for SMT and are technically a source of undecidability. In our approach, we train an efficient machine learning model that informs the solver which quantifiers should be instantiated and which not. Each quantifier may be instantiated multiple times and the set of the active quantifiers changes as the solving progresses. Therefore, we invoke the ML predictor many times, during the whole run of the solver. To make this efficient, we use fast ML models based on gradient boosting decision trees. We integrate our approach into the state-of-the-art cvc5 SMT solver and show a considerable increase of the system's holdout-set performance after training it on a large set of first-order problems collected from the Mizar Mathematical Library.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 57 references that are in the map. First posted on arXiv 26 Aug 2024.

Builds on

14 of 57 references.

References · 14

  1. 2017ENIGMA: Efficient Learning-based Inference Guiding Machinecited by 26
  2. 2020ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (system description)cited by 26
  3. 2019Hammering Mizar by Learning Clause Guidancecited by 20
  4. 2021Vampire With a Brain Is a Good ITP Hammercited by 10
  5. 2021Fast and Slow Enigmas and Parental Guidancecited by 8
  6. 2022The Isabelle ENIGMAcited by 8
  7. 2024Learning Guided Automated Reasoning: A Brief Surveycited by 7
  8. 2023MizAR 60 for Mizar 50cited by 6
  9. 2016BliStrTune: Hierarchical Invention of Theorem Proving Strategiescited by 5
  10. 2023Graph Sequence Learning for Premise Selectioncited by 5
  11. 2021Fair and Adventurous Enumeration of Quantifier Instantiationscited by 3
  12. 2019GRUNGE: A Grand Unified ATP Challengecited by 2
2 more
  1. 2024Regularization in Spider-Style Strategy Discovery and Schedule Constructioncited by 2
  2. 2024Solving Hard Mizar Problems with Instantiation and Strategy Inventioncited by 1

Built on by

Not cited yet.