Probabilistic Argumentation Systems
Probabilistic Argumentation Systems
复制标题
概率论证系统
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
Norbert Lehmann
中科院分区：
文献类型：
--
作者：
R. Haenni;J. Kohlas;Norbert Lehmann
到目前为止，已经开发了不同的形式主义来解决不确定性推理问题。最流行的数值方法是贝叶斯推理理论[Lauritzen和Spiegelhalter，1988]。更一般的方法是证据的Dempster-Shafer理论[Shafer，1976]和可能性理论[Dubois和Prade，1990]，这是密切相关的模糊系统。对于这些系统，计算机实现是可用的。与这些数值方法竞争的是不同的符号方法。它们中的许多是基于不同类型的非单调逻辑。
Different formalisms for solving problems of inference under uncertainty have been developed so far. The most popular numerical approach is the theory of Bayesian inference [Lauritzen and Spiegelhalter, 1988]. More general approaches are the Dempster-Shafer theory of evidence [Shafer, 1976], and possibility theory [Dubois and Prade, 1990], which is closely related to fuzzy systems. For these systems computer implementations are available. In competition with these numerical methods are different symbolic approaches. Many of them are based on different types of non-monotonic logic.