A Study of Associative Evidential Reasoning

03/27/2013
by   Yizong Cheng, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 7

page 8

research
11/21/2017

Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?

Many reasoning problems are based on the problem of satisfiability (SAT)...
research
03/27/2013

Towards a Normative Theory of Scientific Evidence

A scientific reasoning system makes decisions using objective evidence i...
research
02/07/2022

Combining Evidence

The problem of combining the evidence concerning an unknown, contained i...
research
03/27/2013

Evidence as Opinions of Experts

We describe a viewpoint on the Dempster/Shafer 'Theory of Evidence', and...
research
03/27/2013

Knowledge Structures and Evidential Reasoning in Decision Analysis

The roles played by decision factors in making complex subject are decis...
research
03/27/2013

Evidence Combination and Reasoning and Its Application to Real-World Problem-Solving

In this paper a new mathematical procedure is presented for combining di...
research
03/06/2013

Discounting and Combination Operations in Evidential Reasoning

Evidential reasoning is now a leading topic in Artificial Intelligence. ...

Please sign up or login with your details

Forgot password? Click here to reset