Soft Interchangeability for Case Adaptation

In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Problems. In this paper we extend the domain to Soft Constraint Satisfaction Problems and give generic adaptation methods based on soft interchangeability concepts. Many real-life problems require the use of preferences. This need motivates for the use of soft constrains which allows the use of preferences. We have defined interchangeability for soft CSPs in [2] by introducing two notions: (δ /α)substitutability/interchangeability and their algorithms. This paper presents how to build generic adaptation methods based on soft interchangeability. It gives an example of an application of a sales manager system for a car configuration domain and reports test results regarding number of (δ /α)interchangeability in random generated problems, thus number of adaptation alternatives.

• Type: Conference
• Year: 2003
• Where: ICCBR
• Authors: Nicoleta Neagu, Boi Faltings
• Keywords: Constraint Satisfaction Problems, Generic Adaptation Methods, ICCBR 2003, Soft Interchangeability