We extend the notion of belief function to the case where the underlying structure is no more the Boolean lattice of subsets of some universal set, but any lattice, which we will endow with a minimal set of properties according to our needs. We show that all classical constructions and definitions (
On conditional belief functions
β Scribed by Chunhai Yu; Fahard Arasta
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 577 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0888-613X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The concept of knowledge or belief so important in Artificial Intelligence (AI) has been discussed in depth by philosophers, exemplified by Giirdenfors [1]. Whereas it is useful to have a broad view on the topic, it is also necessary to look at concrete models (eg, numerical modeling of degrees of b
Alternative approaches to the widely known pignistic transformation of belief functions are presented and analyzed. Pignistic, cautious, proportional, and disjunctive probabilistic transformations are examined from the point of view of their interpretation, of decision making and ~from the point of