Dambreville, FredericFähnrich, Klaus-PeterFranczyk, Bogdan2019-01-112019-01-112010978-3-88579-270-3https://dl.gi.de/handle/20.500.12116/19339An approach for a generic implementation of combination rules of evidence is proposed. This approach implies a tripartite architecture, with respective parts implementing the logical framework (complete distributive lattice, Boolean algebra), the combination definition (referee function), and the belief-related processes (basic belief assignment, belief and plausibility computation, computations of the combinations according to their definitions). Referee functions are decisional arbitrament conditionally to basic decisions provided by the sources of information. Two generic processes are proposed for computing combination rule defioned by referee functions: a sampling method and a deterministic method based on an adaptive reduction of the set of focal elements. The proposed generic implementation makes possible the construction of several rules simply on the basis of a referee function extension. Notations $\bullet $I[boolean] is defined by I[true] = 1 and I[false] = 0 . $\bullet GΘ$denotes a complete distributive lattice or Boolean algebra generated by $Θ, \bullet x1$:n and {xj}j=1:n are abbreviations for the sequence x1, $\cdot \cdot \cdot $, xn .enText/Conference Paper1617-5468