Accelerating Counting-Based Search
Counting-based search, a branching heuristic used in constraint programming, relies on computing the proportion of solutions to a constraint in which a given variable-value assignment appears in order to build an integrated variable- and value-selection heuristic to solve constraint satisfaction problems. The information it collects has led to very effective search guidance in many contexts. However, depending on the constraint, computing such information can carry a high computational cost. This paper presents several contributions to accelerate counting-based search, with supporting empirical evidence that solutions can thus be obtained orders of magnitude faster.
- 3.Choi, J., Dongarra, J.J., Ostrouchov, L.S., Petitet, A.P., Walker, D.W., Whaley, R.C.: Design and implementation of the ScaLAPACK LU, QR, and Cholesky factorization routines. Sci. Program. 5(3), 173–184 (1996)Google Scholar
- 5.Gagnon, S.: Gecode extension for counting-based search (2017). https://github.com/SaGagnon/gecode-5-extension
- 6.Gecode Team: Gecode: generic constraint development environment (2017). http://www.gecode.org
- 7.Gomes, C., Shmoys, D.: Completing quasigroups or Latin squares: a structured graph coloring problem. In: Computational Symposium on Graph Coloring and Generalizations, January 2002Google Scholar
- 8.Haythorpe, M.: FHCP challenge set (2015). http://fhcp.edu.au/fhcpcs
- 9.Pesant, G.: Counting-based search for constraint optimization problems. In: Schuurmans, D., Wellman, M.P. (eds.) AAAI, pp. 3441–3448. AAAI Press (2016)Google Scholar