Thirty years of credal networks: specification, algorithms and complexity (2020)
- Authors:
- USP affiliated authors: MAUÁ, DENIS DERATANI - IME ; COZMAN, FABIO GAGLIARDI - EP
- Unidades: IME; EP
- DOI: 10.1016/j.ijar.2020.08.009
- Subjects: MODELOS PARA PROCESSOS ESTOCÁSTICOS; PROBABILIDADE
- Keywords: Imprecise probabilities; Probabilistic graphical models
- 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. 126, p. 133-157, 2020
- Status:
- Nenhuma versão em acesso aberto identificada
-
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. Thirty years of credal networks: specification, algorithms and complexity. International Journal of Approximate Reasoning, v. 126, p. 133-157, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2020.08.009. Acesso em: 09 abr. 2026. -
APA
Mauá, D. D., & Cozman, F. G. (2020). Thirty years of credal networks: specification, algorithms and complexity. International Journal of Approximate Reasoning, 126, 133-157. doi:10.1016/j.ijar.2020.08.009 -
NLM
Mauá DD, Cozman FG. Thirty years of credal networks: specification, algorithms and complexity [Internet]. International Journal of Approximate Reasoning. 2020 ; 126 133-157.[citado 2026 abr. 09 ] Available from: https://doi.org/10.1016/j.ijar.2020.08.009 -
Vancouver
Mauá DD, Cozman FG. Thirty years of credal networks: specification, algorithms and complexity [Internet]. International Journal of Approximate Reasoning. 2020 ; 126 133-157.[citado 2026 abr. 09 ] Available from: https://doi.org/10.1016/j.ijar.2020.08.009 - Probabilistic logic programming under the L-Stable semantics
- Specifying credal sets with probabilistic answer set programming
- Robustifying sum-product networks
- The complexity of Bayesian networks specified by propositional and relational languages
- The finite model theory of bayesian networks: descriptive complexity
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- Complexity results for probabilistic answer set programming
- The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws
- 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 a disponibilidade de versões do artigo em acesso aberto coletadas automaticamente via oaDOI API (Unpaywall).
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3005723.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
