Abstract
We investigate the use of value ordering in backtracking search for Quantified Constraint Satisfaction problems (QCSPs). We consider two approaches for ordering heuristics. The first approach is solution-focused and is inspired by adversarial search: on existential variables we prefer values that maximise the chances of leading to a solution, while on universal variables we prefer values that minimise those chances. The second approach is verification-focused, where we prefer values that are easier to verify whether or not they lead to a solution. In particular, we give instantiations of this approach using QCSP-Solve’s pure-value rule Gent et al. (QCSP-solve: A solver for quantified constraint satisfaction problems. In Proceedings of IJCAI, pp. 138–143, 2005). We show that on dense 3-block problems, using QCSP-Solve, the solution-focused adversarial heuristics are up to 50% faster than lexicographic ordering, while on sparse loose interleaved problems, the verification-focused pure-value heuristics are up to 50% faster. Both types are up to 50% faster on dense interleaved problems, with one pure-value heuristic approaching an order of magnitude improvement.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beck, J. C., & Prosser, P. R. (2004). Variable ordering heuristics show promise. In Proceedings of CP, LNCS, LNCS 3258 (pp. 711–715). Heidelberg: Springer.
Benedetti, M., Lallouet, A., & Vautard, J. (2006). Reusing CSP propagators for QCSPs. In Proceedings of Workshop on Constraint Solving and Contraint Logic Programming, CSCLP (pp. 63–77).
Benedetti, M., Lallouet, A., & Vautard, J. (2007). QCSP made practical by virtue of restricted quantification. In Proceedings of IJCAI (pp. 38–43).
Bessiere, C., & Regin, J. C. (1996). MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Proceedings of CP (pp. 61–75).
Bessiere, C., & Verger, G. (2006). Blocksolve: A bottom-up approach for solving quantified CSPs. In Proceedings of CP (pp. 635–649).
Bessiere, C., & Verger, G. (2006). Strategic constraint satisfaction problems. In Proceedings of CP workshop on modelling and reformulation (pp. 17–29).
Boerner, F., Bulatov, A., Jeavons, P., & Krohkin, A. (2003). Quantified constraints: Algorithms and complexity. In Proceedings of CSL (pp. 244–258).
Bordeaux, L., & Monfroy, E. (2002). Beyond NP: Arc-consistency for quantified constraints. In Proceedings of CP (pp. 371–386).
Boussemart, F., Hemery, F., Lecoutre, C., Sais, L. (2004). Boosting systematic search by weighting constraints. In Proceedings of ECAI (pp. 146–150).
Brown, K. N., Little, J., Creed, P. J., Freuder, E. C. (2004), Adversarial constraint satisfaction by game-tree search. In Proceedings of ECAI (pp. 151–155).
Cadoli, M., Schaerf, M., Giovanardi, A., Giovanardi, M. (2002). An algorithm to evaluate quantified boolean formulae and its experimental evaluation. Journal of Automated Reasoning, 28(2), 101–142.
Cambazard, H., & Jussien, N. (2006). Identifying and exploiting problem structures using explanation-based constraint programming. Constraints, 11(4), 295–313.
Ferguson, A., & O’Sullivan, B. (2007). Quantified constraint satisfaction: From relaxations to explanations. In Proceedings of IJCAI (pp. 74–79).
Freuder, E. C. (1991). Eliminating interchangeable values in constraint satisfaction problems. In Proceedings of AAAI (pp. 227–233).
Frost, D., & Dechter, R. (1995). Look-ahead value ordering for constraint satisfaction problems. In Proceedings of IJCAI (pp. 572–578).
Geelen, P. A. (1992). Dual viewpoint heuristics for binary constraint satisfaction problems. In Proceedings of ECAI (pp. 31–35).
Gent, I. P., Nightingale, P., & Rowley, A. (2004). Encoding quantified CSPs as quantified boolean formulae. In Proceedings of ECAI (pp. 176–180).
Gent, I. P., Nightingale, P., & Stergiou, K. (2005). QCSP-solve: A solver for quantified constraint satisfaction problems. In Proceedings of IJCAI (pp. 138–143).
Giunchiglia, E., Narizzano, M., & Tacchella, A. (2001). Backjumping for quantified boolean logic satisfiability. In Proceedings of IJCAI (pp. 275–281).
Haralick, R. M., & Elliott, G. L. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14(3), 263–313.
Hulubei, T., & O’Sullivan, B. (2006). The impact of search heuristics on heavy-tailed behavior. Constraints Journal, 11(2–3), 159–178.
Mamoulis, N., & Stergiou, K. (2004). Algorithms for quantified constraint satisfaction problems. In Proceedings of CP (pp. 752–756).
Nightingale, P. (2007). Consistency and the quantified constraint satisfaction problem. Ph.D. thesis.
Prosser, P. (1993). Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9, 268–299.
Refalo, P. (2004). Impact-based search strategies for constraint programming. In Proceedings of CP (pp. 557–571).
Sabin, D., & Freuder, E. C. (1994). Contradicting conventional wisdom in constraint satisfaction. In Proceedings of second international workshop on principles and practice of constraint programming (PPCP) (Vol. 874, pp. 10–20).
Shannon, C. E. (1950). Programming a computer for playing chess. Philosophical Magazine (Series 7), 41, 256–275.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported in part by Microsoft Research through the European PhD Scholarship Programme, and by the Embark Initiative of the Irish Research Council for Science, Engineering and Technology (IRCSET).
Rights and permissions
About this article
Cite this article
Stynes, D., Brown, K.N. Value ordering for quantified CSPs. Constraints 14, 16–37 (2009). https://doi.org/10.1007/s10601-008-9052-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10601-008-9052-1