An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities

Details An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities

2008-07-15

arxiv.org/abs/0807.2269v1

Computer Science

Numerical Analysis

ACM symposium on Applied computing, Fortaleza, Ceara : Br\'esil (2008)

Scientific paper

This paper introduces a new algorithm for solving a sub-class of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified inequalities on continuous domains. This class of QCSPs has numerous applications in engineering and design. We propose here a new generic branch and prune algorithm for solving such continuous QCSPs. Standard pruning operators and solution identification operators are specialized for universally quantified inequalities. Special rules are also proposed for handling the parameters of the constraints. First experimentation show that our algorithm outperforms the state of the art methods.

Affiliated with

Also associated with

No associations

Rating

An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities 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 An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-595557