Abstract
Most work in constraint satisfaction has concentrated on computing a solution to a given problem. In practice, it often happens that an existing solution needs to be modified to satisfy additional criteria or changes in the problem. For example, a schedule or plan might have to be adjusted when a resource is missing. The concept of interchangeability characterizes the possibilities for making local changes to CSP solutions.
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 subscriptionsReferences
Eugene C. Freuder. Eliminating Interchangeable Values in Constraint Satisfaction Problems. In In Proc. of AAAI-91, pages 227–233, Anaheim, CA, 1991.
Nicoleta Neagu and Boi Faltings. Exploiting Interchangeabilities for Case Adaptation. In In Proc. of the 4th ICCBR-01, pages 422–437, Vancouver, CA, 2001.
Stefano Bistarelli, Boi Faltings, and Nicoleta Neagu. Interchangeability in Soft CSPs. In Proc. of the 8th CP-2002., Ithaca, NY, USA, 2002.
Stefano Bistarelli, Ugo Montanari, and Francesca Rossi. Semiring-based Constraint Solving and Optimization. Journal of ACM., 44, n. 2:201–236, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neagu, N. (2002). Studying Interchangeability in Constraint Satisfaction Problems. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_81
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive