A Study of Associative Evidential Reasoning
This work addresses foundational issues in evidential reasoning, but it appears incremental as it builds on existing frameworks without introducing a new paradigm.
The paper tackles the problem of simplifying evidence-hypothesis relations and constructing combination formulas with testable properties, presenting classes of evidence and their roles in determining binary operations on real intervals.
Evidential reasoning is cast as the problem of simplifying the evidence-hypothesis relation and constructing combination formulas that possess certain testable properties. Important classes of evidence as identifiers, annihilators, and idempotents and their roles in determining binary operations on intervals of reals are discussed. The appropriate way of constructing formulas for combining evidence and their limitations, for instance, in robustness, are presented.