Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
<p>Creating mappings between ontologies is a common way of approaching the semantic heterogeneity problem on the Semantic Web. To fit into the landscape of semantic web languages, a suitable, logic-based representation formalism for mappings is needed. We argue that such a formalism has to be...
Автори: | Calì, A, Lukasiewicz, T, Predoiu, L, Stuckenschmidt, H |
---|---|
Формат: | Conference item |
Опубліковано: |
Springer
2008
|
Схожі ресурси
Схожі ресурси
-
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings.
за авторством: Calì, A, та інші
Опубліковано: (2008) -
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
за авторством: Lukasiewicz, T, та інші
Опубліковано: (2011) -
Tightly integrated probabilistic description logic programs for representing ontology mappings.
за авторством: Lukasiewicz, T, та інші
Опубліковано: (2011) -
Representing Ontology Mappings with Probabilistic Description Logics Programs
за авторством: Calì, A, та інші
Опубліковано: (2008) -
Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
за авторством: Calì, A, та інші
Опубліковано: (2009)