Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity (2015)
- Authors:
- USP affiliated authors: COZMAN, FABIO GAGLIARDI - EP ; MAUÁ, DENIS DERATANI - IME
- Unidades: EP; IME
- Subjects: COMPUTABILIDADE E COMPLEXIDADE; INTELIGÊNCIA ARTIFICIAL; PROBABILIDADE APLICADA
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: AAAI Press
- Publisher place: Palo Alto
- Date published: 2015
- Source:
- Título do periódico: Proceedings
- ISSN: 2374-3468
- Conference titles: AAAI Conference on Artificial Intelligence
-
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity. 2015, Anais.. Palo Alto: AAAI Press, 2015. Disponível em: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312. Acesso em: 19 abr. 2024. -
APA
Cozman, F. G., & Mauá, D. D. (2015). Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity. In Proceedings. Palo Alto: AAAI Press. Recuperado de http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312 -
NLM
Cozman FG, Mauá DD. Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity [Internet]. Proceedings. 2015 ;[citado 2024 abr. 19 ] Available from: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312 -
Vancouver
Cozman FG, Mauá DD. Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity [Internet]. Proceedings. 2015 ;[citado 2024 abr. 19 ] Available from: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312 - A tractable class of model counting problems
- The complexity of inferences and explanations in probabilistic logic programming
- The finite model theory of bayesian networks: descriptive complexity
- Fast local search methods for solving limited memory influence diagrams
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- Specifying credal sets with probabilistic answer set programming
- Credal sum-product networks
- On the semantics and complexity of probabilistic logic programs
- On the complexity of propositional and relational credal networks
- DL-Lite Bayesian networks: a tractable probabilistic graphical model
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | Cozman-2015-Bayesian netw... |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
