The Open UniversitySkip to content

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: 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.

DOI (Digital Object Identifier) Link:
Google Scholar: Look up in Google Scholar


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.

Item Type: Book Chapter
ISBN: 3-540-89764-X, 978-3-540-89764-4
Extra Information: ISWC International Workshops, URSW 2005-2007, Revised Selected and Invited Papers
Academic Unit/Department: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Knowledge Media Institute (KMi)
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Other Departments > Vice-Chancellor's Office
Other Departments
Interdisciplinary Research Centre: Centre for Research in Computing (CRC)
Item ID: 12766
Depositing User: Victoria Uren
Date Deposited: 05 Feb 2009 07:02
Last Modified: 02 Aug 2016 13:20
Share this page:


Scopus Citations

▼ Automated document suggestions from open access sources

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340