Modifiable combining functions

Paul R Cohen, Glenn Shafer, Prakash P. Shenoy

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Modifiable combining functions are a synthesis of two common approaches to combining evidence. They offer many of the advantages of these approaches and avoid some disadvantages. Because they facilitate the acquisition, representation, explanation, and modification of knowledge about combinations of evidence, they are proposed as a tool for knowledge engineers who build systems that reason under uncertainty, not as a normative theory of evidence.

Original languageEnglish (US)
Pages (from-to)47-57
Number of pages11
JournalArtificial Intelligence for Engineering, Design, Analysis and Manufacturing
Volume1
Issue number1
DOIs
StatePublished - 1987
Externally publishedYes

Fingerprint

Engineers
Uncertainty

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Artificial Intelligence

Cite this

Modifiable combining functions. / Cohen, Paul R; Shafer, Glenn; Shenoy, Prakash P.

In: Artificial Intelligence for Engineering, Design, Analysis and Manufacturing, Vol. 1, No. 1, 1987, p. 47-57.

Research output: Contribution to journalArticle

Cohen, Paul R ; Shafer, Glenn ; Shenoy, Prakash P. / Modifiable combining functions. In: Artificial Intelligence for Engineering, Design, Analysis and Manufacturing. 1987 ; Vol. 1, No. 1. pp. 47-57.
@article{35f04d66569b40ec975c90abe76fe091,
title = "Modifiable combining functions",
abstract = "Modifiable combining functions are a synthesis of two common approaches to combining evidence. They offer many of the advantages of these approaches and avoid some disadvantages. Because they facilitate the acquisition, representation, explanation, and modification of knowledge about combinations of evidence, they are proposed as a tool for knowledge engineers who build systems that reason under uncertainty, not as a normative theory of evidence.",
author = "Cohen, {Paul R} and Glenn Shafer and Shenoy, {Prakash P.}",
year = "1987",
doi = "10.1017/S0890060400000147",
language = "English (US)",
volume = "1",
pages = "47--57",
journal = "Artificial Intelligence for Engineering Design, Analysis and Manufacturing: AIEDAM",
issn = "0890-0604",
publisher = "Cambridge University Press",
number = "1",

}

TY - JOUR

T1 - Modifiable combining functions

AU - Cohen, Paul R

AU - Shafer, Glenn

AU - Shenoy, Prakash P.

PY - 1987

Y1 - 1987

N2 - Modifiable combining functions are a synthesis of two common approaches to combining evidence. They offer many of the advantages of these approaches and avoid some disadvantages. Because they facilitate the acquisition, representation, explanation, and modification of knowledge about combinations of evidence, they are proposed as a tool for knowledge engineers who build systems that reason under uncertainty, not as a normative theory of evidence.

AB - Modifiable combining functions are a synthesis of two common approaches to combining evidence. They offer many of the advantages of these approaches and avoid some disadvantages. Because they facilitate the acquisition, representation, explanation, and modification of knowledge about combinations of evidence, they are proposed as a tool for knowledge engineers who build systems that reason under uncertainty, not as a normative theory of evidence.

UR - http://www.scopus.com/inward/record.url?scp=84912867440&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84912867440&partnerID=8YFLogxK

U2 - 10.1017/S0890060400000147

DO - 10.1017/S0890060400000147

M3 - Article

AN - SCOPUS:84912867440

VL - 1

SP - 47

EP - 57

JO - Artificial Intelligence for Engineering Design, Analysis and Manufacturing: AIEDAM

JF - Artificial Intelligence for Engineering Design, Analysis and Manufacturing: AIEDAM

SN - 0890-0604

IS - 1

ER -