Abstract
In this paper we present a framework for the cooperation of symbolic and propagation-based numerical solvers over the real numbers. This cooperation is expressed in terms of fixed points of closure operators over a complete lattice of constraint systems. In a second part we instantiate this framework to a particular cooperation scheme, where propagation is associated to pruning operators implementing interval algorithms enclosing the possible solutions of constraint systems, whereas symbolic methods are mainly devoted to generate redundant constraints. When carefully chosen, it is well known that the addition of redundant constraint drastically improve the performances of systems based on local consistency (e.g. Prolog IV or Newton). We propose here a method which computes sets of redundant polynomials called partial Gröbner bases and show on some benchmarks the advantages of such computations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alefeld, G. and Herzberger, J.: Introduction to Interval Computations, Academic Press, 1983.
Benhamou, F.: Heterogeneous Constraint Solving, in: Proceedings of ALP'96, volume 1139 of LNCS, Springer-Verlag, Aachen, Germany, 1996, pp. 62–76.
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.
Benhamou, F., McAllester, D., and Van Hentenryck, P.: CLP (Intervals) Revisited, in: Proceedings of ILPS'94, Ithaca, NY, USA, 1994.
Benhamou, F. and Older, W. J: Applying Interval Arithmetic to Real, Integer and Boolean Constraints, Journal of Logic Programming (1997) (to appear).
Bini, D. and Mourrain, B.: Handbook of Polynomial Systems, 1996.
Buchberger, B.: Gröbner Bases: an Algorithmic Method in Polynomial Ideal Theory, in: Multidimensional Systems Theory, D. Reidel Publishing Company, 1985, pp. 184–232.
Colmerauer, A.: Specifications of Prolog IV, Draft, 1996.
Cox, D., Little, J., and O'shea, D.: Ideals, Varieties and Algorithms, Springer-Verlag, 1992.
Granlund, T.: GNU Multiple Precision Arithmetic Library, edition 2.0, 1996.
Hansen, E. R. and Sengupta, S.: Bounding Solutions of Systems of Equations Using Interval Analysis, BIT 21 (1981), pp. 203–211.
Kearfott, R. B.: Some Tests of Generalized Bisection, ACM Transactions on Mathematical Software 13 (3) (1987), pp. 197–220.
Krawczyk, R.: A Class of Interval Newton Operators, Computing 37 (1986), pp. 179–183.
Mackworth, A.: Consistency in Networks of Relations, Artificial Intelligence 8 (1) (1977), pp. 99–118.
Montanari, U.: Networks of Constraints: Fundamental Properties and Applications to Picture Processing, Information Science 7 (2) (1974), pp. 95–132.
Moore, R. E.: Interval Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1966.
Morgan, A. and Sommese, A.: Homotopy Methods for Polynomial Systems, Applied Mathematics and Computation 24 (1987), pp. 115–138.
Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, 1990.
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.
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).
Winkler, F.: Polynomial Algorithms in Computer Algebra, Springer-Verlag, 1996.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Benhamou, F., Granvilliers, L. Automatic Generation of Numerical Redundancies for Non-Linear Constraint Solving. Reliable Computing 3, 335–344 (1997). https://doi.org/10.1023/A:1009943413814
Issue Date:
DOI: https://doi.org/10.1023/A:1009943413814