The complexity of MAP inference in Bayesian networks specified through logical languages (2015)
- Authors:
- USP affiliated authors: MAUÁ, DENIS DERATANI - IME ; COZMAN, FABIO GAGLIARDI - EP
- Unidades: IME; EP
- Subjects: COMPUTABILIDADE E COMPLEXIDADE; INTELIGÊNCIA ARTIFICIAL
- Language: Inglês
- Imprenta:
- Publisher: AAAI Press / International Joint Conferences on Artificial Intelligence
- Publisher place: Palo Alto
- Date published: 2015
- Source:
- Título: Proceedings
- Conference titles: International Joint Conference on Artificial Intelligence - IJCAI
-
ABNT
MAUÁ, Denis Deratani e CAMPOS, Cassio Polpo de e COZMAN, Fabio Gagliardi. The complexity of MAP inference in Bayesian networks specified through logical languages. 2015, Anais.. Palo Alto: AAAI Press / International Joint Conferences on Artificial Intelligence, 2015. Disponível em: http://ijcai.org/papers15/Papers/IJCAI15-130.pdf. Acesso em: 09 abr. 2026. -
APA
Mauá, D. D., Campos, C. P. de, & Cozman, F. G. (2015). The complexity of MAP inference in Bayesian networks specified through logical languages. In Proceedings. Palo Alto: AAAI Press / International Joint Conferences on Artificial Intelligence. Recuperado de http://ijcai.org/papers15/Papers/IJCAI15-130.pdf -
NLM
Mauá DD, Campos CP de, Cozman FG. The complexity of MAP inference in Bayesian networks specified through logical languages [Internet]. Proceedings. 2015 ;[citado 2026 abr. 09 ] Available from: http://ijcai.org/papers15/Papers/IJCAI15-130.pdf -
Vancouver
Mauá DD, Campos CP de, Cozman FG. The complexity of MAP inference in Bayesian networks specified through logical languages [Internet]. Proceedings. 2015 ;[citado 2026 abr. 09 ] Available from: http://ijcai.org/papers15/Papers/IJCAI15-130.pdf - 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
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
