The descriptive complexity of bayesian network specifications (2017)
- Authors:
- USP affiliated authors: MAUÁ, DENIS DERATANI - IME ; COZMAN, FABIO GAGLIARDI - EP
- Unidades: IME; EP
- DOI: 10.1007/978-3-319-61581-3_9
- Subjects: ESTATÍSTICA E PROBABILIDADE; GEOMETRIA E MODELAGEM COMPUTACIONAL
- Language: Inglês
- Imprenta:
- Source:
- Conference titles: European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty - ECSQARU 2017
- Status:
- Nenhuma versão em acesso aberto identificada
-
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. The descriptive complexity of bayesian network specifications. 2017, Anais.. Cham: Springer, 2017. Disponível em: https://doi.org/10.1007/978-3-319-61581-3_9. Acesso em: 21 mar. 2026. -
APA
Cozman, F. G., & Mauá, D. D. (2017). The descriptive complexity of bayesian network specifications. In Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. Cham: Springer. doi:10.1007/978-3-319-61581-3_9 -
NLM
Cozman FG, Mauá DD. The descriptive complexity of bayesian network specifications [Internet]. Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. 2017 ;[citado 2026 mar. 21 ] Available from: https://doi.org/10.1007/978-3-319-61581-3_9 -
Vancouver
Cozman FG, Mauá DD. The descriptive complexity of bayesian network specifications [Internet]. Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. 2017 ;[citado 2026 mar. 21 ] Available from: https://doi.org/10.1007/978-3-319-61581-3_9 - 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
- On the semantics and complexity of probabilistic logic programs
- Credal sum-product networks
- Bayesian networks of bounded treewidth: a performance analysis
- The effect of combination functions on the complexity of relational Bayesian networks
- Probabilistic graphical models specified by probabilistic logic programs: semantics and complexit
- The complexity of inferences and explanations in probabilistic logic programming
- On the complexity of propositional and relational credal networks
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 | |
|---|---|---|---|
 |
2858744.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
