## Climbing the Hills of Compiled Credal Networks (2007)

by
Rolf Haenni

Venue: | 5TH INTERNATIONAL SYMPOSIUM ON IMPRECISE PROBABILITY: THEORIES AND APPLICATIONS, PRAGUE, CZECH REPUBLIC |

Citations: | 2 - 1 self |

### BibTeX

@MISC{Haenni07climbingthe,

author = {Rolf Haenni},

title = {Climbing the Hills of Compiled Credal Networks},

year = {2007}

}

### OpenURL

### Abstract

This paper introduces a new approximate inference algorithm for credal networks. The algorithm consists of two major steps. It starts by representing the credal network as a compiled logical theory. The resulting graphical structure is the basis on which the subsequent steepest-ascent hill-climbing algorithm operates. The output of the algorithm is an inner approximation of the exact lower and upper posterior probabilities.