Instantiation of SMT Problems Modulo Integers

  • Mnacho Echenim
  • Nicolas Peltier
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6167)

Abstract

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 \(\mathcal{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 \(\mathcal{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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abadi, A., Rabinovich, A., Sagiv, M.: Decidable fragments of many-sorted logic. Journal of Symbolic Computation 45(2), 153–172 (2010)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Althaus, E., Kruglov, E., Weidenbach, C.: Superposition modulo linear arithmetic sup(la). In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS, vol. 5749, pp. 84–99. Springer, Heidelberg (2009)Google Scholar
  3. 3.
    Armando, A., Bonacina, M.P., Ranise, S., Schulz, S.: New results on rewrite-based satisfiability procedures. ACM Transactions on Computational Logic 10(1), 129–179 (2009)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Armando, A., Ranise, S., Rusinowitch, M.: A rewriting approach to satisfiability procedures. Information and Computation 183(2), 140–164 (2003)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation 3(4), 217–247 (1994)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Bachmair, L., Ganzinger, H., Waldmann, U.: Refutational theorem proving for hierachic first-order theories. Appl. Algebra. Eng. Commun. Comput. 5, 193–212 (1994)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Barrett, C., Sebastiani, R., Seshia, S., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, ch. 26, vol. 185, pp. 825–885. IOS Press, Amsterdam (2009)Google Scholar
  8. 8.
    Bonacina, M.P., Echenim, M.: On variable-inactivity and polynomial T-satisfiability procedures. J. of Logic and Computation 18(1), 77–96 (2008)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Bonacina, M.P., Echenim, M.: Theory decision by decomposition. Journal of Symbolic Computation 45(2), 229–260 (2010)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Bradley, A.R., Manna, Z.: The Calculus of Computation: Decision Procedures with Applications to Verification. Springer, New York (2007)MATHGoogle Scholar
  11. 11.
    Echenim, M., Peltier, N.: A new instantiation scheme for Satisfiability Modulo Theories. Technical report, LIG, CAPP group (2009), http://membres-lig.imag.fr/peltier/rr-smt.pdf
  12. 12.
    Ganzinger, H., Korovin, K.: Integrating equational reasoning into instantiation-based theorem proving. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 71–84. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  13. 13.
    Ge, Y., de Moura, L.M.: Complete instantiation for quantified formulas in satisfiabiliby modulo theories. In: Bouajjani, A., Maler, O. (eds.) Computer Aided Verification. LNCS, vol. 5643, pp. 306–320. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  14. 14.
    Ghilardi, S., Nicolini, E., Ranise, S., Zucchelli, D.: Decision procedures for extensions of the theory of arrays. Ann. Math. Artif. Intell. 50(3-4), 231–254 (2007)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Korovin, K., Voronkov, A.: Integrating linear arithmetic into superposition calculus. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 223–237. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  16. 16.
    Lee, S., Plaisted, D.A.: Eliminating duplication with the hyper-linking strategy. Journal of Automated Reasoning 9, 25–42 (1992)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Plaisted, D.A., Zhu, Y.: Ordered semantic hyperlinking. Journal of Automated Reasoning 25(3), 167–217 (2000)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Mnacho Echenim
    • 1
  • Nicolas Peltier
    • 1
  1. 1.University of Grenoble (LIG, Grenoble INP/CNRS) 

Personalised recommendations