Theory decision by decomposition

  title={Theory decision by decomposition},
  author={Maria Paola Bonacina and Mnacho Echenim},
  journal={J. Symb. Comput.},
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 firstorder 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… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS


Publications referenced by this paper.
Showing 1-10 of 52 references

Boolean combination of difference constraints

  • A. Armando, S. Ranise, M. Rusinowitch
  • 2003
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…