Computer Science – Logic in Computer Science
Scientific paper
2010-06-15
Computer Science
Logic in Computer Science
Research report, long version of our AISC 2010 paper
Scientific paper
Many decision procedures for SMT problems rely more or less implicitly on an instantiation of the axioms of 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.
Echenim Mnacho
Peltier Nicolas
No associations
LandOfFree
Instantiation of SMT problems modulo Integers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Instantiation of SMT problems modulo Integers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Instantiation of SMT problems modulo Integers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-104563