On the semantics and complexity of probabilistic logic programs (2017)
- Authors:
- USP affiliated authors: COZMAN, FABIO GAGLIARDI - EP ; MAUÁ, DENIS DERATANI - IME
- Unidades: EP; IME
- DOI: 10.1613/jair.5482
- Subjects: PROGRAMAÇÃO LÓGICA; PROBABILIDADE
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Journal of Artificial Intelligence Research
- ISSN: 1076-9757
- Volume/Número/Paginação/Ano: v. 60, p. 221-262, 2017
- Este periódico é de acesso aberto
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: gold
- Licença: cc-by
-
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. On the semantics and complexity of probabilistic logic programs. Journal of Artificial Intelligence Research, v. 60, p. 221-262, 2017Tradução . . Disponível em: https://doi.org/10.1613/jair.5482. Acesso em: 18 set. 2024. -
APA
Cozman, F. G., & Mauá, D. D. (2017). On the semantics and complexity of probabilistic logic programs. Journal of Artificial Intelligence Research, 60, 221-262. doi:10.1613/jair.5482 -
NLM
Cozman FG, Mauá DD. On the semantics and complexity of probabilistic logic programs [Internet]. Journal of Artificial Intelligence Research. 2017 ; 60 221-262.[citado 2024 set. 18 ] Available from: https://doi.org/10.1613/jair.5482 -
Vancouver
Cozman FG, Mauá DD. On the semantics and complexity of probabilistic logic programs [Internet]. Journal of Artificial Intelligence Research. 2017 ; 60 221-262.[citado 2024 set. 18 ] Available from: https://doi.org/10.1613/jair.5482 - 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
- 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
- The finite model theory of bayesian networks: descriptive complexity
- 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.1613/jair.5482 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 2854772.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
