Advertisement

9. Interchangeability in Soft CSPs

  • Stefano Bistarelli
Chapter
  • 283 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2962)

Abstract

Substitutability and interchangeability in constraint satisfaction problems (CSPs) have been used as a basis for search heuristics, solution adaptation and abstraction techniques. In this chapter, we consider how the same concepts can be extended to soft constraint satisfaction problems (SCSPs).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Stefano Bistarelli

    There are no affiliations available

    Personalised recommendations