Abstract
The Constraint Satisfaction Problem (CSP) is NP-hard. Finding solutions requires searching in an exponential space of possible variable assignments. Good value ordering heuristics are essential for finding solutions to CSPs. Such heuristics estimate the marginal probability that any particular variable assignment will appear in a globally consistent solution. Unfortunately, computing such solution probabilities exactly is also NP-hard. Thus estimation algorithms are required. Previous results have been very encouraging but computationally expensive. In this paper, we present two new algorithms, called Histogram Arc Consistency (HAC) and μ Arc Consistency(μAC), which generate fast estimates of solution probabilities during constraint propagation. This information is used as value ordering heuristics to guide backtrack search. Our experimental results on random CSPs show that these methods indeed provide significant heuristic guidance compared to previous methods while remaining efficient to compute.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dechter, R., Pearl, J.: Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence 34, 1–34 (1988)
Geelen, P.A.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: Proceedings of the 10th European Conference on Artificial Intelligence, pp. 31–35 (1992)
Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Proc. of the Fourteen International Joint Conference on Artificial Intelligence(IJCAI 1995), pp. 607–615 (1995)
Horsch, M.C., Havens, W.S., Ghose, A.: Generalized arc consistency with application to maxcsp. In: Cohen, R., Spencer, B. (eds.) Proceedings of Canadian Conference on AI, pp. 104–118 (2002)
Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 8(1), 99–118 (1977)
Meisels, A., Shimonoy, S.E., Solotorevsky, G.: Bayes networks for estimating the number of solutions to a csp. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 1–34 (1997)
Vernooy, M., Havens, W.S.: An examination of probabilistic value-ordering heuristics. In: Proceedings of the 12th Australian Joint Conference on Artificial Intelligence (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, W., Havens, W.S. (2004). Histogram Arc Consistency as a Value Ordering Heuristic. In: Tawfik, A.Y., Goodwin, S.D. (eds) Advances in Artificial Intelligence. Canadian AI 2004. Lecture Notes in Computer Science(), vol 3060. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24840-8_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-24840-8_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22004-6
Online ISBN: 978-3-540-24840-8
eBook Packages: Springer Book Archive