Abstract
Consistency techniques proved to be an efficient method for reducing the search space of CSP and hence they were modified for soft constraint frameworks too. Several algorithms for local consistency in Weighted CSP, where costs are assigned to tuples, were introduced in [2,3]. The strongest form among them is Full Star Directional Arc Consistency (FDAC*). The algorithm for enforcing FDAC* is based on sending costs from one constraint to another in one direction with respect to the fixed order of variables.
Supported by the Czech Science Foundation under the contracts 201/04/1102 and 201/05/H014.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Borning, A., Maher, M., Martindale, A., Wilson, M.: Constraint Hierarchies and Logic Programming. In: Proceedings of 6th International Conference on Logic Programming, pp. 149–164. MIT Press, Cambridge (1989)
Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for Weighted CSP. In: Proceedings of IJCAI 2003, Acapulco, Mexico (2003)
Larrosa, J., Schiex, T.: Solving Weighted CSP by Maintaining Arc Consistency. Artificial Intelligence 159(1–2), 1–26 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zlomek, J., Barták, R. (2005). Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_114
Download citation
DOI: https://doi.org/10.1007/11564751_114
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)