Inclusion–exclusion principle for belief functions
The inclusion–exclusion principle is a well-known property in probability theory, and is instrumental in some computational problems such as the evaluation of system reliability or the calculation of the probability of a Boolean formula in diagnosis. However, in the setting of uncertainty theories m...
Saved in:
Published in: | International journal of approximate reasoning Vol. 55; no. 8; pp. 1708 - 1727 |
---|---|
Main Authors: | , , , , |
Format: | Journal Article |
Language: | English |
Published: |
Amsterdam
Elsevier Inc
01-11-2014
Elsevier |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The inclusion–exclusion principle is a well-known property in probability theory, and is instrumental in some computational problems such as the evaluation of system reliability or the calculation of the probability of a Boolean formula in diagnosis. However, in the setting of uncertainty theories more general than probability theory, this principle no longer holds in general. It is therefore useful to know for which families of events it continues to hold. This paper investigates this question in the setting of belief functions. After exhibiting original sufficient and necessary conditions for the principle to hold, we illustrate its use on the uncertainty analysis of Boolean and non-Boolean systems in reliability.
•We give conditions under which the principle of exclusion/inclusion applies to belief functions.•We discuss its interest for evaluating uncertainty on Boolean formulas and monotone functions.•We illustrate the applicability of our results on reliability analysis problems.•We discuss the connection with other types of independence (strong independence). |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 0888-613X 1873-4731 |
DOI: | 10.1016/j.ijar.2014.04.018 |