An Instantiation Scheme for Satisfiability Modulo Theories - CAPP Accéder directement au contenu
Article Dans Une Revue Journal of Automated Reasoning Année : 2012

An Instantiation Scheme for Satisfiability Modulo Theories

Résumé

State-of-the-art theory solvers generally rely on an instantiation of the axioms of the theory, and depending on the solvers, this instantiation is more or less explicit. This paper introduces a generic instantiation scheme for solving SMT problems, along with syntactic criteria to identify the classes of clauses for which it is complete. The instantiation scheme itself is simple to implement, and we have produced an implementation of the syntactic criteria that guarantee a given set of clauses can be safely instantiated. We used our implementation to test the completeness of our scheme for several theories of interest in the SMT community, some of which are listed in the last section of this paper.

Dates et versions

hal-00933247 , version 1 (20-01-2014)

Identifiants

Citer

Mnacho Echenim, Nicolas Peltier. An Instantiation Scheme for Satisfiability Modulo Theories. Journal of Automated Reasoning, 2012, 48 (3), pp.293-362. ⟨10.1007/s10817-010-9200-3⟩. ⟨hal-00933247⟩
56 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More