Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
Evidential Confirmation as Transformed Probability
Benjamin Grosof
A considerable body of work in AI has been concerned with aggregating measures of confirmatory and disconfirmatory evidence for a common set of propositions. Claiming classical probability to be inadequate or inappropriate, several researchers have gone so far as to invent new formalisms and methods. We show how to represent two major such alternative approaches to evidential confirmation not only in terms of transformed (Bayesian) probability, but also in terms of each other. This unifies two of the leading approaches to confirmation theory, by showing that a revised MYCIN Certainty Factor method [12] is equivalent to a special case of Dempster-Shafer theory. It yields a well-understood axiomatic basis, i.e. conditional independence, to interpret previous work on quantitative confirmation theory. It substantially resolves the "taxe-them-or-leave-them" problem of priors: MYCIN had to leave them out, while PROSPECTOR had to have them in. It recasts some of confirmation theory's advantages in terms of the psychological accessibility of probabilistic information in different (transformed) formats. Finally, it helps to unify the representation of uncertain reasoning (see also [11]).
Keywords: MYCIN, PROSPECTOR, Evidential Confirmation
Pages: 185-192
PS Link:
PDF Link: /papers/85/p185-grosof.pdf
AUTHOR = "Benjamin Grosof ",
TITLE = "Evidential Confirmation as Transformed Probability",
BOOKTITLE = "Proceedings of the First Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-85)",
ADDRESS = "Corvallis, Oregon",
YEAR = "1985",
PAGES = "185--192"

hosted by DSL   •   site info   •   help