In this paper we study interpolation in local extensions of a base theory. We identify situations in which it is possible to obtain interpolants in a hierarchical manner, by using a prover and a procedure for generating interpolants in the base theory as black-boxes. We present several examples of theory extensions in which interpolants can be computed this way, and discuss applications in verification, knowledge representation, and modular reasoning in combinations of local theories
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
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 i...
In this paper we study interpolation in local extensions of a base theory. Weidentify 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...
Verification problems are often expressed in a language which mixes several theories. A natural ques...
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
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 i...
In this paper we study interpolation in local extensions of a base theory. Weidentify 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...
Verification problems are often expressed in a language which mixes several theories. A natural ques...
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...