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

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

• Type: Conference
• Year: 2007
• Where: SEMWEB
• Authors: Andriy Nikolov, Victoria S. Uren, Enrico Motta, Anne N. De Roeck
• Keywords: Confidence Values, Extraction Algorithms, Information Extraction Algorithms, SEMWEB 2007