A Goal-Oriented Algorithm for Unification in ℇℒℋR+ w.r.t. Cycle-Restricted Ontologies
A Goal-Oriented Algorithm for Unification in ℇℒℋR+ w.r.t. Cycle-Restricted Ontologies
复制标题
ℇℒℋR+ w.r.t. 中的面向目标的统一算法
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
Barbara Morawska
中科院分区：
文献类型：
--
作者：
F. Baader;Stefan Borgwardt;Barbara Morawska
Unification in Description Logics (DLs) has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. For the DL EL, which is used to define several large biomedical ontologies, unification is NP-complete. A goal-oriented NP unification algorithm for EL that uses nondeterministic rules to transform a given unification problem into solved form has recently been presented. In this report, we extend this goal-oriented algorithm in two directions: on the one hand, we add general concept inclusion axioms (GCIs), and on the other hand, we add role hierarchies (H) and transitive roles (R+). For the algorithm to be complete, however, the ontology consisting of the GCIs and role axioms needs to satisfy a certain cycle restriction.
