Algorithm for adapting cases represented in a tractable description logic

Abstract

Case-based reasoning (CBR) based on description logics (DLs) has gained a lot of attention lately. Adaptation is a basic task in CBR that can be modeled as a knowledge base revision problem which has been solved in propositional logic. However, in DLs, adaptation is still a challenge problem since existing revision operators only work well for DLs of the DL-Lite family. It is difficult to design revision algorithms that are syntax-independent and fine-grained. In this paper, we propose a new method for adaptation based on the tractable DL (Formula presented.). Following the idea of adaptation as revision, we firstly extend the logical basis for describing cases from propositional logic to DL and present a formalism for adaptation based on (Formula presented.). Then we show that existing revision operators and algorithms in DLs can not be used for this formalism. Finally we present our adaptation algorithm. Our algorithm is syntax-independent and finegrained, and satisfies the requirements on revision operators.