On the complexity of propositional and relational credal networks (2015)
Fonte: Proceedings. Nome do evento: International Symposium on Imprecise Probability: Theories and Applications - ISIPTA. Unidades: EP, IME
Assuntos: PROBABILIDADE, COMPUTABILIDADE E COMPLEXIDADE, INTELIGÊNCIA ARTIFICIAL
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. On the complexity of propositional and relational credal networks. 2015, Anais.. Ariccia: Aracne, 2015. Disponível em: http://sipta.org/isipta15/data/paper/1.pdf. Acesso em: 17 nov. 2024.APA
Cozman, F. G., & Mauá, D. D. (2015). On the complexity of propositional and relational credal networks. In Proceedings. Ariccia: Aracne. Recuperado de http://sipta.org/isipta15/data/paper/1.pdfNLM
Cozman FG, Mauá DD. On the complexity of propositional and relational credal networks [Internet]. Proceedings. 2015 ;[citado 2024 nov. 17 ] Available from: http://sipta.org/isipta15/data/paper/1.pdfVancouver
Cozman FG, Mauá DD. On the complexity of propositional and relational credal networks [Internet]. Proceedings. 2015 ;[citado 2024 nov. 17 ] Available from: http://sipta.org/isipta15/data/paper/1.pdf