On the complexity of propositional and relational credal networks

Fabio Gagliardi Cozman; Denis Deratani Mauá

On the complexity of propositional and relational credal networks

Fabio Gagliardi Cozman, Denis Deratani Mauá

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

1 Cita (Scopus)

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 → …

Acceder al documento

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, .

@conference{1db712c22c6f488285362623da0a0886,

title = "On the complexity of propositional and relational credal networks",

abstract = "{\textcopyright} 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.",

author = "Cozman, {Fabio Gagliardi} and Mau{\'a}, {Denis Deratani}",

year = "2015",

month = jan,

day = "1",

language = "American English",

pages = "97--105",

note = "ISIPTA 2015 - Proceedings of the 9th International Symposium on Imprecise Probability: Theories and Applications ; Conference date: 01-01-2015",

}

TY - CONF

T1 - On the complexity of propositional and relational credal networks

AU - Cozman, Fabio Gagliardi

AU - Mauá, Denis Deratani

PY - 2015/1/1

Y1 - 2015/1/1

N2 - © 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.

AB - © 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.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85013761430&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=85013761430&origin=inward

M3 - Conference Paper

SP - 97

EP - 105

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

Y2 - 1 January 2015

ER -