Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probability, frequency and reasonable expectation
Readings in uncertain reasoning
Reasoning with belief functions: an analysis of compatibility
International Journal of Approximate Reasoning
Conditional independence in uncertainty theories
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
International Journal of Approximate Reasoning - Special issue: The belief functions revisited: questions and answers
Markov Chain Monte-Carlo algorithms for the calculation of Dempster-Shafer belief
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
Conditional Inference and Logic for Intelligent Systems: A Theory of Measure-Free Conditioning
Conditional Inference and Logic for Intelligent Systems: A Theory of Measure-Free Conditioning
The assumptions behind Dempster's rule
UAI'93 Proceedings of the Ninth international conference on Uncertainty in artificial intelligence
| Hi-index | 0.00 |
We take a general approach to uncertainty on product spaces, and give sufficient conditions for the independence structures of uncertainty measures to satisfy graphoid properties. Since these conditions are arguably more intuitive than some of the graphoid properties, they can be viewed as explanations why probability and certain other formalisms generate graphoids. The conditions include a sufficient condition for the Intersection property which can still apply even if there is a strong logical relationship between the variables. We indicate how these results can be used to produce theories of qualitative conditional probability which are semi-graphoids and graphoids.