The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws (2019)
- Authors:
- USP affiliated authors: COZMAN, FABIO GAGLIARDI - EP ; MAUÁ, DENIS DERATANI - IME
- Unidades: EP; IME
- DOI: 10.1016/j.ijar.2019.04.003
- Subjects: TEORIA DA COMPUTAÇÃO; TEORIA DOS MODELOS; AQUISIÇÃO DE CONHECIMENTO; LÓGICA MATEMÁTICA
- Keywords: Bayesian networks; Finite model theory; Probabilistic relational models; Descriptive complexity; Zero/one laws; Probabilistic logic
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: International Journal of Approximate Reasoning
- ISSN: 0888-613X
- Volume/Número/Paginação/Ano: v. 110, p. 107-126, 2019
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws. International Journal of Approximate Reasoning, v. 110, p. 107-126, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2019.04.003. Acesso em: 11 fev. 2026. -
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.003 -
NLM
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.[citado 2026 fev. 11 ] Available from: https://doi.org/10.1016/j.ijar.2019.04.003 -
Vancouver
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.[citado 2026 fev. 11 ] Available from: https://doi.org/10.1016/j.ijar.2019.04.003 - Dealing with cycles in graph-based probabilistic models: the case of Logical Credal Networks
- Probabilistic logic programming under the L-Stable semantics
- Specifying credal sets with probabilistic answer set programming
- The complexity of inferences and explanations in probabilistic logic programming
- The descriptive complexity of bayesian network specifications
- Robustifying sum-product networks
- The complexity of Bayesian networks specified by propositional and relational languages
- The finite model theory of bayesian networks: descriptive complexity
- Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity
- Fast local search methods for solving limited memory influence diagrams
Informações sobre o DOI: 10.1016/j.ijar.2019.04.003 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2941511.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
