Instantiation of SMT problems modulo integers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6167 LNAI, Issue , 2010, Pages 49-63

  Echenim, Mnacho ^a   Peltier, Nicolas ^a  

^a UNIV GRENOBLE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION PROCEDURE; LINEAR ARITHMETIC;

DECISION THEORY;

EID: 77954874195     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14128-7_6     Document Type: Conference Paper

References (17)

1. Abadi, A., Rabinovich, A., Sagiv, M.: Decidable fragments of many-sorted logic. Journal of Symbolic Computation 45(2), 153-172 (2010)
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)
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)
4. Armando, A., Ranise, S., Rusinowitch, M.: A rewriting approach to satisfiability procedures. Information and Computation 183(2), 140-164 (2003)
5. Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation 3(4), 217-247 (1994)
6. Bachmair, L., Ganzinger, H., Waldmann, U.: Refutational theorem proving for hierachic first-order theories. Appl. Algebra. Eng. Commun. Comput. 5, 193-212 (1994)
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)
8. Bonacina, M.P., Echenim, M.: On variable-inactivity and polynomial Tsatisfiability procedures. J. of Logic and Computation 18(1), 77-96 (2008)
9. Bonacina, M.P., Echenim, M.: Theory decision by decomposition. Journal of Symbolic Computation 45(2), 229-260 (2010)
10. Bradley, A.R., Manna, Z.: The Calculus of Computation: Decision Procedures with Applications to Verification. Springer, New York (2007)
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. Ganzinger, H., Korovin, K.: Integrating equational reasoning into instantiationbased theorem proving. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.3210, pp. 71-84. Springer, Heidelberg (2004)
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)
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)
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)
16. Lee, S., Plaisted, D.A.: Eliminating duplication with the hyper-linking strategy. Journal of Automated Reasoning 9, 25-42 (1992)
17. Plaisted, D.A., Zhu, Y.: Ordered semantic hyperlinking. Journal of Automated Reasoning 25(3), 167-217 (2000)