DMCA
Complete instantiation for quantified formulas in Satisfiabiliby Modulo Theories
Cached
Download Links
- [research.microsoft.com]
- [www.research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- [www.research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- [leodemoura.github.io]
- [cs.nyu.edu]
- [cs.nyu.edu]
- [research.microsoft.com]
- [research.microsoft.com]
- [leodemoura.github.io]
| Citations: | 50 - 2 self |
BibTeX
@MISC{Ge_completeinstantiation,
author = {Yeting Ge and Leonardo De Moura},
title = {Complete instantiation for quantified formulas in Satisfiabiliby Modulo Theories},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas based on heuristics, which is not refutationally complete even for pure first-order logic. We present several decidable fragments of first order logic modulo theories. We show how to construct models for satisfiable formulas in these fragments. For richer undecidable fragments, we discuss conditions under which our procedure is refutationally complete. We also describe useful heuristics based on model checking for prioritizing or avoiding instantiations. 1
Keyphrases
quantified formula complete instantiation satisfiabiliby modulo theory undecidable fragment long-standing challenge useful heuristic satisfiability modulo theory first order logic modulo theory pure first-order logic practical method present several decidable fragment satisfiable formula modern smt solver
