# Uniform Interpolants in EUF: Algorithms using DAG-representations

@article{Ghilardi2022UniformII,
title={Uniform Interpolants in EUF: Algorithms using DAG-representations},
author={Silvio Ghilardi and Alessandro Gianola and Deepak Kapur},
journal={Log. Methods Comput. Sci.},
year={2022},
volume={18}
}
• Published 22 February 2020
• Computer Science
• Log. Methods Comput. Sci.
. The concept of uniform interpolant for a quantiﬁer-free formula from a given formula with a list of symbols, while well-known in the logic literature, has been unknown to the formal methods and automated reasoning community for a long time. This concept is precisely deﬁned. Two algorithms for computing quantiﬁer-free uniform interpolants in the theory of equality over uninterpreted symbols ( EUF ) endowed with a list of symbols to be eliminated are proposed. The ﬁrst algorithm is non…
2 Citations

## Figures from this paper

Combination of Uniform Interpolants via Beth Definability
• Computer Science
Journal of Automated Reasoning
• 2022
It is proved that, for convex theories, cover algorithms can be transferred to theory combinations under the same hypothesis needed to transfer quantifier-free interpolation (i.e., the equality interpolating property, aka strong amalgamation property).

## References

SHOWING 1-10 OF 38 REFERENCES
Computing Uniform Interpolants for EUF via (conditional) DAG-based Compact Representations
• Computer Science
CILC
• 2020
Two algorithms for computing the uniform interpolant of a quantifier-free formula in EUF endowed with a list of symbols to be eliminated are proposed, using arguments combining rewrite techniques with model theory.
Model Completeness, Uniform Interpolants and Superposition Calculus
• Computer Science
J. Autom. Reason.
• 2021
It is shown how covers are strictly related to model completions, a well-known topic in model theory, and it is shown that computing covers is computationally tractable for the fragment of the language used when tackling the verification of data-aware processes.
On Interpolation in Automated Theorem Proving
• Computer Science
Journal of Automated Reasoning
• 2014
An interpolation system for non-ground refutations is obtained, and it is proved that it is complete, if the only non-shared symbols in provisional interpolants are constants.
Interpolation Systems for Ground Proofs in Automated Deduction: a Survey
• Computer Science
Journal of Automated Reasoning
• 2015
This work surveys color-based interpolation systems for ground proofs produced by key inference engines of state-of-the-art solvers: DPLL for propositional logic, equality sharing for combination of convex theories, and DPLL(T$\mathcal {T}$) for SMT-solving.
Interpolant Strength Revisited
A parametrised interpolation system which subsumes existing interpolation methods for propositional resolution proofs and enables the systematic variation of the logical strength and the elimination of non-essential variables in interpolants is generalised.
Combined Covers and Beth Definability
• Computer Science
IJCAR
• 2020
It is proved that, for convex theories, cover algorithms can be transferred to theory combinations under the same hypothesis needed to transfer quantifier-free interpolation (i.e., the equality interpolating property, aka strong amalgamation property).
Interpolant Strength
• Computer Science
VMCAI
• 2010
This work presents a system for constructing propositional interpolants of different strength from a resolution refutation, which subsumes existing methods and allows interpolation systems to be ordered by the logical strength of the obtained interpolants.
Playing in the grey area of proofs
• Computer Science, Mathematics
POPL '12
• 2012
The main contribution of this paper is a technique of minimising interpolants based on transformations of what is called the "grey area" of local proofs, which applies to arbitrary theories.
Interpolation for data structures
• Computer Science
SIGSOFT '06/FSE-14
• 2006
This work presents efficient procedures to construct interpolants for the theories of arrays, sets, and multisets using the reduction approach for obtaining decision procedures for complex data structures.
Constructing Craig Interpolation Formulas
This paper gives an efficient method for constructing a Craig interpolant from a refutation proof which involves binary resolution, paramodulation, and factoring that can solve the machine learning problem of discovering a first order concept from given examples.