The complexity of plate probabilistic models (2015)
- Authors:
- USP affiliated authors: MAUÁ, DENIS DERATANI - IME ; COZMAN, FABIO GAGLIARDI - EP
- Unidades: IME; EP
- DOI: 10.1007/978-3-319-23540-0_3
- Subjects: COMPUTABILIDADE E COMPLEXIDADE; INTELIGÊNCIA ARTIFICIAL; PROBABILIDADE APLICADA
- Language: Inglês
- Imprenta:
- Source:
- Título: Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings
- Volume/Número/Paginação/Ano: Cham: Springer, 2015
- Conference titles: International Conference on Scalable Uncertainty Management - SUM
- Status:
- Nenhuma versão em acesso aberto identificada
-
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. The complexity of plate probabilistic models. 2015, Anais.. Cham: Springer, 2015. Disponível em: https://doi.org/10.1007/978-3-319-23540-0_3. Acesso em: 16 abr. 2026. -
APA
Mauá, D. D., & Cozman, F. G. (2015). The complexity of plate probabilistic models. In Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. Cham: Springer. doi:10.1007/978-3-319-23540-0_3 -
NLM
Mauá DD, Cozman FG. The complexity of plate probabilistic models [Internet]. Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. 2015 ;[citado 2026 abr. 16 ] Available from: https://doi.org/10.1007/978-3-319-23540-0_3 -
Vancouver
Mauá DD, Cozman FG. The complexity of plate probabilistic models [Internet]. Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. 2015 ;[citado 2026 abr. 16 ] Available from: https://doi.org/10.1007/978-3-319-23540-0_3 - Probabilistic logic programming under the L-Stable semantics
- Specifying credal sets with probabilistic answer set programming
- Dealing with cycles in graph-based probabilistic models: the case of Logical Credal Networks
- The complexity of Bayesian networks specified by propositional and relational languages
- The finite model theory of bayesian networks: descriptive complexity
- Robustifying sum-product networks
- 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
- DL-Lite Bayesian networks: a tractable probabilistic graphical model
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 | |
|---|---|---|---|
 |
Cozman-2015-The complexit... |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
