Dempster combination rule with boolean-like processed belief functions

International Journal of Uncertainty, Fuzziness and Knowldege-Based Systems

Volumn 9, Issue 1, 2001, Pages 105-121

  Kramosil, Ivan ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

Belief function; Boolean algebra; Dempster Shafer theory

Indexed keywords

EID: 0348238050     PISSN: 02184885     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021848850100065X     Document Type: Article

References (8)

1. D. Dubois, H. Prade, Théorie de Possibilités - Applications à la Représentation de Connaissances en Informatique (Mason, Paris, 1985).
2. R. Faure, E. Heurgon, Structures Ordonnées et Algébres de Boole (Gauthier-Villars, Paris, 1971).
3. P. R. Halmos, Measure Theory (D. van Nostrand, New York - Toronto - London, 1950).
4. I. Kramosil, "Believeability and plausibility functions over infinite sets". International Journal of General Systems 23(2):173-198, 1994.
5. I. Kramosil, Probabilistic analysis of Dempster combination rule. In The Logica Yearbook 97, ed. Timothy Childers, (Filosofia, Prague, 1998) pp. 175-187.
6. I. Kramosil, "Probabilistic analysis of Dempster-Shafer theory - Parts I, II, III". Technical Reports nos 716, 749, 777, Institute of Computer Science, Acad. of Sci. of the Czech Republic, 1997, 1998, 1999.
7. G. Shafer, A Mathematical Theory of Evidence (Princeton Univ. Press, Princeton, 1976).
8. R. Sikorski, Boolean Algebras (Springer Verlag, Berlin - Göttinger - Heidelberg, 1960).