Computer Science – Logic in Computer Science
Scientific paper
2002-11-14
Computer Science
Logic in Computer Science
Scientific paper
Let a quantified inequality constraint over the reals be a formula in the first-order predicate language over the structure of the real numbers, where the allowed predicate symbols are $\leq$ and $<$. Solving such constraints is an undecidable problem when allowing function symbols such $\sin$ or $\cos$. In the paper we give an algorithm that terminates with a solution for all, except for very special, pathological inputs. We ensure the practical efficiency of this algorithm by employing constraint programming techniques.
No associations
LandOfFree
Efficient Solving of Quantified Inequality Constraints over the Real Numbers 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 Efficient Solving of Quantified Inequality Constraints over the Real Numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Solving of Quantified Inequality Constraints over the Real Numbers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-473523