Modifiable combining functions
- 27 February 1987
- journal article
- research article
- Published by Cambridge University Press (CUP) in Artificial Intelligence for Engineering Design, Analysis and Manufacturing
- Vol. 1 (1) , 47-57
- https://doi.org/10.1017/s0890060400000147
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.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Design for acquisition: principles of knowledge-system design to facilitate knowledge acquisitionInternational Journal of Man-Machine Studies, 1987
- Management of uncertainty in medicineInternational Journal of Approximate Reasoning, 1987
- Fusion, propagation, and structuring in belief networksArtificial Intelligence, 1986
- Propagating Belief Functions with Local ComputationsIEEE Expert, 1986
- Languages and Designs for Probability Judgment*Cognitive Science, 1985
- Jeffrey's Rule of ConditioningPhilosophy of Science, 1981
- Towards the simulation of clinical cognitionThe American Journal of Medicine, 1976
- A model of inexact reasoning in medicineMathematical Biosciences, 1975
- Some Studies in Machine Learning Using the Game of CheckersIBM Journal of Research and Development, 1959