Modular reuse of ontologies: Theory and practice
Modular reuse of ontologies: Theory and practice
复制标题
DOI：
10.1613/jair.2375
复制
发表时间：
2008-01-01
影响因子：
5
通讯作者：
Sattler, Ulrike
中科院分区：
文献类型：
--
作者：
Grau, Bernardo Cuenca;Horrocks, Ian;Sattler, Ulrike
在本文中，我们提出了一组与本体模块化重复使用相关的任务。为了将这些任务形式化为推理问题，我们介绍了一类非常一般的基于逻辑的本体语言的保守性扩展，安全性和模块的概念。我们研究了这些概念之间的一般属性和关系，并研究了我们先前发现的相关推理问题之间的关系。为了研究这些问题的可计算性，我们特别考虑说明逻辑（DLS），这些逻辑（DLS）提供了W3C Web本体论语言（OWL）的正式基础，并表明我们认为我们认为的所有问题都是不可确定的或在算法上无法解决的问题描述逻辑下猫头鹰DL。为了实现实用的解决方案，我们确定了足以使本体“安全”重复一组符号的条件 - 也就是说，没有改变其含义。我们提供了安全班的概念，该概念表征了任何足够的安全状况，并确定了一个由安全类别的地方，该家族享有所需物业的集合。我们使用安全类的概念来从本体学中提取模块，并提供各种适合使用特定安全类属性的模块化算法。最后，我们显示了安全检查和模块提取算法的实际好处。
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions of conservative extension, safety and module for a very general class of logic-based ontology languages. We investigate the general properties of and relationships between these notions and study the relationships between the relevant reasoning problems we have previously identified. To study the computability of these problems, we consider, in particular, Description Logics (DLs), which provide the formal underpinning of the W3C Web Ontology Language (OWL), and show that all the problems we consider are undecidable or algorithmically unsolvable for the description logic underlying OWL DL. In order to achieve a practical solution, we identify conditions sufficient for an ontology to reuse a set of symbols "safely"-that is, without changing their meaning. We provide the notion of a safety class, which characterizes any sufficient condition for safety, and identify a family of safety classes-called locality-which enjoys a collection of desirable properties. We use the notion of a safety class to extract modules from ontologies, and we provide various modularization algorithms that are appropriate to the properties of the particular safety class in use. Finally, we show practical benefits of our safety checking and module extraction algorithms.