Using Directed Acyclic Graphs to Coordinate Propagation and Search for Numerical Constraint Satisfaction Problems

Authors:
Xuan-Ha Vu;Hermann Schichl;Djamila Sam-Haroud
Affiliations:
Swiss Federal Institute of Technology;University of Vienna;Swiss Federal Institute of Technology
Venue:
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Year:
2004

Citing 0
Cited 4

Interval Analysis on Directed Acyclic Graphs for Global Optimization

Journal of Global Optimization
Exploiting Common Subexpressions in Numerical CSPs

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Interval propagation and search on directed acyclic graphs for numerical constraint solving

Journal of Global Optimization
Constraint propagation on quadratic constraints

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper of H. SCHICHL & A. NEUMAIER [14] has given the fundamentals of interval analysis on DAGs for global optimization and constraint propagation. We show in this paper how constraint propagation on DAGs can be made efficient and practical by: (i) working on partial DAG representations; and (ii) enabling the flexible choice of the interval inclusion functions during propagation. We then propose a new simple algorithm which coordinates constraint propagation and exhaustive search for solving numerical constraint satisfaction problems. The experiments carried out on different problems show that the new approach outperforms previously available propagation techniques by an order of magnitude or more in speed, while being roughly the same quality w.r.t. enclosure properties.