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...
Main Authors: | Calì, A, Lukasiewicz, T, Predoiu, L, Stuckenschmidt, H |
---|---|
פורמט: | Conference item |
יצא לאור: |
Springer
2008
|
פריטים דומים
-
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings.
מאת: Calì, A, et al.
יצא לאור: (2008) -
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
מאת: Lukasiewicz, T, et al.
יצא לאור: (2011) -
Tightly integrated probabilistic description logic programs for representing ontology mappings.
מאת: Lukasiewicz, T, et al.
יצא לאור: (2011) -
Representing Ontology Mappings with Probabilistic Description Logics Programs
מאת: Calì, A, et al.
יצא לאור: (2008) -
Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
מאת: Calì, A, et al.
יצא לאור: (2009)