Abstract
We report on an empirical evaluation of a new probabilistic heuristic for constructive search in constraint satisfaction problems. The heuristic is based on the estimation of solution probability. We show empirically that this heuristic is more accurate than related heuristics, and reduces the number of consistency checks and backtracks in constructive search by up to several orders of magnitude. Our results also show that the time required to estimate solution probabilities is less than the time required for search using other well-known heuristics as the problem size increases.
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
Preview
Unable to display preview. Download preview PDF.
References
D. Brelaz. New methods to color the verticies of a graph. JACM, 22(4):251–256, 1979.
Rina Dechter and Judea Pearl. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence, 34:1–34, 1988.
Brendan J. Frey and David J. C. MacKay. A revolution: Belief propagation in graphs with cycles. In Advances in Neural Information Processing Systems, pages 479–485, 1998.
Richard M. Haralick and Gordon L. Elliot. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14(3):263–313, 1980.
Michael C. Horsch and William S. Havens. How to count Solutions to CSPs. Technical report, School of Computing Science, Simon Fraser University, 2000.
Michael C. Horsch and William S. Havens. Probabilistic Arc Consistency: A connection between constraint reasoning and probabilistic reasoning. In Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, 2000. To appear.
Alan K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99–118, 1977.
Amnon Meisels, Solomon Ehal Shimonoy, and Gadi Solotorevsky. Bayes Networks for Estimating the Number of Solutions to a CSP. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, 1997.
Judea Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Reasoning. Morgan Kaufmann Publishers, Los Altos, 1988.
Shmuel Peleg. A new probabilistic relaxation method. IEEE Transactions on Pattern Matching and Machine Intelligence, 2(4):362–369, 1980.
P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9:268–299, 1993.
Noam M. Shazeer, Michael L. Littman, and Greg A. Keim. Solving crossword puzzles as probabilistic constraint satisfaction. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, pages 156–162, 1999.
Matt Vernooy and William S. Havens. 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
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Horsch, M.C., Havens, W.S. (2000). An Empirical Study of Probabilistic Arc Consistency as a Variable Ordering Heuristic. In: Dechter, R. (eds) Principles and Practice of Constraint Programming – CP 2000. CP 2000. Lecture Notes in Computer Science, vol 1894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45349-0_43
Download citation
DOI: https://doi.org/10.1007/3-540-45349-0_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41053-9
Online ISBN: 978-3-540-45349-9
eBook Packages: Springer Book Archive