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...
Asıl Yazarlar: | Calì, A, Lukasiewicz, T, Predoiu, L, Stuckenschmidt, H |
---|---|
Materyal Türü: | Conference item |
Baskı/Yayın Bilgisi: |
Springer
2008
|
Benzer Materyaller
-
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings.
Yazar:: Calì, A, ve diğerleri
Baskı/Yayın Bilgisi: (2008) -
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
Yazar:: Lukasiewicz, T, ve diğerleri
Baskı/Yayın Bilgisi: (2011) -
Tightly integrated probabilistic description logic programs for representing ontology mappings.
Yazar:: Lukasiewicz, T, ve diğerleri
Baskı/Yayın Bilgisi: (2011) -
Representing Ontology Mappings with Probabilistic Description Logics Programs
Yazar:: Calì, A, ve diğerleri
Baskı/Yayın Bilgisi: (2008) -
Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
Yazar:: Calì, A, ve diğerleri
Baskı/Yayın Bilgisi: (2009)