Sciweavers

75 search results - page 2 / 15
» Jeffrey's rule of conditioning generalized to belief functio...
Sort
View
ECSQARU
2009
Springer
13 years 9 months ago
Using Transfinite Ordinal Conditional Functions
Abstract. Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from t...
Sébastien Konieczny
ISIPTA
2005
IEEE
130views Mathematics» more  ISIPTA 2005»
13 years 10 months ago
No Double Counting Semantics for Conditional Independence
The main goal of this paper is to describe a new semantic for conditional independence in terms of no double counting of uncertain evidence. For ease of exposition, we use probabi...
Prakash P. Shenoy
ECSQARU
2009
Springer
13 years 2 months ago
Can the Minimum Rule of Possibility Theory Be Extended to Belief Functions?
Abstract. When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual ...
Sébastien Destercke, Didier Dubois
ISIPTA
2003
IEEE
13 years 10 months ago
Combining Belief Functions Issued from Dependent Sources
Dempsterā€™s rule for combining two belief functions assumes the independence of the sources of information. If this assumption is questionable, I suggest to use the least speciļ¬...
Marco E. G. V. Cattaneo
AI
2004
Springer
13 years 5 months ago
The limitation of Bayesianism
In the current discussion about the capacity of Bayesianism in reasoning under uncertainty, there is a conceptual and notational confusion between the explicit condition and the i...
Pei Wang