Abstract
P. Van Hentenryck et al. have designed an efficient interval constraint solver combining box consistency and Gauss-Seidel iterations, that is the core of Numerica. F. Benhamou et al. have shown that hull consistency may be faster and more accurate than box consistency. Their algorithm merges both consistency techniques taking care of the constraints’ expressions. This paper presents a new algorithm BC5 enforcing hull consistency, box consistency and the interval Gauss-Seidel method. The main idea is to weaken the local contractions and to let the propagation operate between all elementary solvers in order to accelerate the computation while preserving the same precision. Algorithm BC5 is finally compared with the constraint solving algorithm of Numerica.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alefeld, G., Herzberger, J.: Introduction to Interval Computations. Academic Press, London (1983)
Apt, K.R.: The Essence of Constraint Propagation. Theoretical Computer Science 221(1-2), 179–210 (1999)
Benhamou, F.: Heterogeneous Constraint Solving. In: Hanus, M., Rodríguez-Artalejo, M. (eds.) ALP 1996. LNCS, vol. 1139. Springer, Heidelberg (1996)
Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.-F.: Revising Hull and Box Consistency. In: Proc. of International Conference on Logic Programming (1999)
Benhamou, F., McAllester, D., Van Hentenryck, P.: CLP(Intervals) Revisited. In: Proc. of International Logic Programming Symposium (1994)
Benhamou, F., Older, W.J.: Applying Interval Arithmetic to Real, Integer and Boolean Constraints. Journal of Logic Programming 32(1), 1–24 (1997)
Bini, D., Mourrain, B.: Handbook of Polynomial Systems (1996)
Ceberio, M.: Preconditioning and Solving Techniques for Constrained Global Optimization. Master’s thesis, University of Nantes, France (1999)
Cleary, J.G.: Logical Arithmetic. Future Computing Systems 2(2), 125–149 (1987)
Collavizza, H., Delobel, F., Rueher, M.: Comparing Partial Consistencies. Reliable Computing 5(3), 213–228 (1999)
Colmerauer, A.: Naive solving of non-linear constraints. In: Benhamou, F., Colmerauer, A. (eds.) Constraint Logic Programming: Selected Research, pp. 89–112. MIT Press, Cambridge (1993)
Granvilliers, L.: A Symbolic-Numerical Branch and Prune Algorithm for Solving Non-linear Polynomial Systems. Journal of Universal Computer Science 4(2), 125–146 (1998)
Granvilliers, L., Goualard, F., Benhamou, F.: Box Consistency through Weak Box Consistency. In: Proc. of International Conference on Tools with Articial Intelligence (1999)
Hansen, E.R.: On the Solution of Linear Algebraic Equations with Interval Coefficients. Linear Algebra and its Applications 2, 153–165 (1969)
Hansen, E.R.: Global Optimization using Interval Analysis. Marcel Dekker, New York (1992)
IEEE. IEEE standard for binary floating-point arithmetic. Technical Report IEEE Std 754-1985, Institute of Electrical and Electronics Engineers (1985); Rearmed (1990)
Lebbah, Y., Lhomme, O.: Consistance énumérante. In: Proc. of French Conference on Practical Solving of NP-Complete Problems (1999)
Lhomme, O.: Consistency Techniques for Numeric CSPs. In: Proc. of International Joint Conference on Articial Intelligence (1993)
Mackworth, A.K.: Consistency in Networks of Relations. Articial Intelligence 8(1), 99–118 (1977)
Makino, K., Berz, M.: Efficient Control of the Dependency Problem based on Taylor Model Method. Reliable Computing 5, 3–12 (1999)
Marti, P., Rueher, M.: A Distributed Cooperating Constraint Solving System. International Journal on Artificial Intelligence Tools 4(1), 93–113 (1995)
Monfroy, E.: Using Weaker Functions for Constraint Propagation over Real Numbers. In: Proc. of ACM Symposium on Applied Computing (1999)
Monfroy, E., Rusinowitch, M., Schott, R.: Implementing Non-Linear Constraints with Cooperative Solvers. In: Proc. of ACM Symposium on Applied Computing (1996)
Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)
Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)
Older, W., Vellino, A.: Constraint Arithmetic on Real Intervals. In: Benhamou, F., Colmerauer, A. (eds.) Constraint Logic Programming: Selected Research. MIT Press, Cambridge (1993)
Rueher, M., Solnon, C.: Concurrent Cooperating Solvers over Reals. Reliable Computing 3(3), 325–333 (1997)
Stahl, V.: Interval Methods for Bounding the Range of Polynomials and Solving Systems of Nonlinear Equations. PhD thesis, University of Linz, Austria (1995)
Van Hentenryck, P., McAllester, D., Kapur, D.: Solving Polynomial Systems Using a Branch and Prune Approach. SIAM Journal on Numerical Analysis 34(2), 797–827 (1997)
Van Hentenryck, P., Michel, L., Deville, Y.: Numerica: a Modeling Language for Global Optimization. MIT Press, Cambridge (1997)
Verschelde, J.: Database of Polynomial Systems. Michigan State University, USA (1999), http://www.math.msu.edu/~jan/demo.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Granvilliers, L. (2000). Towards Cooperative Interval Narrowing. In: Kirchner, H., Ringeissen, C. (eds) Frontiers of Combining Systems. FroCoS 2000. Lecture Notes in Computer Science(), vol 1794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10720084_2
Download citation
DOI: https://doi.org/10.1007/10720084_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67281-4
Online ISBN: 978-3-540-46421-1
eBook Packages: Springer Book Archive