###
ISIPTA'07 -
FIFTH INTERNATIONAL SYMPOSIUM ON

IMPRECISE PROBABILITY: THEORIES AND APPLICATIONS

###
Charles University, Faculty of Mathematicsand Physics

Prague, Czech Republic

16-19 July 2007

## ELECTRONIC PROCEEDINGS

## Rolf Haenni

# Climbing the Hills of Compiled Credal Networks

### 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 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.

** Keywords. ** Credal Networks, Bayesian Networks, Credal Sets, Approximate Inference, Logical Compilation, Hill-Climbing, Local Search

** Paper Download **

The paper is availabe in the following formats:

** Authors addresses: **

Institute of Computer Science and Applied Mathematics

University of Berne

Neubrueckstrasse 10

CH-3012 Berne

** E-mail addresses: **

[ back
to the Proceedings of ISIPTA'07 home page ]

Send any remarks to the following address:
smc@decsai.ugr.es