Czech Institute of Informatics, Robotics and Cybernetics(捷克信息学、机器人学与自动控制研究所);Czech Technical University in Prague(布拉格捷克技术大学);Institute for Computing and Information Sciences(计算与信息科学研究所);Radboud University(拉德博德大学)
Jan Jakubův, Mikoláš Janota, Jelle Piepenbrock, Josef Urban
备注:
Updated version for International Journal of Approximate Reasoning. Volume 189, February 2026, 109602
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.
CTQScorer: Combining Multiple Features for In-context Example Selection for Machine Translation
IIT Madras(印度理工学院马德拉斯分校);Microsoft(微软);Institute for Infocomm Research (IR)(资讯通信研究院);AI4Bharat(AI4Bharat(印度人工智能研究机构));National Institute of Information Communications Technology(日本国立信息通信技术研究所)