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. © 2000 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Horsch, M. C., & Havens, W. S. (2000). An empirical study of probabilistic arc consistency as a variable ordering heuristic. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1894, 525–530. https://doi.org/10.1007/3-540-45349-0_43
Mendeley helps you to discover research relevant for your work.