Using the Dempster-Shafer theory of evidence to resolve ABox inconsistencies

Nikolov, Andriy; Uren, Victoria; Motta, Enrico and De Roeck, Anne (2008). Using the Dempster-Shafer theory of evidence to resolve ABox inconsistencies. In: Uncertainty Reasoning for the Semantic Web I. URSW 2006, URSW 2007, URSW 2005 (da Costa, P. C. G.; d’Amato, Claudia; Fanizzi, Nicola; Laskey, Kathryn B.; Laskey, Kenneth J.; Lukasiewicz, Thomas; Nickles, Matthias and Michael, Pool eds.), Lecture Notes in Computer Science, Springer, UK, pp. 143–160.

DOI: https://doi.org/10.1007/978-3-540-89765-1_9

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.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI