Ideal Downward Refinement in the EL Description Logic
Ideal Downward Refinement in the EL Description Logic
复制标题
EL 描述逻辑中的理想向下细化
DOI：
10.1007/978-3-642-13840-9_8
复制
发表时间：
2009
期刊：
影响因子：
7.5
通讯作者：
C. Haase
中科院分区：
文献类型：
--
作者：
Jens Lehmann;C. Haase
随着语义网的发展，描述逻辑成为W3C标准本体语言OWL的逻辑基础。随着OWL知识库数量的增长，对帮助知识工程师建立和维护其结构的工具的需求也越来越大。为此，概念学习算法的基础上细化运营商进行了研究。在本文中，我们提供了一个理想的细化算子的描述逻辑\（\mathcal{EL}\），并表明它是计算上可行的大型知识库。
With the proliferation of the Semantic Web, there has been a rapidly rising interest in description logics, which form the logical foundation of the W3C standard ontology language OWL. While the number of OWL knowledge bases grows, there is an increasing demand for tools assisting knowledge engineers in building up and maintaining their structure. For this purpose, concept learning algorithms based on refinement operators have been investigated. In this paper, we provide an ideal refinement operator for the description logic \(\mathcal{EL}\) and show that it is computationally feasible on large knowledge bases.