Modular instantiation schemes

Authors:
Mnacho Echenim;Nicolas Peltier
Affiliations:
Ensimag/CNRS, Laboratory of Informatics of Grenoble, France;Ensimag/CNRS, Laboratory of Informatics of Grenoble, France
Venue:
Information Processing Letters
Year:
2011

Citing 9
Cited 1

Ordered Semantic Hyper-Linking

Journal of Automated Reasoning
New Directions in Instantiation-Based Theorem Proving

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Combining Nonstably Infinite Theories

Journal of Automated Reasoning
Decision procedures for extensions of the theory of arrays

Annals of Mathematics and Artificial Intelligence
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
Satisfiability Modulo Theories: An Appetizer

Formal Methods: Foundations and Applications
What's decidable about arrays?

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
An Instantiation Scheme for Satisfiability Modulo Theories

Journal of Automated Reasoning

Instantiation Schemes for Nested Theories

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.89

Visualization

Abstract

Instantiation schemes are proof procedures that test the satisfiability of clause sets by instantiating the variables they contain, and testing the satisfiability of the resulting ground set of clauses. Such schemes have been devised for several theories, including fragments of linear arithmetic or theories of data-structures. In this paper we investigate under what conditions instantiation schemes can be combined to solve satisfiability problems in unions of theories.