Abstract
The solving engines of most of constraint programming systems use interval-based consistency techniques to process nonlinear systems over the reals. However, few symbolic-interval cooperative solvers are implemented. The challenge is twofold: control of the amount of symbolic computations, and prediction of the accuracy of interval computations over transformed systems.
In this paper, we introduce a new symbolic pre-processing for interval branch-and-prune algorithms based on box consistency. The symbolic algorithm computes a linear relaxation by abstraction of the nonlinear terms. The resulting rectangular linear system is processed by Gaussian elimination. Control strategies of the densification of systems during elimination are devised. Three scalable problems known to be hard for box consistency are efficiently solved.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Benhamou, D. McAllester, and P. Van Hentenryck. CLP(Intervals) Revisited.In Procs. of ILPS'94, Intl. Logic Prog. Symp., pages 124–138, Ithaca, USA, 1994. MIT Press.
F. Benhamou and W. J. Older. Applying Interval Arithmetic to Real, Integer and Boolean Constraints. J. of Logic Programming, 32(1):1–24, 1997.
M. Ceberio and L. Granvilliers. Solving Nonlinear Systems by Constraint Inversion and Interval Arithmetic. In Procs. of AISC’2000, 5th Intl. Conf. on Artificial Intelligence and Symbolic Computation, volume 1930 of LNAI, Madrid, Spain, 2000. Springer-Verlag.
A. Colmerauer. Naive Solving of Non-linear Constraints. In F. Benhamou and A. Colmerauer, eds., Constraint Logic Programming: Selected Research, pages 89–112. MIT Press, 1993.
F. Goualard, F. Benhamou, and L. Granvilliers. An Extension of the WAM for Hybrid Interval Solvers. J. of Functional and Logic Programming, 5(4):1–31, 1999.
L. Granvilliers. A Symbolic-Numerical Branch and Prune Algorithm for Solving Non-linear Polynomial Systems.J. of Universal Comp. Sci., 4(2):125–146, 1998.
L. Granvilliers, E. Monfroy, and F. Benhamou. Symbolic-Interval Cooperation in Constraint Programming. In Procs. of ISSAC’2001, 26th Intl. Symp. on Symbolic and Algebraic Computation, pages 150–166, Univ. of Western Ontario, London, Ontario, Canada, 2001. ACM Press.
T. J. Hickey. CLIP: a CLP(Intervals) Dialect for Metalevel Constraint Solving. In Procs. of PADL’2000, Intl. Workshop on Practical Aspects of Declarative Languages, volume 1753 of LNCS, pages 200–214, Boston, USA, 2000. Springer-Verlag.
H. Hong. RISC-CLP(Real): Constraint Logic Programming over Real Numbers. In F. Benhamou and A. Colmerauer, eds., Constraint Logic Programming: Selected Research. MIT Press, 1993.
J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(ℜ) Language and System. ACM Trans. on Programming Languages and Systems, 14(3):339–395, 1992.
P. Marti and M. Rueher. A Distributed Cooperating Constraints Solving System. Intl. J. on Artificial Intelligence Tools, 4(1–2):93–113, 1995.
R. E. Moore. Interval Analysis. Prentice-Hall, Englewood Cliffs, NJ, 1966.
J.-F. Puget and M. Leconte. Beyond the Glass Box: Constraints as Objects. In Procs. of ILPS’95, Intl. Logic Programming Symposium, pages 513–527, Portland, USA, 1995. MIT Press.
A. Semenov and A. Leshchenko. Interval and Symbolic Computations in the Unicalc Solver. In Procs. of INTERVAL’94, pages 206–208, St-Petersburg, Russia, 1994.
M. H. Van Emden. Algorithmic Power from Declarative Use of Redundant Constraints. Constraints, 4(4):363–381, 1999.
P. Van Hentenryck, D. McAllester, and D. Kapur. Solving Polynomial Systems Using a Branch and Prune Approach. SIAM J. on Numerical Analysis, 34(2):797–827, 1997.
P. Van Hentenryck, L. Michel, and Y. Deville. Numerica: a Modeling Language for Global Optimization. MIT Press, 1997.
M. Wallace, S. Novello, and J. Schimpf. ECLiPSe: A Platform for Constraint Logic Programming. Technical report, IC-Parc, London, 1997.
K. Yamamura, H. Kawata, and A. Tokue. Interval Analysis using Linear Programming. BIT, 38:188–201, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ceberio, M., Granvilliers, L. (2002). Solving Nonlinear Equations by Abstraction, Gaussian Elimination, and Interval Methods. In: Armando, A. (eds) Frontiers of Combining Systems. FroCoS 2002. Lecture Notes in Computer Science(), vol 2309. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45988-X_10
Download citation
DOI: https://doi.org/10.1007/3-540-45988-X_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43381-1
Online ISBN: 978-3-540-45988-0
eBook Packages: Springer Book Archive