We present a formally verified quantifier elimination procedure for the first order theory over linear mixed real-integer arithmetics in higher-order logic based on a work by Weispfenning. To this end we provide two verified quantifier elimination procedures: for Presburger arithmitics and for linear real arithmetics
Abstract. We present a fully proof-producing implementation of a quantifier elimination procedure fo...
AbstractWhen investigating the complexity of cut-elimination in first-order logic, a natural subprob...
We consider a first-order logic for the integers with addition. This logicextends classical first-or...
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This alg...
This article formalizes quantifier elimination procedures for dense linear orders, linear real arith...
We present an implementation and verification in higher-order logic of Cooper’s quantifier eliminati...
This series of papers presents a complete development and complexity analysis of a decision method, ...
An algorithm is presented which eliminates second-order quantifiers over predicate variables in form...
An elimination result for mixed real-integer systems of linear equa-tions is established, and used t...
In this paper we give a new algorithm for quantifier elimination in the first order theory of real c...
We consider the integers using the language of ordered rings extended by ternary symbols for congrue...
We develop quantifier elimination procedures for a fragment of higher order logic arising from the f...
. In this paper, we present methods for eliminating higher-order quantifiers in proof goals arising ...
This paper gives a thorough overview of what is known about first-order logic with counting quantif...
We formalize a multivariate quantifier elimination (QE) algorithm in the theorem prover Isabelle/HOL...
Abstract. We present a fully proof-producing implementation of a quantifier elimination procedure fo...
AbstractWhen investigating the complexity of cut-elimination in first-order logic, a natural subprob...
We consider a first-order logic for the integers with addition. This logicextends classical first-or...
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This alg...
This article formalizes quantifier elimination procedures for dense linear orders, linear real arith...
We present an implementation and verification in higher-order logic of Cooper’s quantifier eliminati...
This series of papers presents a complete development and complexity analysis of a decision method, ...
An algorithm is presented which eliminates second-order quantifiers over predicate variables in form...
An elimination result for mixed real-integer systems of linear equa-tions is established, and used t...
In this paper we give a new algorithm for quantifier elimination in the first order theory of real c...
We consider the integers using the language of ordered rings extended by ternary symbols for congrue...
We develop quantifier elimination procedures for a fragment of higher order logic arising from the f...
. In this paper, we present methods for eliminating higher-order quantifiers in proof goals arising ...
This paper gives a thorough overview of what is known about first-order logic with counting quantif...
We formalize a multivariate quantifier elimination (QE) algorithm in the theorem prover Isabelle/HOL...
Abstract. We present a fully proof-producing implementation of a quantifier elimination procedure fo...
AbstractWhen investigating the complexity of cut-elimination in first-order logic, a natural subprob...
We consider a first-order logic for the integers with addition. This logicextends classical first-or...
DOI
Add to ORKG