Abstract

We study the computational complexity of finding maximum a posteriori configurations in Bayesian networks whose probabilities are specified by logical formulas. This approach leads to a fine grained study in which local information such as context-sensitive independence and determinism can be considered. It also allows us to characterize more precisely the jump from tractability to NP-hardness and beyond, and to consider the complexity introduced by evidence alone.

Abstract

The Complexity of MAP Inference in Bayesian Networks Specified Through Logical Languages / 889 Denis Deratani Maua, Cassio Polpo de Campos, Fabio Gagliardi Cozman PDF