The complexity of MAP inference in Bayesian networks specified through logical languages

Denis D. Mauá, Cassio P. De Campos, Fabio G. Cozman

Resultado de la investigación: Contribución a una conferenciaArtículo de conferencia

6 Citas (Scopus)

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 originalInglés estadounidense
Páginas889-895
Número de páginas7
EstadoPublicada - 1 ene 2015
Publicado de forma externa
EventoIJCAI International Joint Conference on Artificial Intelligence -
Duración: 1 ene 2015 → …

Conferencia

ConferenciaIJCAI International Joint Conference on Artificial Intelligence
Período1/01/15 → …

Huella Profundice en los temas de investigación de 'The complexity of MAP inference in Bayesian networks specified through logical languages'. En conjunto forman una huella única.

  • Citar esto

    Mauá, D. D., De Campos, C. P., & Cozman, F. G. (2015). The complexity of MAP inference in Bayesian networks specified through logical languages. 889-895. Papel presentado en IJCAI International Joint Conference on Artificial Intelligence, .