A Study of Associative Evidential Reasoning

TL;DR

This paper explores methods for simplifying evidence-hypothesis relations and constructing combination formulas in evidential reasoning, focusing on properties like robustness and the roles of specific evidence classes.

Contribution

It introduces a framework for constructing evidence combination formulas with testable properties, analyzing classes of evidence and their influence on binary operations.

Findings

Identification of key classes of evidence such as identifiers, annihilators, and idempotents.

Analysis of the limitations of evidence combination formulas in terms of robustness.

Guidelines for constructing effective evidence combination formulas.

Abstract

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.