Modularity results for interpolation, amalgamation and superamalgamation

Ghilardi, Silvio; Gianola, Alessandro

doi:10.1016/j.apal.2018.04.001

Cited by 16 publications

(11 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(all such theories are encompassed by the general notion of an 'index theory'). Such a combination is non trivial because it is a non disjoint combination (the ordering relation is in the shared signature) and does not fulfill the T 0 -compatibility requirements of [17,19,18] needed in order to modularly import satisfiability and interpolation algorithms from the component theories.…”

Section: Conclusion and Further Workmentioning

confidence: 99%

Interpolation and Amalgamation for Arrays with MaxDiff

Ghilardi

Gianola

Kapur

2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

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 known from the literature that a diff operation is required for the theory of arrays in order to enjoy the Craig interpolation property at the quantifier-free level. However, the diff operation introduced in the literature is merely instrumental to this purpose and has only a purely formal meaning (it is obtained from the Skolemization of the extensionality axiom). Our maxdiff operation significantly increases the level of expressivity; however, obtaining interpolation results for the resulting theory becomes a surprisingly hard task. We obtain such results via a thorough semantic analysis of the models of the theory and of their amalgamation properties. The results are modular with respect to the index theory and it is shown how to convert them into concrete interpolation algorithms via a hierarchical approach.

show abstract

Section: Conclusion and Further Workmentioning

confidence: 99%

Interpolation and Amalgamation for Arrays with MaxDiff

Ghilardi

Gianola

Kapur

2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Proofs are omitted (sometimes in favor of intuitive justifications); however, they can all be found in the original papers. More precisely, proofs of the results from Section 3 are in [36], proofs of the results from Section 4 are in [37], and proofs of the results from Section 5 are in [31,32,[38][39][40].…”

Section: Structure Of the Papermentioning

confidence: 99%

“…A crucial notion here is T 0 -compatibility [56], which we are going to introduce in the following. This section is based on the results presented in [37,57].…”

Section: Non-disjoint Combinationsmentioning

confidence: 99%

See 1 more Smart Citation

Interpolation and Uniform Interpolation in Quantifier-Free Fragments of Combined First-Order Theories

Ghilardi

Gianola

2022

Mathematics

Self Cite

View full text Add to dashboard Cite

In this survey, we report our recent work concerning combination results for interpolation and uniform interpolation in the context of quantifier-free fragments of first-order theories. We stress model-theoretic and algebraic aspects connecting this topic with amalgamation, strong amalgamation, and model-completeness. We give sufficient (and, in relevant situations, also necessary) conditions for the transfer of the quantifier-free interpolation property to combined first-order theories; we also investigate the non-disjoint signature case under the assumption that the shared theory is universal Horn. For convex, strong-amalgamating, stably infinite theories over disjoint signatures, we also provide a modular transfer result for the existence of uniform interpolants. Model completions play a key role in the whole paper: They enter into transfer results in the non-disjoint signature case and also represent a semantic counterpart of uniform interpolants.

show abstract

“…Interestingly, model completeness has other well-known applications in computer science. It has been applied: (i) to reveal interesting connections between temporal logic and monadic second-order logic [29,30]; (ii) in automated reasoning to design complete algorithms for constraint satisfiability in combined theories over non-disjoint signatures [1,23,31,[49][50][51]; (iii) again in automated reasoning in relationship with interpolation and symbol elimination [59,60]; (iv) in modal logic and in software verification theories [24,25], to obtain combined interpolation results.…”

Section: Introductionmentioning

confidence: 99%

Model Completeness, Uniform Interpolants and Superposition Calculus

et al. 2021

Self Cite

View full text Add to dashboard Cite

Uniform 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 infinite state systems. This was first pointed out in ESOP 2008 by Gulwani and Musuvathi, and then by the authors of the present contribution in the context of recent applications to the verification of data-aware processes. In this paper, we show how covers are strictly related to model completions, a well-known topic in model theory. We also investigate the computation of covers within the Superposition Calculus, by adopting a constrained version of the calculus and by defining appropriate settings and reduction strategies. In addition, we show that computing covers is computationally tractable for the fragment of the language used when tackling the verification of data-aware processes. This observation is confirmed by analyzing the preliminary results obtained using the mcmt tool to verify relevant examples of data-aware processes. These examples can be found in the last version of the tool distribution.

show abstract

Modularity results for interpolation, amalgamation and superamalgamation

Cited by 16 publications

References 32 publications

Interpolation and Amalgamation for Arrays with MaxDiff

Interpolation and Amalgamation for Arrays with MaxDiff

Interpolation and Uniform Interpolation in Quantifier-Free Fragments of Combined First-Order Theories

Model Completeness, Uniform Interpolants and Superposition Calculus

Contact Info

Product

Resources

About