A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Model Completeness, Uniform Interpolants and Superposition Calculus
2021
Journal of automated reasoning
AbstractUniform interpolants have been largely studied in non-classical propositional logics since the nineties; a successive research line within the automated reasoning community investigated uniform quantifier-free interpolants (sometimes referred to as "covers") in first-order theories. This further research line is motivated by the fact that uniform interpolants offer an effective solution to tackle quantifier elimination and symbol elimination problems, which are central in model checking
doi:10.1007/s10817-021-09596-x
fatcat:zwbdnvp4f5drpdhimvutlvofke