Abstract
We present algorithms that perform the extraction of partial assignments from binary Constraint Satisfaction Problems without introducing new constraints. They are based on a new perspective on domain values: we view a value not as a single, indivisible unit, but as a combination of value fragments. Applications include removing nogoods while maintaining constraint arity, learning nogoods in the constraint network, enforcing on neighborhood inverse consistency and removal of unsolvable sub-problems from the constraint network.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bowen, J., Likitvivatanavong, C.: Domain transmutation in constraint satisfaction problems. In: Proceedings of AAAI-04, San Jose, California (2004)
Bacchus, F., Chen, X., van Beek, P., Walsh, T.: Binary vs. non-binary constraints. Artificial Intelligence 140, 1–37 (2002)
Frost, D., Dechter, R.: Dead-end driven learning. In: Proceedings of AAAI-94, Seattle, Washington, pp. 294–300 (1994)
Freuder, E.C., Elfe, C.D.: Neighborhood inverse consistency preprocessing. In: Proceedings of AAAI-96, Portland, Oregon, pp. 202–208 (1996)
Freuder, E.C., Hubbe, P.D.: Extracting constraint satisfaction subproblems. In: Proceedings of IJCAI-95, Montreal, Canada, pp. 548–555 (1995)
Freuder, E.C.: Eliminating interchangeable values in constraint satisfaction problems. In: Proceedings of AAAI-91, pp. 227–233. Anaheim, California (1991)
Montanari, U.: Networks of constraints: fundamental properties and applications to picture processing. Information Sciences, 95–132 (1974)
Dechter, R., Pearl, J.: Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence 34, 1–38 (1987)
Beck, J.C., Carchrae, T., Freuder, E.C., Ringwelski, G.: Backtrack-free search for real-time constraint satisfaction. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, Springer, Heidelberg (2004)
Samaras, N., Stergiou, K.: Binary encoding of non-binary constraint satisfaction problems: Algorithms and experimental results. Journal of Artificial Intelligence Research, 641–684 (2005)
Yokoo, M.: Weak-commitment search for solving constraint satisfaction problems. In: Proceedings of AAAI-94, Seattle, Washington, pp. 313–318 (1994)
Debruyne, R., Bessière, C.: Domain filtering consistencies. Journal of Artificial Intelligence Research, 205–230 (2001)
Bessiere, C., Debruyne, R.: Optimal and suboptimal singleton arc consistency algorithms. In: Proceedings of IJCAI-05, Edinburgh, U.K (2005)
Lecoutre, C., Cardon, S.: A greedy approach to establish singleton arc consistency. In: Proceedings of IJCAI-05, Edinburgh, U.K, pp. 199–204 (2005)
van Beek, P., Dechter, R.: On the minimality and global consistency of row-convex constraint networks. Journal of the ACM 42, 543–561 (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Likitvivatanavong, C., Yap, R.H.C. (2007). Extracting Microstructure in Binary Constraint Networks. In: Azevedo, F., Barahona, P., Fages, F., Rossi, F. (eds) Recent Advances in Constraints. CSCLP 2006. Lecture Notes in Computer Science(), vol 4651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73817-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-73817-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73816-9
Online ISBN: 978-3-540-73817-6
eBook Packages: Computer ScienceComputer Science (R0)