Revision rules in the theory of evidence
- Publication Type:
- Conference Proceeding
- Citation:
- Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI, 2010, 1 pp. 295 - 302
- Issue Date:
- 2010-12-01
Closed Access
Filename | Description | Size | |||
---|---|---|---|---|---|
2013007881OK.pdf | Published version | 336.39 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Combination rules proposed so far in the Dempster-Shafer theory of evidence, especially Dempster rule, rely on a basic assumption, that is, pieces of evidence being combined are considered to be on a par, i.e. play the same role. When a source of evidence is less reliable than another, it is possible to discount it and then a symmetric combination operation is still used. In the case of revision, the idea is to let prior knowledge of an agent be altered by some input information. The change problem is thus intrinsically asymmetric. Assuming the input information is reliable, it should be retained whilst the prior information should be changed minimally to that effect. Although belief revision is already an important subfield of artificial intelligence, so far, it has been little addressed in evidence theory. In this paper, we define the notion of revision for the theory of evidence and propose several different revision rules, called the inner and outer revisions, and a modified adaptive outer revision, which better corresponds to the idea of revision. Properties of these revision rules are also investigated. © 2010 IEEE.
Please use this identifier to cite or link to this item: