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

Andriy Nikolov, Victoria Uren, Enrico Motta, Anne de Roeck

Research output: Chapter in Book/Published conference outputConference publication

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.
Original languageEnglish
Title of host publicationUncertainty reasoning for the semantic web I
Subtitle of host publicationISWC International Workshops, URSW 2005-2007, revised selected and invited papers
EditorsPaulo C.G. da Costa, Claudia d'Amato, Nicola Fanizzi, Kathryn B. Laskey, Kenneth J. Laskey, Thomas Lukasiewicz, Matthias Nickles, Michael Pool
Place of PublicationBerlin (DE)
PublisherSpringer
Pages143-160
Number of pages18
Volume5327 LNAI
ISBN (Electronic)978-3-540-89765-1
ISBN (Print)978-3-540-89764-4
DOIs
Publication statusPublished - 2008

Publication series

NameLecture notes in computer science
PublisherSpringer
Volume5327
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Bibliographical note

First Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2005).
Second Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2006).
Third Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2007).

Fingerprint

Dive into the research topics of 'Using the Dempster-Shafer theory of evidence to resolve ABox inconsistencies'. Together they form a unique fingerprint.

Cite this