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