Global Consistency for Continuous Constraints1
Djamila Haroud, Boi Faltings
Artificial Intelligence Laboratory (LIA)
Swiss Federal Institute of Technology (EPFL)
IN-Ecublens, 1015 Lausanne, Switzerland
FAX: +41-21-693-5225, e-mail: email@example.com
This paper provides a framework for solving general constraint satisfaction problems (CSPs) with continuous variables. Constraints are represented by a hierarchical binary decomposition of the space of feasible values. We propose algorithms for path- and higher degrees of consistency based on logical operations defined on the constraint representation mentioned above and we demonstrate that this algorithms terminate in polynomial time. We show that, in analogy to convex temporal problems and discrete row-convex problems, convexity properties of the solution spaces can be exploited to compute minimal and decomposable networks using path consistency algorithms. Based on this properties, we also show that a certain class of non binary CSPs can be solved using strong 5-consistency.
In the general case, constraint satisfaction problems (CSPs) are NP-complete. Trying to solve them by search algorithms, even if theoretically feasible, often results in prohibitive computational cost. One approach to overcome this complexity consists of pre-processing the initial problem using propagation algorithms. These algorithms establish various degrees of local consistency which narrow the initial feasible domain of the variables, thus reducing the subsequent search effort. Traditional consistency techniques and propagation algorithms | such as the Waltz propagation algorithm| provide relatively poor results when applied to continuous CSPs: they ensure neither completeness nor convergence in the general case (a good insight of the problems encountered can be found in ). However, Faltings  has shown that some undesirable features of propagation algorithms with interval labels must be attributed to the inadequacy of the propagation rule and to a lack of precision in the solution space description. He has also demonstrated that the problem with local propagation could be resolved by using total constraints on pairs of variables. Lhomme  has identified similar problems and proposed an interval propagation formalism based on bound propagation.
Van Beek's work on temporal reasoning  using Helly's theorem has shown the importance
of path-consistency for achieving globally consistent labellings. In certain cases, path-consistency
algorithms are difficult to implement in continuous domains because they require intersection
and composition operations on constraints. We propose a constraint representation by recursive
decomposition similar to the one described by Tanimoto in  which allows to implement these
operations. This allows us to apply Helly's theorem to general continuous constraint satisfaction
problems. The results obtained for temporal CSPs could therefore be generalized to less specific
classes of continuous CSPs.
1A version of this paper will be published in ECAI'94