Towards a unified theory of adaptation in case-based reasoning

12Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Case-based reasoning exploits memorized problem solving episodes, called cases, in order to solve a new problem. Adaptation is a complex and crucial step of case-based reasoning which is generally studied in the restricted framework of an application domain. This article proposes a first analysis of case adaptation independently from a specific application domain. It proposes to combine the retrieval and adaptation steps in a unique planning process that builds an ordered sequence of operations starting from an initial state (the stated problem) and leading to a final state (the problem once solved). Thus, the issue of case adaptation can be addressed by studying the issue of plan adaptation. Finally, it is shown how case retrieval and case adaptation can be related thanks to reformulations and similarity paths.

Cite

CITATION STYLE

APA

Fuchs, B., Lieber, J., Mille, A., & Napoli, A. (1999). Towards a unified theory of adaptation in case-based reasoning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1650, pp. 104–117). Springer Verlag. https://doi.org/10.1007/3-540-48508-2_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free