Theory decision by decomposition

• Autores: Maria Paola Bonacina, Mnacho Echenim
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 45, Nº 2, 2010, págs. 229-260
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • The topic of this article is decision procedures for satisfiability modulo theories (SMT) of arbitrary quantifier-free formulæ. We propose an approach that decomposes the formula in such a way that its definitional part, including the theory, can be compiled by a rewrite-based first-order theorem prover, and the residual problem can be decided by an SMT-solver, based on the Davis�Putnam�Logemann�Loveland procedure. The resulting decision by stages mechanism may unite the complementary strengths of first-order provers and SMT-solvers. We demonstrate its practicality by giving decision procedures for the theories of records, integer offsets and arrays, with or without extensionality, and for combinations including such theories.