Computer Science – Logic in Computer Science
Scientific paper
2008-03-11
Computer Science
Logic in Computer Science
accepted at LPAR '08
Scientific paper
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutine satisfiability modulo this theory, a problem for which there are several implementations available. The quantifier elimination algorithm presented in the paper is compared, on examples arising from program analysis problems, to several other implementations, all of which cannot solve some of the examples that our algorithm solves easily.
No associations
LandOfFree
A Quantifier Elimination Algorithm for Linear Real Arithmetic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Quantifier Elimination Algorithm for Linear Real Arithmetic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Quantifier Elimination Algorithm for Linear Real Arithmetic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-285852