On consistent approximations of belief functions






Fabio Cuzzolin,
Submitted to ECSQARU 2011
Abstract

In this paper we study the class of consistent belief functions, as counterparts of consistent knowledge bases in classical logic. We prove that such class can be defined univocally no matter our definition of proposition implied by a belief function. As consistency can be desirable in decision making, the problem of mapping an arbitrary belief function to a consistent one arise, and can be posed in a geometric setup. We analyze here all the consistent transformations induced by minimizing Lp distances between belief functions, represented by the vectors of their basic probabilities.
 
Download
PDF

BibTeX entry

@inproceedings{cuzzolin11ecsqaru-consistent, 
  AUTHOR = "Fabio Cuzzolin", 
  TITLE = "On consistent approximations of belief functions",
  JOURNAL = "ECSQARU'11 (under review)", 
  YEAR = "2011" 
}