Abstract
The nature of a contradiction (conflict) between two belief functions is investigated. Alternative ways of distributing the contradiction among nonempty subsets of frame of discernment are studied. The paper employes a new approach to understanding contradictions and introduces an original notion of potential contradiction. A method of an associative combination of generalized belief functions – minC combination and its derivation – is presented as part of the new approach. A proportionalization of generalized results is suggested as well.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Additional information
RID="*"
ID="*" Support by Grant No. 1030803 of the GA AV ČR is acknowledged.
I am grateful to Philippe Smets for a fruitful discussion on the topic.
Rights and permissions
About this article
Cite this article
Daniel, M. Associativity in combination of belief functions; a derivation of minC combination. Soft Computing 7, 288–296 (2003). https://doi.org/10.1007/s00500-002-0215-5
Issue Date:
DOI: https://doi.org/10.1007/s00500-002-0215-5