Schemata of SMT problems
Résumé
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]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...