The complexity of Bayesian networks specified by propositional and relational languages (2018)
Cozman, Fabio Gagliardi 
; Mauá, Denis Deratani
Source: Artificial Intelligence. Unidades: EP, IME
Subjects: INFERÊNCIA BAYESIANA, COMPUTABILIDADE E COMPLEXIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. The complexity of Bayesian networks specified by propositional and relational languages. Artificial Intelligence, v. 262, p. 96-141, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.artint.2018.06.001. Acesso em: 25 abr. 2025.APA
Cozman, F. G., & Mauá, D. D. (2018). The complexity of Bayesian networks specified by propositional and relational languages. Artificial Intelligence, 262, 96-141. doi:10.1016/j.artint.2018.06.001NLM
Cozman FG, Mauá DD. The complexity of Bayesian networks specified by propositional and relational languages [Internet]. Artificial Intelligence. 2018 ; 262 96-141.[citado 2025 abr. 25 ] Available from: https://doi.org/10.1016/j.artint.2018.06.001Vancouver
Cozman FG, Mauá DD. The complexity of Bayesian networks specified by propositional and relational languages [Internet]. Artificial Intelligence. 2018 ; 262 96-141.[citado 2025 abr. 25 ] Available from: https://doi.org/10.1016/j.artint.2018.06.001
