Dempster’s rule, Yager’s rule and Dubois-Prade’s rule for belief functions combination are generalized to be applicable to hyper-power sets according to the DSm theory. A comparison of the rules with DSm rule of combination is presented.

When combining belief functions by conjunctive rules of combination, conflicts often appear, which are assigned to ∅ by un-normalized conjunctive rule ∩ ⃝ or normalized by Dempster’s rule of combination ⊕ in Dempster-Shafer theory. Combination of conflicting belief functions and interpretation of conflicts is often questionable in real applications, thus a series of alternative combination rule...

A novel architecture is presented for combining rule-based and case-based reasoning. The central idea is to apply the rules to a target problem to get a first approximation to the answer; but if the problem is judged to be compellingly similar to a known exception of the rules in any aspect of its behavior, then that aspect is modelled after the exception rather than the rules. The architecture...

We define reconsideration, a non-prioritized belief change operation on a finite set of base beliefs. Reconsideration is a hindsight belief change repair that eliminates negative effects caused by the order of previously executed belief change operations. Beliefs that had previously been removed are returned to the base if there no longer are valid reasons for their removal. This might result i...

This paper concerns the extent to which uncertain propositional reasoning can track probabilistic reasoning, and addresses kinematic problems that extend the familiar Lottery paradox. An acceptance rule assigns to each Bayesian credal state p a propositional belief revision method Bp, which specifies an initial belief state Bp(⊤), that is revised to the new propositional belief state B(E) upon ...