Description Logics (DLs) are a family of knowledge representation formalisms, that provides the theoretical basis for the standard web ontology language OWL. Generalization services like the least common subsumer (lcs) and the most specific concept (msc) are the basis of several ontology design methods, and form the core of similarity measures. For the DL ELOR, which covers most of the OWL 2 EL profile, the lcs and msc need not exist in general, but they always exist if restricted to a given role-depth. We present algorithms that compute these role-depth bounded generalizations. Our method is easy to implement, as it is based on the polynomial-time completion algorithm for ELOR.
Ecke, A., Penaloza, R., Turhan, A. (2013). Computing Role-depth Bounded Generalizations in the Description Logic ELOR. In KI 2013: Advances in Artificial Intelligence ; 36th Annual German Conference on AI, Koblenz, Germany, September 16-20, 2013. Proceedings (pp.49-60). Springer-Verlag [10.1007/978-3-642-40942-4_5].
Computing Role-depth Bounded Generalizations in the Description Logic ELOR
Penaloza, R
;
2013
Abstract
Description Logics (DLs) are a family of knowledge representation formalisms, that provides the theoretical basis for the standard web ontology language OWL. Generalization services like the least common subsumer (lcs) and the most specific concept (msc) are the basis of several ontology design methods, and form the core of similarity measures. For the DL ELOR, which covers most of the OWL 2 EL profile, the lcs and msc need not exist in general, but they always exist if restricted to a given role-depth. We present algorithms that compute these role-depth bounded generalizations. Our method is easy to implement, as it is based on the polynomial-time completion algorithm for ELOR.File | Dimensione | Formato | |
---|---|---|---|
Ecke-2013-Lect Notes Comput Sci-AAM.pdf
accesso aperto
Descrizione: Intervento a convegno
Tipologia di allegato:
Author’s Accepted Manuscript, AAM (Post-print)
Licenza:
Altro
Dimensione
446.35 kB
Formato
Adobe PDF
|
446.35 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.