The finite model theory of bayesian networks: descriptive complexity (2018)
- Authors:
- USP affiliated authors: MAUÁ, DENIS DERATANI - IME ; COZMAN, FABIO GAGLIARDI - EP
- Unidades: IME; EP
- DOI: 10.24963/ijcai.2018/727
- Subjects: COMPUTABILIDADE E COMPLEXIDADE; INTELIGÊNCIA ARTIFICIAL; INFERÊNCIA BAYESIANA
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: International Joint Conference on Artificial Intelligence - IJCAI
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: bronze
-
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. The finite model theory of bayesian networks: descriptive complexity. 2018, Anais.. Vienna: IJCAI, 2018. Disponível em: https://doi.org/10.24963/ijcai.2018/727. Acesso em: 02 out. 2024. -
APA
Cozman, F. G., & Mauá, D. D. (2018). The finite model theory of bayesian networks: descriptive complexity. In Proceedings. Vienna: IJCAI. doi:10.24963/ijcai.2018/727 -
NLM
Cozman FG, Mauá DD. The finite model theory of bayesian networks: descriptive complexity [Internet]. Proceedings. 2018 ;[citado 2024 out. 02 ] Available from: https://doi.org/10.24963/ijcai.2018/727 -
Vancouver
Cozman FG, Mauá DD. The finite model theory of bayesian networks: descriptive complexity [Internet]. Proceedings. 2018 ;[citado 2024 out. 02 ] Available from: https://doi.org/10.24963/ijcai.2018/727 - Specifying credal sets with probabilistic answer set programming
- On the complexity of propositional and relational credal networks
- DL-Lite Bayesian networks: a tractable probabilistic graphical model
- On the semantics and complexity of probabilistic logic programs
- Credal sum-product networks
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- Fast local search methods for solving limited memory influence diagrams
- The complexity of inferences and explanations in probabilistic logic programming
- A tractable class of model counting problems
- The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws
Informações sobre o DOI: 10.24963/ijcai.2018/727 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 2894585.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
