Tightly integrated probabilistic description logic programs for representing ontology mappings.
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 able to d...
Հիմնական հեղինակներ: | Lukasiewicz, T, Predoiu, L, Stuckenschmidt, H |
---|---|
Ձևաչափ: | Journal article |
Լեզու: | English |
Հրապարակվել է: |
2011
|
Նմանատիպ նյութեր
-
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
: Lukasiewicz, T, և այլն
Հրապարակվել է: (2011) -
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings.
: Calì, A, և այլն
Հրապարակվել է: (2008) -
Tightly Integrated Probabilistic Description Logic Programs for Representing Ontology Mappings
: Calì, A, և այլն
Հրապարակվել է: (2008) -
Representing Ontology Mappings with Probabilistic Description Logics Programs
: Calì, A, և այլն
Հրապարակվել է: (2008) -
Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web.
: Calì, A, և այլն
Հրապարակվել է: (2009)