arXiv:2408.14338

Machine Learning for Quantifier Selection in cvc5

Jan Jakubův, Mikoláš Janota, Jelle Piepenbrock, Josef Urban

제출 2024-08-26

원문 초록

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.

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

arXiv:2305.05792공통 태그 Holdout Set공식 코드 · Papers with Code

Testing for Overfitting

토론

이 논문과 연결된 포럼 글이 아직 없습니다.