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)