From MBQI to Enumerative Instantiation and Back
Logic in Computer Science
2025-08-19 v2
Abstract
This work investigates the relation between model-based quantifier instantiation (MBQI) and enumerative instantiation (EI) in Satisfiability Modulo Theories (SMT). MBQI operates at the semantic level and guarantees to find a counterexample to a given a non-model. However, it may lead to weak instantiations. In contrast, EI strives for completeness by systematically enumerating terms at the syntactic level. However, such terms may not be counter-examples. Here we investigate the relation between the two techniques and report on our initial experiments of the proposed algorithm that combines the two.
Cite
@article{arxiv.2506.22584,
title = {From MBQI to Enumerative Instantiation and Back},
author = {Marek Dančo and Petra Hozzová and Mikoláš Janota},
journal= {arXiv preprint arXiv:2506.22584},
year = {2025}
}
Comments
SMT 2025