Simplifying Description Logic Ontologies
Simplifying Description Logic Ontologies
复制标题
简化描述逻辑本体
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
S. Schewe
中科院分区：
文献类型：
--
作者：
Nadeschda Nikitina;S. Schewe
我们讨论了用轻量级描述逻辑$mathcal{EL}$表达的tbox的最小化问题，它构成了一些大型本体如SNOMED、Gene Ontology、NCI和Galen的基础。我们证明了tbox的最小化是难以处理的（np完全）。虽然这看起来像是一个坏消息，但我们还提供了一种最小化tbox的启发式技术。我们证明了启发式的正确性，并表明它为一类本体提供了最优结果，这些本体是通过等价类之间的引用关系上的非循环约束来定义的。为了确定我们的方法的可行性，我们已经实现了该算法并在一小组基准测试中评估了其有效性。
We discuss the problem of minimizing TBoxes expressed in the lightweight description logic $mathcal{EL}$ , which forms a basis of some large ontologies like SNOMED, Gene Ontology, NCI and Galen. We show that the minimization of TBoxes is intractable (NP-complete). While this looks like a bad news result, we also provide a heuristic technique for minimizing TBoxes. We prove the correctness of the heuristics and show that it provides optimal results for a class of ontologies, which we define through an acyclicity constraint over a reference relation between equivalence classes of concepts. To establish the feasibility of our approach, we have implemented the algorithm and evaluated its effectiveness on a small suite of benchmarks.