权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

Unification in Description Logics for Avoiding Redundancies in Medical Ontologies

统一描述逻辑，避免医学本体冗余

基本信息

批准号：
151328653
负责人：
Professor Dr.-Ing. Franz Baader
金额：
--
依托单位：
Professur für Automatentheorie
依托单位国家：
德国
项目类别：
Research Grants
财政年份：
2009
资助国家：
德国
起止时间：
2008-12-31 至 2014-12-31
项目状态：
已结题

来源：
https://gepris.dfg.de/gepris/projekt/151328653?language=en
关键词：
Unification Description Logics Avoiding Redundancies

项目摘要

Unification in Description Logics can in principle be used to detect and thus avoid redundancies in ontologies. The use of unification procedures for this purpose was, however, hindered by the fact that positive results were only known for the inexpressive Description Logic FL0, in which no practical ontologies are formulated and for which the complexity of the unification problem is quite high. Beforesubmission of the original proposal we were able to develop a unification procedure for the DescriptionLogic EL and could show that the complexity of unification in EL is lower than in FL0 (NP-complete versus ExpTime-complete). Although EL is also an inexpressive Description Logic, it is more relevant for applications than FL0. In particular, several well-established medical ontologies (such as SNOMED CT) are written in EL. The goal of the predecessor project was on the one hand to develop and implement a practical unification procedure for EL and to evaluate it on the application of finding redundancies in extensions of SNOMED CT. On the other hand, we wanted to develop unification procedures for application-relevant extensions of EL. In particular, we intended to investigate unification modulo general concept inclusions (GCIs).Although we have obtained a variety of interesting results in the predecessor project, an number of problems mentioned in the proposal turned out to be harder (but also more interesting) than expected. In particular, we have only obtained partial results for unification modulo general concept inclusions. From the application point of view, we encountered the problem that a given unification problem may have a high number of unifiers, of which many may be irrelevant for finding redundancies. Thus, we have to develop methods that compute fewer and relevant unifiers. In the second phase of the project we want to solve these remaining problems. In addition we want to investigate only recently recognized connections to problems from unification theory (rigid E-unification, disunification) and modal logics (admissible inference rules). We will also continue to investigate the application of unification for finding redundancies in ontologies, based on improved procedures for computing unifiers. In addition, we will now also consider unification in extensions of FL0. In fact, the preconditions for this have considerably improved due to two recent results.

描述逻辑中的统一原则上可以用来检测并避免本体中的冗余。然而，统一程序的使用受到这样一个事实的阻碍，即积极的结果只为缺乏表现力的描述逻辑FL 0所知，其中没有制定实际的本体论，统一问题的复杂性相当高。在提交原始提案之前，我们能够为DescriptionLogic EL开发一个统一程序，并可以证明EL中统一的复杂性低于FL 0（NP完全与ExpTime完全）。虽然EL也是一种缺乏表达力的描述逻辑，但它比FL 0更适用于应用程序。特别是，几个完善的医学本体（如SNOMED CT）是用EL编写的。前一个项目的目标是一方面开发和实施EL的实用统一程序，并评估其在SNOMED CT扩展中查找冗余的应用。另一方面，我们希望为EL的应用相关扩展开发统一程序。特别是，我们打算研究统一模一般概念包含（GCI）。虽然我们已经获得了各种有趣的结果，在前一个项目中，建议中提到的一些问题原来比预期的更难（但也更有趣）。特别地，我们只得到了统一模一般概念包含的部分结果。从应用的角度来看，我们遇到的问题，一个给定的统一问题可能有大量的统一，其中许多可能是无关的寻找冗余。因此，我们必须开发计算较少且相关的统一符的方法。在项目的第二阶段，我们希望解决这些遗留问题。此外，我们要调查最近才认识到的连接到统一理论（刚性E-统一，不统一）和模态逻辑（可接受的推理规则）的问题。我们还将基于改进的计算统一符的程序，继续研究统一在查找本体中冗余的应用。此外，我们现在还将考虑FL 0扩展中的统一。事实上，由于最近的两项成果，这方面的先决条件已经大大改善。