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 contextsensitive 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.
|Original language||American English|
|Number of pages||7|
|State||Published - 1 Jan 2015|
|Event||IJCAI International Joint Conference on Artificial Intelligence - |
Duration: 1 Jan 2015 → …
|Conference||IJCAI International Joint Conference on Artificial Intelligence|
|Period||1/01/15 → …|