arrow
Return

Generalizing inference rules in a coherence-based probabilistic default reasoning

delete2012-04-01
delete27
delete
OA
AI
A
Angelo Gilio *
DOI:10.1016/j.ijar.2011.08.004delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

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.
Keywords:
Coherence principle
Probabilistic default reasoning
Generalization of inference rules
Lower and upper bounds
t-Norms
t-Conorms
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

International Journal of Approximate Reasoning cover
International Journal of Approximate Reasoning
IF:
3
Papers:
2.9K
Citations:
5.1K

Organization

No organization information available