In this paper we study interpolation in local extensions of a base theory. Weidentify situations in which it is possible to obtain interpolants in ahierarchical manner, by using a prover and a procedure for generatinginterpolants in the base theory as black-boxes. We present several examples oftheory extensions in which interpolants can be computed this way, and discussapplications in verification, knowledge representation, and modular reasoningin combinations of local theories.Comment: 31 pages, 1 figur
\section*{Abstract} Verification problems are often expressed in a language which mixes several t...
We generalise and clarify connections between variants of modularity (preservation of faithfulness) ...
We generalise and clarify connections between variants of modularity (preservation of faithfulness) ...
In this paper we study interpolation in local extensions of a base theory. We identify situations i...
In this paper we study interpolation in local extensions of a base theory. We identify situations in...
In this paper we study interpolation in local extensions of a base theory. We identify situations in...
Many problems in mathematics and computer science (e.g. in verification, or when reasoning in and ab...
Many problems in mathematics and computer science (e.g. in verification, or when reasoning in and ab...
Many problems in mathematics and computer science (e.g. in verification, or when reasoning in and a...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
Many problems in mathematics and computer science can be reduced to proving the satisfiability of co...
We present new concepts and techniques to generate interpolants from the proofs produced by SMT solv...
Verification problems are often expressed in a language which mixes several theories. A natural ques...
\section*{Abstract} Verification problems are often expressed in a language which mixes several t...
We generalise and clarify connections between variants of modularity (preservation of faithfulness) ...
We generalise and clarify connections between variants of modularity (preservation of faithfulness) ...
In this paper we study interpolation in local extensions of a base theory. We identify situations i...
In this paper we study interpolation in local extensions of a base theory. We identify situations in...
In this paper we study interpolation in local extensions of a base theory. We identify situations in...
Many problems in mathematics and computer science (e.g. in verification, or when reasoning in and ab...
Many problems in mathematics and computer science (e.g. in verification, or when reasoning in and ab...
Many problems in mathematics and computer science (e.g. in verification, or when reasoning in and a...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
Many problems in mathematics and computer science can be reduced to proving the satisfiability of co...
We present new concepts and techniques to generate interpolants from the proofs produced by SMT solv...
Verification problems are often expressed in a language which mixes several theories. A natural ques...
\section*{Abstract} Verification problems are often expressed in a language which mixes several t...
We generalise and clarify connections between variants of modularity (preservation of faithfulness) ...
We generalise and clarify connections between variants of modularity (preservation of faithfulness) ...