Schemata of SMT problems

Vincent Aravantinos (1) , Nicolas Peltier (1)

1 LIG - Laboratoire d'Informatique de Grenoble

A logic is devised for reasoning about iterated schemata of SMT problems. The satisfiability problem is shown to be undecidable for this logic, but we present a proof procedure that is sound, complete w.r.t. satisfiability and terminating for a precisely characterized class of problems. It is parameterized by an external procedure (used as a black box) for testing the satisfiability of ground instances of the schema in the considered theory (e.g. integers, reals etc.).

Domaines: Logique en informatique [cs.LO]

Vincent Aravantinos, Nicolas Peltier. Schemata of SMT problems. TABLEAUX 2011 - International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Jul 2011, Bern, Switzerland. pp.27-42, ⟨10.1007/978-3-642-22119-4_5⟩. ⟨hal-00931443⟩