Markov decision processes specified by probabilistic logic programming: representation and solution (2017)
- Authors:
- USP affiliated authors: MAUÁ, DENIS DERATANI - IME ; BARROS, LELIANE NUNES DE - IME ; COZMAN, FABIO GAGLIARDI - EP
- Unidades: IME; EP
- DOI: 10.1109/BRACIS.2016.068
- Subjects: PROCESSOS DE MARKOV; PROGRAMAÇÃO LÓGICA; TOMADA DE DECISÃO
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: IEEE
- Publisher place: Piscataway
- Date published: 2017
- Source:
- Título: Proceedings
- Conference titles: Brazilian Conference on Intelligent Systems - BRACIS
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
BUENO, Thiago Pereira et al. Markov decision processes specified by probabilistic logic programming: representation and solution. 2017, Anais.. Piscataway: IEEE, 2017. Disponível em: https://doi.org/10.1109/BRACIS.2016.068. Acesso em: 02 jan. 2026. -
APA
Bueno, T. P., Mauá, D. D., Barros, L. N. de, & Cozman, F. G. (2017). Markov decision processes specified by probabilistic logic programming: representation and solution. In Proceedings. Piscataway: IEEE. doi:10.1109/BRACIS.2016.068 -
NLM
Bueno TP, Mauá DD, Barros LN de, Cozman FG. Markov decision processes specified by probabilistic logic programming: representation and solution [Internet]. Proceedings. 2017 ;[citado 2026 jan. 02 ] Available from: https://doi.org/10.1109/BRACIS.2016.068 -
Vancouver
Bueno TP, Mauá DD, Barros LN de, Cozman FG. Markov decision processes specified by probabilistic logic programming: representation and solution [Internet]. Proceedings. 2017 ;[citado 2026 jan. 02 ] Available from: https://doi.org/10.1109/BRACIS.2016.068 - Modeling Markov decision processes with imprecise probabilities using probabilistic logic programming
- Fast local search methods for solving limited memory influence diagrams
- The complexity of inferences and explanations in probabilistic logic programming
- The finite model theory of bayesian networks: descriptive complexity
- A tractable class of model counting problems
- When a robot reaches out for human help
- 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
Informações sobre o DOI: 10.1109/BRACIS.2016.068 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2849998.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
