Resumen
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.
Idioma original | Inglés estadounidense |
---|---|
Páginas | 889-895 |
Número de páginas | 7 |
Estado | Publicada - 1 ene. 2015 |
Publicado de forma externa | Sí |
Evento | IJCAI International Joint Conference on Artificial Intelligence - Duración: 1 ene. 2015 → … |
Conferencia
Conferencia | IJCAI International Joint Conference on Artificial Intelligence |
---|---|
Período | 1/01/15 → … |