Using the Dempster-Shafer Theory of Evidence to Resolve ABox Inconsistencies

  • Authors:
  • Andriy Nikolov;Victoria Uren;Enrico Motta;Anne Roeck

  • Affiliations:
  • Knowledge Media Institute, The Open University, Milton Keynes, UK;Knowledge Media Institute, The Open University, Milton Keynes, UK;Knowledge Media Institute, The Open University, Milton Keynes, UK;Knowledge Media Institute, The Open University, Milton Keynes, UK

  • Venue:
  • Uncertainty Reasoning for the Semantic Web I
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Automated ontology population using information extraction algorithms can produce inconsistent knowledge bases. Confidence values assigned by the extraction algorithms may serve as evidence in helping to repair inconsistencies. The Dempster-Shafer theory of evidence is a formalism, which allows appropriate interpretation of extractors' confidence values. This chapter presents an algorithm for translating the subontologies containing conflicts into belief propagation networks and repairing conflicts based on the Dempster-Shafer plausibility.