Abstract
We describe an algorithm (Latit) for solving a hierarchy of constraints in which the last level is associated with a global comparator and all the other levels are associated with a local comparator Latif uses local propagation techniques to determine parts of constraint hierarchy that can be solved simultaneously.
This is a preview of subscription content, log in via an institution.
References
Boming, A., Freeman-Benson, B., & Wilson, M., Constraint hierarchies, Lisp and Symbolic Computation, Vol. 5, pp. 221–268, 1992.
Hosobe, H., Miyachita, K., Takahashi, S., Matsuoka, S., & Yonezawa, A., Locally Simultaneous Constraint Satisfaction LNCS 874: PPCP, Nov. 1994.
Hosobe, H., Satoshi, M. & Akinori, Y., Generalized Local Propagation:,A framework for solving constraint hierarchies, LNCS 1118: PPCP, Nov. 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouxoubaa, M. (1997). Solver for hierarchical CSP containing several constraint types and multi-output constraints. In: Shyamasundar, R.K., Ueda, K. (eds) Advances in Computing Science — ASIAN'97. ASIAN 1997. Lecture Notes in Computer Science, vol 1345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63875-X_74
Download citation
DOI: https://doi.org/10.1007/3-540-63875-X_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63875-9
Online ISBN: 978-3-540-69658-2
eBook Packages: Springer Book Archive