Consistent approximations of belief functions

Abstract

Consistent belief functions represent collections of coherent or non-contradictory pieces of evidence. As most operators used to update or elicit evidence do not preserve consistency, the use of consistent transformations cs[·] in a reasoning process to guarantee coherence can be desirable. Such transformations are turn linked to the problem of… (More)

5 Figures and Tables

Topics

  • Presentations referencing similar topics