Revision rules in the theory of evidence
Data(s) |
01/10/2010
|
---|---|
Resumo |
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<br/>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<br/>revisions, and a modified adaptive outer revision, which better corresponds to the idea of revision. Properties of these revision rules are also investigated. |
Identificador |
http://www.scopus.com/inward/record.url?scp=78751548002&partnerID=8YFLogxK |
Idioma(s) |
eng |
Publicador |
IEEE Computer Society |
Direitos |
info:eu-repo/semantics/restrictedAccess |
Fonte |
Ma , J , Liu , W , Dubois , D & Prade , H 2010 , Revision rules in the theory of evidence . in 22nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2010 . IEEE Computer Society , pp. 230-238 , 22nd International Conference on Tools with AI (ICTAI'10) , Lille , France , 1-1 October . |
Tipo |
contributionToPeriodical |