Abstract
Given a theory τ and two formulas A and B jointly unsatisfiable in τ, a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by A and B, (ii) it is entailed by A in τ, and (iii) it is unsatisfiable with B in τ. Theory interpolants are used in model checking to accelerate the computation of reachability relations. We present a novel method for computing ground interpolants for ground formulas in the theory of equality. Our algorithm computes interpolants from colored congruence graphs representing derivations in the theory of equality. These graphs can be produced by conventional congruence closure algorithms in a straightforward manner. By working with graphs, rather than at the level of individual proof steps, we are able to derive interpolants that are pleasingly simple (conjunctions of Horn clauses) and smaller than those generated by other tools. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Fuchs, A., Goel, A., Grundy, J., Krstić, S., & Tinelli, C. (2009). Ground interpolation for the theory of equality. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5505 LNCS, pp. 413–427). Springer Verlag. https://doi.org/10.1007/978-3-642-00768-2_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.