Abstract
Super solutions are a mechanism to provide robustness to constraint programs. We introduce a new algorithm that exploits the similarity between a super solution and its repairs in order to do inference during search. It improves on previous methods since it is more space efficient and also faster in practice.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Debruyne, R., Bessière, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: IJCAI 1997, pp. 412–417 (1997)
Hebrard, E., Hnich, B., Walsh, T.: Robust solutions for constraint satisfaction and optimization. In: Proceedings ECAI 2004 (2004)
Parkes, A., Ginsberg, M., Roy, A.: Supermodels and robustness. In: Proceedings AAAI 1998, pp. 334–339 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hebrard, E., Walsh, T. (2005). Improved Algorithm for Finding (a,b)-Super Solutions. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_86
Download citation
DOI: https://doi.org/10.1007/11564751_86
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)