Studying Interchangeability in Constraint Satisfaction Problems

  • Authors:
  • Nicoleta Neagu

  • Affiliations:
  • -

  • Venue:
  • CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.