论文信息 - A Simple View of the Dempster-Shafer Theory of Evidence and Its Implication for the Rule of Combination

A Simple View of the Dempster-Shafer Theory of Evidence and Its Implication for the Rule of Combination

Revised version of #27. PLEASE NOTE: all we have available online here is the title page and abstract. The complete report is available in print in "AI Magazine," Vol. 7, No. 2, Summer 1986, pp. 85-90.

Lotfi A. Zadeh | L. Zadeh

[1] S. Jerrold Kaplan,et al. Cooperative Responses from a Portable Natural Language Query System , 1982, Artif. Intell..

[2] Jeffrey A. Barnett,et al. Computational Methods for a Mathematical Theory of Evidence , 1981, IJCAI.

[3] Bonnie L. Webber,et al. Taking the Initiative in Natural Language Data Base Interactions: Justifying Why , 1982, COLING.

[4] Lotfi A. Zadeh,et al. On the Validity of Dempster''s Rule of Combination of Evidence , 1979 .

[5] Joachim Biskup,et al. A Formal Approach to Null Values in Database Relations , 1979, Advances in Data Base Theory.

[6] Glenn Shafer,et al. A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[7] John D. Lowrance,et al. Reasoning About Control: An Evidential Approach , 1984 .

[8] R. A. Dillard. Computing Confidences in Tactical Rule-Based Systems by Using Dempster- Shafer Theory , 1983 .

[9] Lotfi A. Zadeh,et al. Fuzzy sets and information granularity , 1996 .

[10] John D. Lowrance,et al. Evidential Reasoning: An Implementation for Multisensor Integration , 1983 .

[11] Henri Prade,et al. Lipski's approach to incomplete information databases restated and generalized in the setting of Zadeh's possibility theory , 1984, Inf. Syst..