The complexity of Boolean functions
The complexity of Boolean functions
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Fundamental concepts of qualitative probabilistic networks
Artificial Intelligence
Qualtitative propagation and scenario-based scheme for exploiting probabilistic reasoning
UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
Bayesian network modelling through qualitative patterns
Artificial Intelligence
Parameter adjustment in Bayes networks. the generalized noisy OR-gate
UAI'93 Proceedings of the Ninth international conference on Uncertainty in artificial intelligence
Intercausal reasoning with uninstantiated ancestor nodes
UAI'93 Proceedings of the Ninth international conference on Uncertainty in artificial intelligence
Causal independence for probability assessment and inference using Bayesian networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
Causal independence models offer a high level starting point for the design of Bayesian networks but are not maximally exploited as their behaviour is often unclear. One approach is to employ qualitative probabilistic network theory in order to derive a qualitative characterisation of causal independence models. In this paper we exploit polynomial forms of Boolean functions to systematically analyse causal independence models, giving rise to the notion of a polynomial causal independence model. The advantage of the approach is that it allows understanding qualitative probabilistic behaviour in terms of algebraic structure.