F. Benhamou and F. Goualard, Universally Quantified Interval Constraints, Proceedings of International Conference on Principles and Practice of Constraint Programming, pp.67-82, 2000.
DOI : 10.1007/3-540-45349-0_7

URL : http://arxiv.org/pdf/cs/0007002v1.pdf

F. Benhamou, F. Goualard, E. Languenou, and M. Christie, Interval constraint solving for camera control and motion planning, ACM Transactions on Computational Logic, vol.5, issue.4, pp.732-767, 2004.
DOI : 10.1145/1024922.1024927

F. Benhamou and W. Older, Applying interval arithmetic to real, integer, and boolean constraints, The Journal of Logic Programming, vol.32, issue.1, pp.1-24, 1997.
DOI : 10.1016/S0743-1066(96)00142-2

J. G. Cleary, Logical arithmetic, Future Computing Systems, pp.125-149, 1987.

H. Collavizza, F. Delobel, and M. Rueher, Extending Consistent Domains of Numeric CSP, Proceedings of IJCAI, 1999.

H. Collavizza, F. Delobel, and M. Rueher, Comparing Partial Consistencies, Reliab. Comp, vol.1, pp.1-16, 1999.
DOI : 10.1007/978-94-017-1247-7_17

P. Dorato, Quantified multivariate polynomial inequalities. The mathematics of practical control design problems, IEEE Control Systems Magazine, vol.20, issue.5, pp.48-58, 2000.
DOI : 10.1109/37.872903

P. Dorato, W. Yang, and C. Abdallah, Robust Multi-Objective Feedback Design by Quantifier Elimination, Journal of Symbolic Computation, vol.24, issue.2, pp.153-159, 1997.
DOI : 10.1006/jsco.1997.0120

]. G. Fiorio, S. Malan, M. Milanese, and M. Taragna, Robust performance design of fixed structure controllers for systems with uncertain parameters, Proceedings of 32nd IEEE Conference on Decision and Control, pp.3029-3031, 1993.
DOI : 10.1109/CDC.1993.325757

D. Goldberg, What every computer scientist should know about floating-point arithmetic, ACM Computing Surveys, vol.23, issue.1, pp.5-48, 1991.
DOI : 10.1145/103162.103163

A. Goldsztejn, A branch and prune algorithm for the approximation of non-linear AE-solution sets, Proceedings of the 2006 ACM symposium on Applied computing , SAC '06, pp.1650-1654
DOI : 10.1145/1141277.1141665

URL : https://hal.archives-ouvertes.fr/hal-00481391

A. Goldsztejn and L. Jaulin, Inner and Outer Approximations of Existentially Quantified Equality Constraints, Proceedings of CP 2006, pp.198-212, 2006.
DOI : 10.1007/11889205_16

URL : https://hal.archives-ouvertes.fr/hal-00481288

L. Jaulin, I. Braems, and E. Walter, Interval methods for nonlinear identification and robust control, Proceedings of the 41st IEEE Conference on Decision and Control, 2002., pp.4676-4681, 2002.
DOI : 10.1109/CDC.2002.1185116

URL : https://hal.archives-ouvertes.fr/hal-00845884

L. Jaulin and E. Walter, Guaranteed tuning, with application to robust control and motion planning, Automatica, vol.32, issue.8, pp.1217-1221, 1996.
DOI : 10.1016/0005-1098(96)00050-7

M. Jirstand, Nonlinear Control System Design by Quantifier Elimination, Journal of Symbolic Computation, vol.24, issue.2, pp.137-152, 1997.
DOI : 10.1006/jsco.1997.0119

R. B. Kearfott, Interval Computations: Introduction, Uses, and Resources, Euromath, Bulletin, vol.2, issue.1, pp.95-112, 1996.

O. Lhomme, Consistency Techniques for Numeric CSPs, Proceedings of IJCAI 1993, pp.232-238

A. K. Mackworth, Consistency in networks of relations, Artificial Intelligence, vol.8, issue.1, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-8

S. Malan, M. Milanese, and M. Taragna, Robust Analysis and Design of Control Systems Using Interval Arithmetic**A previous version of this paper was presented at the 13th IFAC World Congress, which was held in San Francisco, CA, during 30 June-5 July, 1996. The Published Proceedings of this IFAC Meeting may be ordered from: Elsevier Science Limited, The Boulevard, Langford Lane, Kidlington, Oxford OX5 1GB, U.K. This paper was recommended for publication in revised form by Associate Editor F. Callier under the direction of Editor R.F. Curtain., Automatica, vol.33, issue.7, pp.1363-1372, 1997.
DOI : 10.1016/S0005-1098(97)00028-9

A. Neumaier, Interval Methods for Systems of Equations, 1990.
DOI : 10.1017/CBO9780511526473

S. Ratschan, Applications of Quantified Constraint Solving over the Reals Bibliography

S. Ratschan, Approximate quantified constraint solving by cylindrical box decomposition, Reliable Computing, vol.8, issue.1, pp.21-42, 2002.
DOI : 10.1023/A:1014785518570

S. Ratschan, Efficient solving of quantified inequality constraints over the real numbers, ACM Transactions on Computational Logic, vol.7, issue.4, pp.723-748, 2006.
DOI : 10.1145/1183278.1183282

X. Vu, D. Sam-haroud, and M. Silaghi, Approximation Techniques for Non-linear Problems with Continuum of Solutions, Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation, volume 2371 of LNAI, pp.224-241, 2002.
DOI : 10.1007/3-540-45622-8_17

X. Vu, M. Silaghi, D. Sam-haroud, and B. Faltings, Branch-and-prune search strategies for numerical constraint solving, 2006.

M. Zettler and J. Garloff, Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion, IEEE Transactions on Automatic Control, vol.43, issue.3, pp.425-431, 1998.
DOI : 10.1109/9.661615