Abstract
The efficiency of complete solvers depends both on constraint propagation to narrow the domains and some form of complete search. Whereas constraint propagators should achieve a good trade-off between their complexity and the pruning that is obtained, search heuristics take decisions based on information about the state of the problem being solved. In general, these two components are independent and are indeed considered separately. A recent family of algorithms have been proposed to achieve a strong form of consistency called Singleton Consistency (SC). These algorithms perform a limited amount of search and propagation (lookahead) to remove inconsistent values from the variables domains, making SC costly to maintain. This paper follows from the observation that search states being explored while enforcing SC are an important source of information about the future search space which is being ignored. In this paper we discuss the integration of this look-ahead information into variable and value selection heuristics, and show that significant speedups are obtained in a number of standard benchmark problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barták, R., Erben, R.: A new algorithm for singleton arc consistency. In: Barr, V., Markov, Z. (eds.) Proceedings of the Seventeenth International Florida Artificial Intelligence Research Society Conference (FLAIRS 2004), Miami Beach, Florida, USA. AAAI Press, Menlo Park (2004)
Bessiére, C., Régin, J.-C.: Arc consistency for general constraint networks: preliminary results. In: Proceedings of IJCAI 1997, Nagoya, Japan, pp. 398–404 (1997)
Bessière, C., Debruyne, R.: Theoretical analysis of singleton arc consistency. In: Proceedings of ECAI 2004 (2004)
Bessière, C., Debruyne, R.: Optimal and suboptimal singleton arc consistency algorithms. In: Proceedings of IJCAI 2005 (2005)
Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceeding of IJCAI 1991, pp. 331–340 (1991)
Culberson, J.: Graph coloring resources. on-line, http://web.cs.ualberta.ca/joe/Coloring/Generators/generate.html
Debruyne, R., Bessière, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: Proceedings of IJCAI 1997, pp. 412–417 (1997)
del Val, D., Cebrian: Redundant modeling for the quasigroup completion problem. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, Springer, Heidelberg (2003)
Geelen, P.A.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: Proceedings of ECAI 1992, pp. 31–35. John Wiley & Sons, Inc., New York (1992)
Gent, I.P., MacIntyre, E., Prosser, P., Walsh, T.: The constrainedness of search. In: Proceedings of AAAI 1996, vol. 1, pp. 246–252 (1996)
Gent, I.P., MacIntyre, E., Prosser, P., Smith, B.M., Walsh, T.: Random constraint satisfaction: Flaws and structure. Constraints 6(4), 345–372 (2001)
Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263–313 (1980)
Kask, K., Dechter, R., Gogate, V.: New look-ahead schemes for constraint satisfaction. In: Proceeding of AMAI 2004 (2004)
Kautz, Ruan, Achlioptas, Gomes, Selman, Stickel.: Balance and filtering in structured satisfiable problems. In: Proceedings of IJCAI 2001 (2001)
Lecoutre, C., Cardon, S.: A greedy approach to establish singleton arc consistency. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proceedings of IJCAI 2005, pp. 199–204. Professional Book Center (2005)
Mackworth, A.K., Freuder, E.C.: The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence 25, 65–74 (1985)
Prosser, P., Stergiou, K., Walsh, T.: Singleton consistencies. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 353–368. Springer, Heidelberg (2000)
Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557–571. Springer, Heidelberg (2004)
Shaw, P., Stergiou, K., Walsh, T.: Arc consistency and quasigroup completion. In: Proceedings of ECAI 1998 workshop on non-binary constraints, March 14 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Correia, M., Barahona, P. (2008). On the Integration of Singleton Consistencies and Look-Ahead Heuristics. In: Fages, F., Rossi, F., Soliman, S. (eds) Recent Advances in Constraints. CSCLP 2007. Lecture Notes in Computer Science(), vol 5129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89812-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-89812-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89811-5
Online ISBN: 978-3-540-89812-2
eBook Packages: Computer ScienceComputer Science (R0)