Abstract
The fundamentals of interval analysis on directed acyclic graphs (DAGs) for global optimization and constraint propagation have recently been proposed in Schichl and Neumaier (J. Global Optim. 33, 541–562, 2005). For representing numerical problems, the authors use DAGs whose nodes are subexpressions and whose directed edges are computational flows. Compared to tree-based representations [Benhamou et al. Proceedings of the International Conference on Logic Programming (ICLP’99), pp. 230–244. Las Cruces, USA (1999)], DAGs offer the essential advantage of more accurately handling the influence of subexpressions shared by several constraints on the overall system during propagation. In this paper we show how interval constraint propagation and search on DAGs can be made practical and efficient by: (1) flexibly choosing the nodes on which propagations must be performed, and (2) working with partial subgraphs of the initial DAG rather than with the entire graph. We propose a new interval constraint propagation technique which exploits the influence of subexpressions on all the constraints together rather than on individual constraints. We then show how the new propagation technique can be integrated into branch-and-prune search to solve numerical constraint satisfaction problems. This algorithm is able to outperform its obvious contenders, as shown by the experiments.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alefeld G., Herzberger J.: Introduction to Interval Computations. Academic Press, New York (1983)
Benhamou, F., Older, W.J.: Applying interval arithmetic to real, integer and boolean constraints. J. Log. Programm, pp. 32–81, 1997. Extension of a Technical Report of Bell Northern Research, Canada (1992)
Benhamou, F., Older, W.J.: Applying interval arithmetic to real, integer and boolean constraints. Technical Report BNR, Technical Report, Bell Northern Research, ON, Canada (1992)
Benhamou, F., McAllester, D., Van Hentenryck, P.: CLP(Intervals) revisited. In: Proceedings of the International Logic Programming Symposium, pp. 109–123 (1994)
Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.-F.: Revising hull and box consistency. In: Proceedings of the International Conference on Logic Programming (ICLP’99), pp. 230–244. Las Cruces, USA (1999)
Granvilliers L., Benhamou F.: Algorithm 852: RealPaver: an interval solver using constraint satisfaction techniques. ACM Trans. Math. Softw. (TOMS) 32(1), 138–156 (2006)
Hansen, E.R., Walster, G.W.: Global optimization using interval analysis, 2nd edn. Marcel Dekker (2004)
Hickey T.J., Ju Q., Van Emden M.H.: Interval arithmetic: from principles to implementation. J. ACM (JACM) 48(5), 1038–1068 (2001)
Jaulin, L., Kieffer, M., Didrit, O., Walter, E.: Applied interval analysis, 1st edn. Springer (2001)
Lebbah, Y.: ICOS (Interval Constraints Solver). WWW document (2003)
Lhomme, O.: Consistency techniques for numeric CSPs. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93), pp. 232–238 (1993)
Lottaz, C.: Collaborative design using solution spaces. PhD thesis, Swiss Federal Institute of Technology in Lausanne (EPFL), Switzerland (2000)
Mackworth A.K.: Consistency in networks of relations. Artif. Intell. 8, 99–118 (1977)
Montanari U.: Networks of constraints: fundamental properties and applications to picture processing. Inf. Sci. 7, 95–132 (1974)
Moore R.E.: Interval Analysis. Prentice Hall, Englewood Cliffs, NJ (1966)
Moore R.E.: Methods and Applications of Interval Analysis. SIAM Studies in Applied Mathematics, Philadelphia (1979)
Neumaier A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge(1990)
Pryce J.D., Corliss G.F.: Interval arithmetic with containment sets. Computing 78(3), 251–276 (2006)
Sam-Haroud, D.: Constraint consistency techniques for continuous domains. PhD thesis, Swiss Federal Institute of Technology in Lausanne (EPFL), Switzerland (1995)
Schichl, H.: Mathematical modeling and global optimization. Habilitation thesis, Faculty of Mathematics, University of Vienna, Autralia, November (2003)
Schichl H., Neumaier A.: Interval analysis on directed acyclic graphs for global optimization. J. Global Optim. 33, 541–562 (2005)
Silaghi, M.-C., Sam-Haroud, D., Faltings, B.: Search techniques for non-linear CSPs with inequalities. In: Proceedings of the 14th Canadian Conference on Artificial Intelligence (2001)
Singh S., Watson B., Srivastava P.: Fixed point theory and best approximation: the KKM-map principle. Kluwer Academic Publishers, Dordrecht (1997)
Van Hentenryck, P.: Numerica: a modeling language for global optimization. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97) (1997)
Vu, X.-H., Sam-Haroud, D., Silaghi, M.-C.: Numerical constraint satisfaction problems with non-isolated solutions. In: Global Optimization and Constraint Satisfaction: First International Workshop on Global Constraint Optimization and Constraint Satisfaction, COCOS 2002, LNCS vol. 2861, pp. 194–210. Valbonne-Sophia Antipolis, France, October 2003. Springer-Verlag
Vu, X.-H., Sam-Haroud, D., Faltings, B.: Combining multiple inclusion representations in numerical constraint propagation. In: Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), pp. 458–467. Florida, USA, November 2004. IEEE Computer Society Press
Vu, X.-H., Schichl, H., Sam-Haroud, D.: Using directed acyclic graphs to coordinate propagation and search for numerical constraint satisfaction problems. In: Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), Florida, USA, November 2004. IEEE Computer Society Press
Waltz, D.L.: Generating semantic descriptions from drawings of scenes with shadows. Technical Report, Massachusetts Institute of Technology, USA (1972)
Waltz D.L.: The Psychology of Computer Vision, Chapter Understanding Line Drawings of Scenes with Shadows, pp. 19–91. McGraw Hill, New York (1975)
William Walster, G., Hansen, E.R., Pryce, J.D.: Extended real intervals and the topological closure of extended real relations. Technical Report, Sun Microsystems, February (2000). http://wwws.sun.com/software/sundev/whitepapers/extended-real.pdf
Author information
Authors and Affiliations
Corresponding author
Additional information
A short version of this paper has been published in [27].
Rights and permissions
About this article
Cite this article
Vu, XH., Schichl, H. & Sam-Haroud, D. Interval propagation and search on directed acyclic graphs for numerical constraint solving. J Glob Optim 45, 499–531 (2009). https://doi.org/10.1007/s10898-008-9386-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-008-9386-7