Interchangeability for Case Adaptation in Configuration Problems
暂无分享,去创建一个
We address in this paper the adaptation of a case when a complete constraint model of the underlying problem is given. The idea is to apply methods from constraint based reasoning that allows the detection of "similar" solutions, which can be used to adapt a selected case to a new situation. We consider applications like configuration where a complete constraint model is available. For these applications it is often advantageous to use a case-based approach because constructing a solution form scratch requires often more interaction than taking a complete solution (case) and adapt it fit the current requirements.
[1] Boi Faltings,et al. Structuring Techniques for Constraint Satisfaction Problems , 1997, IJCAI.
[2] Berthe Y. Choueiry,et al. Context in Discrete Constraint Satisfaction Problems , 1996, ECAI.
[3] Boi Faltings,et al. CASE REUSE BY MODEL-BASED INTERPRETATION , 1997 .
[4] Andrés Gómez de Silva Garza,et al. Case-Based Reasoning in Design , 1995, IEEE Expert.
[5] Eugene C. Freuder. Eliminating Interchangeable Values in Constraint Satisfaction Problems , 1991, AAAI.