SMT Solving Modulo Tableau and Rewriting Theories - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

SMT Solving Modulo Tableau and Rewriting Theories

Résumé

We propose an automated theorem prover that combines an SMT solver with tableau calculus and rewriting. Tableau inference rules are used to unfold propositional content into clauses while atomic formulas are handled using satisfiability decision procedures as in traditional SMT solvers. To deal with quantified first order formulas, we use metavariables and perform rigid unification modulo equalities and rewriting, for which we introduce an algorithm based on superposition, but where all clauses contain a single atomic formula. Rewriting is introduced along the lines of deduction modulo theory, where axioms are turned into rewrite rules over both terms and propositions. Finally, we assess our approach over a benchmark of problems in the set theory of the B method.
Fichier principal
Vignette du fichier
archsat.pdf (572.72 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02083232 , version 1 (28-03-2019)

Identifiants

  • HAL Id : hal-02083232 , version 1

Citer

Guillaume Bury, Simon Cruanes, David Delahaye. SMT Solving Modulo Tableau and Rewriting Theories. SMT 2018 - 16th International Workshop on Satisfiability Modulo Theories, Jul 2018, Oxford, United Kingdom. ⟨hal-02083232⟩
183 Consultations
263 Téléchargements

Partager

Gmail Facebook X LinkedIn More