Uniform interpolants were largely studied in non-classical propositional logics since the
nineties, and their connection to model completeness was pointed out in the literature. A …

Uniform interpolants have been largely studied in non-classical propositional logics since
the nineties; a successive research line within the automated reasoning community …

Abstract In ESOP 2008, Gulwani and Musuvathi introduced a notion of cover and exploited it
to handle infinite-state model checking problems. Motivated by applications to the …

Verification of Data-Aware Processes via Satisfiability Modulo Theories Page 1 123 LNBIP 470
Verification of Data-Aware Processes via Satisfiability Modulo Theories Alessandro Gianola …

Uniform interpolants were largely studied in non-classical propositional logics since the
nineties, and their connection to model completeness was pointed out in the literature. A …

We devise three strategies for recognizing admissibility of non-standard inference rules via
interpolation, uniform interpolation, and model completions. We apply our machinery to the …

In this paper we study possibilities of interpolation and symbol elimination in extensions of a
theory T_0 with additional function symbols whose properties are axiomatised using a set of …

Existing techniques for Craig interpolation for the quantifier-free fragment of the theory of
arrays are inefficient for computing sequence and tree interpolants: the solver needs to run …

Wolter in [38] proved that the Craig interpolation property transfers to fusion of normal modal
logics. It is well-known [21] that for such logics Craig interpolation corresponds to an …

In this paper, the theory of McCarthy's extensional arrays enriched with a maxdiff operation
(this operation returns the biggest index where two given arrays differ) is proposed. It is …