Combination of Nonlinear Terms in Interval Constraint Satisfaction Techniques - Artificial Intelligence and Symbolic Computation - page 131

Acknowledgements
Frederic Goualard is gratefully acknowledged for his comments on a previous
version of this paper.
References
1. F. Benhamou and L. Granvilliers. Automatic Generation of Numerical Redundan-
cies for Non-Linear Constraint Solving. Reliable Computing, 3(3):335-344, 1997.
2. F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(Intervals) Revisited.
In M. Bruynooghe, editor, Proceedings of International Symposium on Logic Pro-
gramming, pages 124-138, Ithaca, USA, 1994. MIT Press.
3. A. Bockmayr and V. Weispfenning. Handbook of Automated Reasoning, chapter
Solving Numerical Constraints, pages 753-842. Elsevier Science Publishers, 2001.
4. P. Borovansky, C. Kirchner, H. Kirchner, and P.-E. Moreau. ELAN from a rewriting
logic point of view. Theoretical Computer Science, 285(2):155-185, 2002.
5. B. Buchberger. Grobner Bases: an Algorithmic Method in Polynomial Ideal The-
ory. In N. K. Bose, editor, Multidimensional Systems Theory, pages 184-232. D.
Reidel Publishing Company, 1985.
6. L. Granvilliers. On the Combination of Interval Constraint Solvers. Reliable Com-
puting, 7(6):467-483, 2001.
7. L. Granvilliers and F. Benhamou. Progress in the Solving of a Circuit Design
Problem. Journal of Global Optimization, 20(2):155-168, 2001.
8. L. Granvilliers, E. Monfroy, and F. Benhamou. Symbolic-Interval Cooperation
in Constraint Programming. In G. Villard, editor, Proceedings of International
Symposium on Symbolic and Algebraic Computation, pages 150-166. ACM Press,
2001.
9. T. J. Hickey, Q. Ju, and M. H. Van Emden. Interval Arithmetic: From Principles to
Implementation. Journal of the Association for Computing Machinery, 48(5):1038-
1068, 2001.
10. Institute of Electrical and Electronics Engineers. IEEE Standard for Binary
Floating-Point Arithmetic, 1985. IEEE Std 754-1985, Rearmed 1990.
11. R. B. Kearfott and M. Novoa. Intbis: A Portable Interval Newton/Bisection Pack-
age. ACM Transactions on Mathematical Software, 2(16):152-157, 1990.
12. O. Lhomme. Consistency Techniques for Numeric CSPs. In R. Bajcsy, editor,
Proceedings of International Joint Conference on Artificial Intelligence, pages 232-
238, Chambery, France, 1993. Morgan Kaufman.
13. A. K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence,
8(1):99-118, 1977.
14. R. E. Moore. Interval Analysis. Prentice-Hall, Englewood Cliffs, NJ, 1966.
15. J. J. More, B. S. Garbow, and K. E. Hillstrom. Testing Unconstrained Optimiza-
tion Software. ACM Transactions on Mathematical Software, 7(1):17-41, 1981.
16. M. H. Van Emden. Algorithmic Power from Declarative Use of Redundant Con-
straints. Constraints, 4(4):363-381, 1999.
17. P. Van Hentenryck, L. Michel, and Y. Deville. Numerica: a Modeling Language
for Global Optimization. MIT Press, 1997.