.png){kind=icon}
返回
Generalizing inference rules in a coherence-based probabilistic default reasoning
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2011.08.004.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we first recall some notions and results on the coherence-based probabilistic treatment of uncertainty. Then, we deepen some probabilistic aspects in nonmonotonic reasoning, by generalizing OR, CM, and Cut rules. We also illustrate the degradation of these inference rules when the number of premises increases. Finally, we show that the lower bounds obtained when applying OR and Quasi-Conjunction inference rules coincide, respectively, with Hamacher and Lukasiewicz t-norms; the upper bounds in both rules coincide with Hamacher t-conorm. (C) 2011 Elsevier Inc. All rights reserved.
Keyword:
Coherence principle
Probabilistic default reasoning
Generalization of inference rules
Lower and upper bounds
t-Norms
t-Conorms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容