### Resumen

© 2015 Proceedings of the 9th International Symposium on Imprecise Probability. A credal network associates a directed acyclic graph with a collection of sets of probability measures. Usually these probability measures are specified through several tables containing probability values. Here we examine the complexity of inference in Boolean credal networks when probability measures are specified through formal languages, by extending a framework we have recently proposed for Bayesian networks. We show that sub-Boolean and relational logics lead to interesting complexity results. In short, we explore the relationship between language and complexity in credal networks.

Idioma original | Inglés estadounidense |
---|---|

Páginas | 97-105 |

Número de páginas | 9 |

Estado | Publicada - 1 ene 2015 |

Publicado de forma externa | Sí |

Evento | ISIPTA 2015 - Proceedings of the 9th International Symposium on Imprecise Probability: Theories and Applications - Duración: 1 ene 2015 → … |

### Conferencia

Conferencia | ISIPTA 2015 - Proceedings of the 9th International Symposium on Imprecise Probability: Theories and Applications |
---|---|

Período | 1/01/15 → … |

## Huella Profundice en los temas de investigación de 'On the complexity of propositional and relational credal networks'. En conjunto forman una huella única.

## Citar esto

Cozman, F. G., & Mauá, D. D. (2015).

*On the complexity of propositional and relational credal networks*. 97-105. Papel presentado en ISIPTA 2015 - Proceedings of the 9th International Symposium on Imprecise Probability: Theories and Applications, .