Jan Jakubův, Mikoláš Janota, Jelle Piepenbrock, Josef Urban
{"title":"cvc5 中用于量词选择的机器学习","authors":"Jan Jakubův, Mikoláš Janota, Jelle Piepenbrock, Josef Urban","doi":"arxiv-2408.14338","DOIUrl":null,"url":null,"abstract":"In this work we considerably improve the state-of-the-art SMT solving on\nfirst-order quantified problems by efficient machine learning guidance of\nquantifier selection. Quantifiers represent a significant challenge for SMT and\nare technically a source of undecidability. In our approach, we train an\nefficient machine learning model that informs the solver which quantifiers\nshould be instantiated and which not. Each quantifier may be instantiated\nmultiple times and the set of the active quantifiers changes as the solving\nprogresses. Therefore, we invoke the ML predictor many times, during the whole\nrun of the solver. To make this efficient, we use fast ML models based on\ngradient boosting decision trees. We integrate our approach into the\nstate-of-the-art cvc5 SMT solver and show a considerable increase of the\nsystem's holdout-set performance after training it on a large set of\nfirst-order problems collected from the Mizar Mathematical Library.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"24 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Machine Learning for Quantifier Selection in cvc5\",\"authors\":\"Jan Jakubův, Mikoláš Janota, Jelle Piepenbrock, Josef Urban\",\"doi\":\"arxiv-2408.14338\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we considerably improve the state-of-the-art SMT solving on\\nfirst-order quantified problems by efficient machine learning guidance of\\nquantifier selection. Quantifiers represent a significant challenge for SMT and\\nare technically a source of undecidability. In our approach, we train an\\nefficient machine learning model that informs the solver which quantifiers\\nshould be instantiated and which not. Each quantifier may be instantiated\\nmultiple times and the set of the active quantifiers changes as the solving\\nprogresses. Therefore, we invoke the ML predictor many times, during the whole\\nrun of the solver. To make this efficient, we use fast ML models based on\\ngradient boosting decision trees. We integrate our approach into the\\nstate-of-the-art cvc5 SMT solver and show a considerable increase of the\\nsystem's holdout-set performance after training it on a large set of\\nfirst-order problems collected from the Mizar Mathematical Library.\",\"PeriodicalId\":501208,\"journal\":{\"name\":\"arXiv - CS - Logic in Computer Science\",\"volume\":\"24 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.14338\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.14338","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
在这项工作中,我们通过对量词选择的高效机器学习指导,大大改进了解决一阶量化问题的最先进 SMT。量词是 SMT 的一大挑战,从技术上讲也是不可判定性的来源。在我们的方法中,我们训练了一个高效的机器学习模型,告诉求解器哪些量词应该实例化,哪些不应该。每个量词都可能被实例化多次,随着求解的进行,活动量词集也会发生变化。因此,在求解器的整个运行过程中,我们会多次调用 ML 预测器。为了提高效率,我们使用了基于梯度提升决策树的快速 ML 模型。我们将这种方法集成到最先进的 cvc5 SMT 求解器中,并在对从 Mizar 数学库中收集的大量一阶问题集进行训练后,证明该系统的保持集性能有了显著提高。
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.