Modular instantiation schemes

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.

[1]  Nikolaj Bjørner,et al.  Efficient E-Matching for SMT Solvers , 2007, CADE.

[2]  Harald Ganzinger,et al.  New directions in instantiation-based theorem proving , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[3]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[4]  Calogero G. Zarba,et al.  Combining Nonstably Infinite Theories , 2005, Journal of Automated Reasoning.

[5]  Nicolas Peltier,et al.  An Instantiation Scheme for Satisfiability Modulo Theories , 2010, Journal of Automated Reasoning.

[6]  David A. Plaisted,et al.  Ordered Semantic Hyper-Linking , 1997, Journal of Automated Reasoning.

[7]  Cesare Tinelli,et al.  Solving quantified verification conditions using satisfiability modulo theories , 2007, Annals of Mathematics and Artificial Intelligence.

[8]  Silvio Ghilardi,et al.  Decision procedures for extensions of the theory of arrays , 2007, Annals of Mathematics and Artificial Intelligence.

[9]  Cesare Tinelli,et al.  Satisfiability Modulo Theories , 2021, Handbook of Satisfiability.

[10]  Theo Tryfonas,et al.  Frontiers in Artificial Intelligence and Applications , 2009 .

[11]  Henny B. Sipma,et al.  What's Decidable About Arrays? , 2006, VMCAI.

[12]  Nicolas Peltier,et al.  Instantiation of SMT problems modulo integers , 2010, AISC'10/MKM'10/Calculemus'10.

[13]  Nikolaj Bjørner,et al.  Satisfiability Modulo Theories: An Appetizer , 2009, SBMF.

[14]  Peter Baumgartner,et al.  The Model Evolution Calculus , 2003, CADE.

[15]  Rüdiger Loos,et al.  Applying Linear Quantifier Elimination , 1993, Comput. J..

[16]  Leonardo Mendonça de Moura,et al.  Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories , 2009, CAV.

[17]  Cesare Tinelli,et al.  A New Correctness Proof of the {Nelson-Oppen} Combination Procedure , 1996, FroCoS.

[18]  Alexander Moshe Rabinovich,et al.  Decidable fragments of many-sorted logic , 2010, J. Symb. Comput..

[19]  Viorica Sofronie-Stokkermans,et al.  Hierarchic Reasoning in Local Theory Extensions , 2005, CADE.