Abstract
The goal of this contribution is to discuss local computation in credal networks — graphical models that can represent imprecise and indeterminate probability values. We analyze the inference problem in credal networks, discuss how inference algorithms can benefit from local computation, and suggest that local computation can be particularly important in approximate inference algorithms.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Workshop on Local Computation for Logics and Uncertainty |
| Publisher | ECAI |
| Pages | 5-11 |
| Number of pages | 7 |
| Publication status | Published - 2004 |
| Externally published | Yes |