Arrow Research search
Back to LPAR

LPAR 2013

Tree Interpolation in Vampire

Conference Paper Accepted Paper Artificial Intelligence · Logic in Computer Science

Abstract

Abstract We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Archive span
1992-2024
Indexed papers
780
Paper id
1116833003954442012
v2026.09.13