Tightly integrated probabilistic description logic programs for representing ontology mappings

  • Authors:

  • Thomas Lukasiewicz;Livia Predoiu;Heiner Stuckenschmidt

  • Affiliations:

  • Department of Computer Science, University of Oxford, Oxford, UK;Institut für Technische und Betriebliche Informationssysteme, Universität Magdeburg, Magdeburg, Germany;Institut für Informatik, Universität Mannheim, Mannheim, Germany

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 deal with uncertainty and inconsistencies in automatically created mappings. We analyze the requirements for such a formalism, and we propose a novel approach to probabilistic description logic programs as such a formalism, which tightly combines normal logic programs under the well-founded semantics with both tractable ontology languages and Bayesian probabilities. We define the language, and we show that it can be used to resolve inconsistencies and merge mappings from different matchers based on the level of confidence assigned to different rules. Furthermore, we explore the semantic and computational aspects of probabilistic description logic programs under the well-founded semantics. In particular, we show that the well-founded semantics approximates the answer set semantics. We also describe algorithms for consistency checking and tight query processing, and we analyze the data and general complexity of these two central computational problems. As a crucial property, the novel tightly integrated probabilistic description logic programs under the well-founded semantics allow for tractable consistency checking and for tractable tight query processing in the data complexity, and they even have a first-order rewritable (and thus LogSpace data complexity) special case, which is especially interesting for representing ontology mappings.