Abstract
We consider constraint satisfaction problems with variables in continuous, numerical domains. Contrary to most existing techniques, which focus on computing one single optimal solution, we address the problem of computing a compact representation of the space of all solutions admitted by the constraints. In particular, we show how globally consistent (also called decomposable) labelings of a constraint satisfaction problem can be computed.
Our approach is based on approximating regions of feasible solutions by 2k-trees, a representation commonly used in computer vision and image processing. We give simple and stable algorithms for computing labelings with arbitrary degrees of consistency. The algorithms can process constraints and solution spaces of arbitrary complexity, but with a fixed maximal resolution.
Previous work has shown that when constraints are convex and binary, path-consistency is sufficient to ensure global consistency. We show that for continuous domains, this result can be generalized to ternary and in fact arbitrary n-ary constraints using the concept of (3,2)-relational consistency. This leads to polynomial-time algorithms for computing globally consistent labelings for a large class of constraint satisfaction problems with continuous variables.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Benhamou, F., McAllester, D., & van Hentenryck, P. (1994). CLP(intervals) revisited. In Proceedings of the International Logic Programming Symposium 94.
Benhamou, F., & Older, W. (1994). Applying interval arithmetic to real integer and boolean constraints. In Journal of Logic Programming.
Cooper, M. C. (1989). An optimal k-consistency algorithm. In Artificial Intelligence, 41.
Davis, E. (1987). Constraint propagation with interval labels. In Artificial Intelligence 32.
Dechter, R. (1990). From local to global consistency. In Proceedings of the 8th Canadian Conference on AI.
Dechter, R., Meiri, I., & Pearl, J. (1990). Temporal constraint networks. In Artificial Intelligence 49(1–3).
Faltings, B. (1994). Arc consistency for continuous variables. In Artificial Intelligence 65(2).
Faltings, B., Haroud, D., & Smith, I. (1992). Dynamic constraint propagation with continuous variables. In Proceedings of the 10th European Conference on AI.
Freuder, E. C. (1978). Synthesizing constraint expressions. In Communications of the ACM, 21.
Freuder, E. C. (1982). A sufficient condition for backtrack-free search. In Journal of the ACM, 29.
Haroud, D., & Faltings, B. V. (1994). Global consistency for continuous constraints. In Alan Borning, editor, Lecture Notes in Computer Science 874: Principles and Practice of Constraint Programming. Springer Verlag.
Haroud, D., Boulanger, S., Gelle, E., & Smith, I. (1995). Management of conflict for preliminary engineering design tasks. In AIEDAM, 9(4).
Hickey, T. (1994). CLP(F) and constrained ODE's. In Proceedings of 1994 Workshop on Constraints and Modeling.
Hubbe, D., & Freuder, E. C. (1992). An efficient cross-product representation of the constraint satisfaction problem search space. In Proceedings of the 10th National Conference on AI.
Hyvönen, E. (1992). Constraint reasoning based on interval arithmetic: the tolerance propagation approach. In Artificial Intelligence 58(1–3).
Lee, J. H. M., & van Emden, M. H. (1993). Interval computation as deduction in CHIP. In Journal of Logic Programming, 16(3–4).
Lhomme, O. (1993). Consistency techniques for numeric CSPs. In Proceedings of the 13th International Joint Conference on AI.
Mackworth, A. K. (1977). Consistency in networks of relations. In Artificial Intelligence, 8.
Montanari, U. (1974). Networks of constraints: fundamental properties and applications to picture processing. In Inform. Scie. 7.
Older, W., & Vellino, A. (1993). Constraint arithmetic on real intervals. In Frédéric Benhamou and Alain Colmerauer, editors, Constraint logic programming—Selected research. The MIT Press, 1993.
Sam-Haroud, D. (1995). Constraint consistency techniques for continuous domains. Ph.D. thesis, Ecole polytechnique fédérale de Lausanne, Switzerland, 1995.
Sidebottom, G., & Havens, W. S. (1992). Hierarchical arc-consistency for disjoint real intervals in constraint logic programming. In Computational Intelligence, 8(4).
Tanimoto, S. (1993). A constraint decomposition method for spatio-temporal configurations problems. In Proceedings of the 11th National Conference on AI.
van Beek, P. (1992). On the minimality and decomposability of constraint networks. In Proceedings of the 10th National Conference on AI.
van Beek, P., & Dechter, R. (1995). On the minimality and global consistency of row convex constraint networks. In Journal of the ACM.
van Hentenryck, P., McAllester, D., and Kapur, D. (1995). Solving polynomial systems using a branch and prune approach. In To be published.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sam-Haroud, D., Faltings, B. Consistency techniques for continuous constraints. Constraints 1, 85–118 (1996). https://doi.org/10.1007/BF00143879
Issue Date:
DOI: https://doi.org/10.1007/BF00143879