Automatic Generation of Numerical Redundancies for Non-Linear Constraint Solving

Reliable Computing

Volumn 3, Issue 3, 1997, Pages 335-344

  Benhamou, Frédéric ^a   Granvilliers, Laurent ^a  

^a UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000947811     PISSN: 13853139     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009943413814     Document Type: Article

References (21)

1. Alefeld, G. and Herzberger, J.: Introduction to Interval Computations, Academic Press, 1983.
2. Benhamou, F.: Heterogeneous Constraint Solving, in: Proceedings of ALP'96, volume 1139 of LNCS, Springer-Verlag, Aachen, Germany, 1996, pp. 62-76.
3. Benhamou, F. and Granvilliers, L.: Combining Local Consistency, Symbolic Rewriting and Interval Methods, in: Proceedings of AISMC-3, volume 1138 of LNCS, Springer-Verlag, Steyr, Austria, 1996, pp. 144-159.
4. Benhamou, F., McAllester, D., and Van Hentenryck, P.: CLP (Intervals) Revisited, in: Proceedings of ILPS'94, Ithaca, NY, USA, 1994.
5. Benhamou, F. and Older, W. J: Applying Interval Arithmetic to Real, Integer and Boolean Constraints, Journal of Logic Programming (1997) (to appear).
6. Bini, D. and Mourrain, B.: Handbook of Polynomial Systems, 1996.
7. Buchberger, B.: Gröbner Bases: an Algorithmic Method in Polynomial Ideal Theory, in: Multidimensional Systems Theory, D. Reidel Publishing Company, 1985, pp. 184-232.
8. Colmerauer, A.: Specifications of Prolog IV, Draft, 1996.
9. Cox, D., Little, J., and O'Shea, D.: Ideals, Varieties and Algorithms, Springer-Verlag, 1992.
10. Granlund, T.: GNU Multiple Precision Arithmetic Library, edition 2.0, 1996.
11. Hansen, E. R. and Sengupta, S.: Bounding Solutions of Systems of Equations Using Interval Analysis, BIT 21 (1981), pp. 203-211.
12. Kearfott, R. B.: Some Tests of Generalized Bisection, ACM Transactions on Mathematical Software 13 (3) (1987), pp. 197-220.
13. Krawczyk, R.: A Class of Interval Newton Operators, Computing 37 (1986), pp. 179-183.
14. Mackworth, A.: Consistency in Networks of Relations, Artificial Intelligence 8 (1) (1977), pp. 99-118.
15. Montanari, U.: Networks of Constraints: Fundamental Properties and Applications to Picture Processing, Information Science 7 (2) (1974), pp. 95-132.
16. Moore, R. H.: Interval Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1966.
17. Morgan, A. and Sommese, A.: Homotopy Methods for Polynomial Systems, Applied Mathematics and Computation 24 (1987), pp. 115-138.
18. Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, 1990.
19. Older, W. and Vellino, A.: Constraint Arithmetic on Real Intervals, in: Benhamou, F. and Colmerauer, A. (eds), Constraint Logic Programming: Selected Research, MIT Press, 1993.
20. Van Hentenryck, P., McAllester, D., and Kapur, D.: Solving Polynomial Systems Using a Branch and Prune Approach, SIAM Journal on Numerical Analysis (1997) (to appear).
21. Winkler, F.: Polynomial Algorithms in Computer Algebra, Springer-Verlag, 1996.