In this paper we study possibilities of interpolation and symbol eliminationin extensions of a theory $\mathcal{T}_0$ with additional function symbolswhose properties are axiomatised using a set of clauses. We analyze situationsin which we can perform such tasks in a hierarchical way, relying on existingmechanisms for symbol elimination in $\mathcal{T}_0$. This is for instancepossible if the base theory allows quantifier elimination. We analyzepossibilities of extending such methods to situations in which the base theorydoes not allow quantifier elimination but has a model completion which does. Weillustrate the method on various examples
In this survey, we report our recent work concerning combination results for interpolation and unifo...
The use of interpolants in verification is gaining more and more importance. Since theories used in ...
It is shown how axiomatic specifications of Boolean Algebras with extra functions as well as proposi...
We prove several results related to local proofs, interpolation and superposition calculus and discu...
Elimination of quantifiers is shown to fail dramatically for a group of well-known mathematical theo...
An algorithm is presented which eliminates second-order quantifiers over predicate variables in form...
This paper continues the rather recent line of research on the dynamics of non-monotonic formalisms....
In this paper we study interpolation in local extensions of a base theory. We identify situations in...
The use of interpolants in verification is gaining more and more importance. Since theories used in ...
It is well known that quantifier elimination plays a relevant role in proving decidability of theori...
Abstract. It has recently been shown that proofs in which some symbols are colored (e.g. local or sp...
The use of interpolants in model checking is becoming an enabling technologyto allow fast and robust...
In previous work by Baaz and Iemhoff, a Gentzen calculus for intuitionistic logic with existence pre...
Given two inconsistent formulae, a (reverse) interpolant is a formula implied by one, inconsistent w...
Abstract. We show methods to construct, and give examples of, consistent intuitionistic theories tha...
In this survey, we report our recent work concerning combination results for interpolation and unifo...
The use of interpolants in verification is gaining more and more importance. Since theories used in ...
It is shown how axiomatic specifications of Boolean Algebras with extra functions as well as proposi...
We prove several results related to local proofs, interpolation and superposition calculus and discu...
Elimination of quantifiers is shown to fail dramatically for a group of well-known mathematical theo...
An algorithm is presented which eliminates second-order quantifiers over predicate variables in form...
This paper continues the rather recent line of research on the dynamics of non-monotonic formalisms....
In this paper we study interpolation in local extensions of a base theory. We identify situations in...
The use of interpolants in verification is gaining more and more importance. Since theories used in ...
It is well known that quantifier elimination plays a relevant role in proving decidability of theori...
Abstract. It has recently been shown that proofs in which some symbols are colored (e.g. local or sp...
The use of interpolants in model checking is becoming an enabling technologyto allow fast and robust...
In previous work by Baaz and Iemhoff, a Gentzen calculus for intuitionistic logic with existence pre...
Given two inconsistent formulae, a (reverse) interpolant is a formula implied by one, inconsistent w...
Abstract. We show methods to construct, and give examples of, consistent intuitionistic theories tha...
In this survey, we report our recent work concerning combination results for interpolation and unifo...
The use of interpolants in verification is gaining more and more importance. Since theories used in ...
It is shown how axiomatic specifications of Boolean Algebras with extra functions as well as proposi...