Ordered Semantic Hyper-Linking
Journal of Automated Reasoning
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
Decision procedures for extensions of the theory of arrays
Annals of Mathematics and Artificial Intelligence
The Calculus of Computation: Decision Procedures with Applications to Verification
The Calculus of Computation: Decision Procedures with Applications to Verification
On Variable-inactivity and Polynomial T-Satisfiability Procedures
Journal of Logic and Computation
New results on rewrite-based satisfiability procedures
ACM Transactions on Computational Logic (TOCL)
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Decidable fragments of many-sorted logic
Journal of Symbolic Computation
Theory decision by decomposition
Journal of Symbolic Computation
Superposition modulo linear arithmetic SUP(LA)
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Integrating linear arithmetic into superposition calculus
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
An Instantiation Scheme for Satisfiability Modulo Theories
Journal of Automated Reasoning
Instantiation Schemes for Nested Theories
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Many decision procedures for SMT problems rely more or less implicitly on an instantiation of the axioms defining the theories under consideration, and differ by making use of the additional properties of each theory, in order to increase efficiency. We present a new technique for devising complete instantiation schemes on SMT problems over a combination of linear arithmetic with another theory T. The method consists in first instantiating the arithmetic part of the formula, and then getting rid of the remaining variables in the problem by using an instantiation strategy which is complete for T. We provide examples evidencing that not only is this technique generic (in the sense that it applies to a wide range of theories) but it is also efficient, even compared to state-of-the-art instantiation schemes for specific theories.