26 citations · 44 across the 6 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2013
State-space Abstraction for Anytime Evaluation of Probabilistic Networks
Michael P. Wellman, Chao-Lin Liu
One important factor determining the computational complexity of evaluating a probabilistic network is the cardinality of the state spaces of the nodes. By varying the granularity…
cs.AI2013★ 12 cited
Using Qualitative Relationships for Bounding Probability Distributions
Chao-Lin Liu, Michael P. Wellman
We exploit qualitative probabilistic relationships among variables for computing bounds of conditional probability distributions of interest in Bayesian networks. Using the signs o…
cs.AI2013★ 26 cited
Incremental Tradeoff Resolution in Qualitative Probabilistic Networks
Chao-Lin Liu, Michael P. Wellman
Qualitative probabilistic reasoning in a Bayesian network often reveals tradeoffs: relationships that are ambiguous due to competing qualitative influences. We present two techniqu…