Abstract
We consider the impact of value ordering heuristics on the search effort required to find all solutions, or proving none exist, to a constraint satisfaction problem in k-way branching search. We show that when the variable ordering heuristic is adaptive, the order in which the values are assigned to variables can make a significant difference in all measures of search effort. We study in depth an open issue regarding the relative merit of traditional value heuristics, and their complements, when searching for all solutions. We also introduce a lazy version of k-way branching and study the effect of value orderings on finding all solutions when it is used. This paper motivates a new and fruitful line of research in the study of value ordering heuristics for proving unsatisfiability.
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
Balafoutis, T., Stergiou, K.: Adaptive branching for constraint satisfaction problems. In: ECAI, pp. 855–860 (2010)
Bessière, C., Régin, J.-C.: MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 61–75. Springer, Heidelberg (1996)
Boussemart, F., Hemery, F., Lecoutre, C., Saïs, L.: Boosting systematic search by weighting constraints. In: Procs of ECAI 2004 (2004)
Frost, D., Dechter, R.: Look-ahead value ordering for constraint satisfaction problems. In: Proceedings of the IJCAI 1995, pp. 572–578 (1995)
Geelen, P.A.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: Proceedings of ECAI 1992, New York, NY, USA, pp. 31–35 (1992)
Hwang, J., Mitchell, D.G.: 2-way vs. d-way branching for csp. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 343–357. Springer, Heidelberg (2005)
Lecoutre, C.: Constraint Networks Techniques and Algorithms. Wiley, Chichester (2009)
Mehta, D., van Dongen, M.R.C.: Static value ordering heuristics for constraint satisfaction problems. In: Proceedings of CPAI 2005 Workshop held with CP 2005, pp. 49–62 (2005)
Sabin, D., Freuder, E.C.: Contradicting conventional wisdom in constraint satisfaction. In: Cohn, A.G. (ed.) ECAI 1994, pp. 125–129. John Wiley and Sons, Chichester (1994)
Sabin, D., Freuder, E.C.: Understanding and improving the MAC algorithm. In: Smolka, G. (ed.) Principles and Practice of Constraint Programming, pp. 167–181. Springer, Heidelberg (1997)
Smith, B.M., Sturdy, P.: Value ordering for finding all solutions. In: Proceedings of the IJCAI 2005, pp. 311–316 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mehta, D., O’Sullivan, B., Quesada, L. (2011). Value Ordering for Finding All Solutions: Interactions with Adaptive Variable Ordering. In: Lee, J. (eds) Principles and Practice of Constraint Programming – CP 2011. CP 2011. Lecture Notes in Computer Science, vol 6876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23786-7_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-23786-7_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23785-0
Online ISBN: 978-3-642-23786-7
eBook Packages: Computer ScienceComputer Science (R0)