Source: International Journal of Approximate Reasoning. Unidades: EP, IME
Subjects: TEORIA DA COMPUTAÇÃO, TEORIA DOS MODELOS, AQUISIÇÃO DE CONHECIMENTO, LÓGICA MATEMÁTICA
ABNT
COZMAN, Fabio Gagliardi; MAUÁ, Denis Deratani. The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws. International Journal of Approximate Reasoning, New York, Elsevier, v. 110, p. 107-126, 2019. Disponível em: < http://dx.doi.org/10.1016/j.ijar.2019.04.003 > DOI: 10.1016/j.ijar.2019.04.003.APA
Cozman, F. G., & Mauá, D. D. (2019). The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws. International Journal of Approximate Reasoning, 110, 107-126. doi:10.1016/j.ijar.2019.04.003NLM
Cozman FG, Mauá DD. The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws [Internet]. International Journal of Approximate Reasoning. 2019 ; 110 107-126.Available from: http://dx.doi.org/10.1016/j.ijar.2019.04.003Vancouver
Cozman FG, Mauá DD. The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws [Internet]. International Journal of Approximate Reasoning. 2019 ; 110 107-126.Available from: http://dx.doi.org/10.1016/j.ijar.2019.04.003