Abstract
We investigate techniques that detect, dynamically during search, undeclared symmetries in the form of interchangeability (Freuder’91) in Constraint Satisfaction Problems, with the long-term goal of drawing a compact landscape of the solution space of a given CSP instance. As a first step towards our goal, we propose a new algorithm for dynamically computing interchangeability during backtrack search and demonstrate how it enhances the performance of search.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beckwith, A.M., Choueiry, B.Y. (2001). On the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_61
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive