The logical view of conditioning and its application to possibility and evidence theories
International Journal of Approximate Reasoning
The uncertain reasoner's companion: a mathematical perspective
The uncertain reasoner's companion: a mathematical perspective
Modeling belief in dynamic systems, part I: foundations
Artificial Intelligence
A summary of a new normative theory of probabilistic logic
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Plausibility measures and default reasoning
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Plausibility measures: a user's guide
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
From Conditional Events to Conditional Measures: A New Axiomatic Approach
Annals of Mathematics and Artificial Intelligence
Possibility Theory, Probability Theory and Multiple-Valued Logics: A Clarification
Annals of Mathematics and Artificial Intelligence
Pseudo-additive measures and the independence of events
Technologies for constructing intelligent systems
Conditionals in nonmonotonic reasoning and belief revision: considering conditionals as agents
Conditionals in nonmonotonic reasoning and belief revision: considering conditionals as agents
Rainbow of computer science
Axioms for rational reinforcement learning
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
| Hi-index | 0.00 |
Cox's well-known theorem justifying the use of probability is shown not to hold in finite domains. The counterexample also suggests that Cox's assumptions are insufficient to prove the result even in infinite domains. The same counterexample is used to disprove a result of Fine on comparative conditional probability.