Abstract
A globally consistent labeling is a compact representation of the complete solution space for a constraint satisfaction problem (CSP). Constraint satisfaction is NP-complete and so is the construction of globally consistent labelings for general problems. However, for binary constraints, it is known that when constraints are convex, path-consistency is sufficient to ensure global consistency and can be computed in polynomial time. We show how in 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 numerical constraint satisfaction problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dechter R. From local to global consistency. In Proceedings of the 8th Canadian Conference on AI, 1990.
Dechter R., Meiri i., and Pearl J. Temporal constraint networks. In Artificial Intelligence 49(1–3), 1990.
Faltings B. Arc consistency for continuous variables. In Artificial Intelligence 65(2), 1994.
Haroud D. and Faltings B.V. Global consistency for continuous constraints. In Alan Borning, editor, Lecture notes in computer Science 874: Principles and Practice of constraint programming. Springer Verlag, 1994.
Sam-Haroud D. Constraint consistency techniques for continuous domains. PhD thesis, Ecole Polytechnique Fédérale de Lausanne, Switzerland, 1995.
Sam-Haroud D. and Faltings B.V. Consistency techniques for continuous constraints. In Constraints Journal, 1, 1996.
Samet H. Applications of spatial data structures — Computer graphics, image processing and GIS. Addison-Wesley Publishing Company, 1993.
van Beek P. On the minimality and decomposability of constraint networks. In Proceedings of the 10th National Conference on AI, 1992.
van Beek P. and Dechter R. On the minimality and global consistency of row convex constraint networks. In Journal of the ACM, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sam-Haroud, D., Faltings, B.V. (1996). Solving non-binary convex CSPs in continuous domains. In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_90
Download citation
DOI: https://doi.org/10.1007/3-540-61551-2_90
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61551-4
Online ISBN: 978-3-540-70620-5
eBook Packages: Springer Book Archive