Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
A Goal-Oriented Algorithm for Unification in w.r.t. Cycle-Restricted Ontologies
verfasst von : Franz Baader, Stefan Borgwardt, Barbara Morawska
Erschienen in: AI 2012: Advances in Artificial Intelligence
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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
$\mathcal{EL}$
, which is used to define several large biomedical ontologies, unification is
NP
-complete. A goal-oriented NP unification algorithm for
$\mathcal{EL}$
that uses nondeterministic rules to transform a given unification problem into solved form has recently been presented. In this paper, 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 (
$\mathcal{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.