Paper Info
Title
Constraint Solving for Finite Model Finding in SMT Solvers.
Abstract
Satisfiability modulo theories (SMT) solvers have been used successfully as reasoning engines for automated verification and other applications based on automated reasoning. Current techniques for dealing with quantified formulas in SMT are generally incomplete, forcing SMT solvers to report "unknown" when they fail to prove the unsatisfiability of a formula with quantifiers. This inability to return counter models limits their usefulness in applications that produce queries involving quantified formulas. In this paper, we reduce these limitations by integrating finite model finding techniques based on constraint solving into the architecture used by modern SMT solvers. This approach is made possible by a novel solver for cardinality constraints, as well as techniques for on-demand instantiation of quantified formulas. Experiments show that our approach is competitive with the state of the art in SMT, and orthogonal to approaches in automated theorem proving.
Year
DOI
Venue
2017
10.1017/S1471068417000175
THEORY AND PRACTICE OF LOGIC PROGRAMMING
Keywords
DocType
Volume
Satisfiability modulo theories,finite model finding
Journal
17
Issue
ISSN
Citations 
4
1471-0684
0
PageRank 
References 
Authors
0.34
11
3
Name
Order
Citations
PageRank
Andrew Reynolds121214.79
Cesare Tinelli2140979.86
Clark Barrett31268108.65