一种可处理的描述逻辑中事例的自适应算法
Algorithm for Adapting Cases Represented in a Tractable Description Logic
摘要:
基于描述逻辑的案例推理(CBR)近年来受到了广泛的关注。自适应是CBR推理中的一个基本任务,可以建模为知识库修正问题,并在命题逻辑中解决。然而,在DL中,它仍然是一个挑战性的问题,因为现有的修订操作仅适用于严格限制的DL的\emph{DL-Lite}家庭,这是很难设计的修订算法,这是语法无关的和细粒度的。在本文中,我们提出了一种新的方法适应的基础上DL $\mathcal{EL_{\bot}}$。遵循修改即修改的思想,首先将命题逻辑中描述事例的逻辑基础扩展到DL $\mathcal{EL_{\bot}}$,并给出了基于$\mathcal{EL_{\bot}}$的修改形式.然后,我们提出了一个适应算法,这种形式主义,并证明我们的算法是语法无关和细粒度。我们的工作提供了一个逻辑基础,适应CBR系统的情况下,领域知识描述的易处理的DL $\mathcal{EL_{\bot}}$。
英文摘要:
Case-based reasoning (CBR) based on description logics (DLs) has gained a lot of attention lately. Adaptation is a basic task in the CBR inference that can be modeled as the knowledge base revision problem and solved in propositional logic. However, in DLs, it is still a challenge problem since existing revision operators only work well for strictly restricted DLs of the \emph{DL-Lite} family, and it is difficult to design a revision algorithm which is syntax-independent and fine-grained. In this paper, we present a new method for adaptation based on the DL $\mathcal{EL_{\bot}}$. Following the idea of adaptation as revision, we firstly extend the logical basis for describing cases from propositional logic to the DL $\mathcal{EL_{\bot}}$, and present a formalism for adaptation based on $\mathcal{EL_{\bot}}$. Then we present an adaptation algorithm for this formalism and demonstrate that our algorithm is syntax-independent and fine-grained. Our work provides a logical basis for adaptation in CBR systems where cases and domain knowledge are described by the tractable DL $\mathcal{EL_{\bot}}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。