Belief structures, possibility theory and decomposable confidence measures on finite sets
Computers and Artificial Intelligence
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
What does a conditional knowledge base entail?
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Epistemic entrenchment and possibilistic logic
Artificial Intelligence
Nonmonotonic inference based on expectations
Artificial Intelligence
Interference Logic = Conditional Logic + Frame Axiom
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Formal Properties of Conditional Independence in Different Calculi of AI
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning
TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
| Hi-index | 0.00 |
An ordinal view of independence is studied in the framework of possibility theory. We investigate three possible definitions of dependence, of increasing strength. One of them is the counterpart to the multiplication law in probability theory, and the two others are based on the notion of conditional possibility. These two have enough expressive power to support the whole possibility theory, and a complete axiornatization is provided for the strongest one. Moreover we show that weak independence is well-suited to the problems of belief change and plausible reasoning, especially to address the problem of blocking of property inheritance in exception-tolerant taxonomic reasoning.