An Algorithm for Adaptation in Case-based Reasoning

The adaptation process is an important and complex step of case-based reasoning (CBR) and is most of the time designed for a specific application. This article presents a domain-independent algorithm for adaptation in CBR. Cases are mapped to a set of numerical descriptors filled with values and local constraint intervals. The algorithm computes every target solution descriptor by combining a source solution, a matching expressed as intervals of variations and dependencies between the source problem and its solution. It determines for every target solution descriptor an interval of the admissible values. In this interval, actual values satisfying global constraints can be chosen. This generic approach to adaptation is operational and introduces general and domain-independent adaptation operators. Therefore, this study is a contribution to the design of a general algorithm for adaptation in CBR.