Introduction |

Solving quantified constraints has applications in numerous fields (e.g., control theory [1][14][13][7], stability analysis [16][22][17][23][11][10], electrical Engineering [24], and others [6][26][18][2][12][9]). However, classical methods for their solution [25][4][5] have various drawbacks:

- They are too slow for big examples,
- they often generate huge output, and
- they do not provide partial information before computing the total result.

This software package is based on an algorithm [21] that try to solve the above problems by computing approximate solutions up to a user-provided error bound. It uses various sub-algorithms from the area of interval computation [19][20][15] and constraint programming [8].

Introduction |