Using 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,
which allows to reason with ontologies and mappings in an integrated manner, and to deal with uncertainty and inconsistencies
in automatically created mappings. We analyze the requirements for such a formalism, and propose to use frameworks that integrate
description logic ontologies with probabilistic rules. We compare two such frameworks and show the advantages of using the
probabilistic extensions of their deterministic counterparts. The two frameworks that we compare are tightly coupled probabilistic
dl-programs, which tightly combine the description logics behind OWL DL resp. OWL Lite, disjunctive logic programs under the
answer set semantics, and Bayesian probabilities, on the one hand, and generalized Bayesian dl-programs, which tightly combine
the DLP-fragment of OWL Lite with Datalog (without negation and equality) based on the semantics of Bayesian networks, on
the other hand.
Keywords Representing probabilistic ontology mappings - rule languages - Semantic Web - uncertainty - inconsistency - probabilistic description logic programs - description logics - disjunctive logic programs - answer set semantics - Bayesian probabilities - Bayesian description logic programs - Datalog - Bayesian networks
This paper is a significantly extended and revised version of a paper that appeared in: Proceedings URSW-2007. CEUR Workshop Proceedings 327, CEUR-WS.org, 2008.