The complexity of inferences and explanations in probabilistic logic programming (2017)
- Authors:
- USP affiliated authors: MAUÁ, DENIS DERATANI - IME ; COZMAN, FABIO GAGLIARDI - EP
- Unidades: IME; EP
- DOI: 10.1007/978-3-319-61581-3_40
- Subjects: ESTATÍSTICA E PROBABILIDADE; GEOMETRIA E MODELAGEM COMPUTACIONAL
- Language: Inglês
- Imprenta:
- Source:
- Conference titles: European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty - ECSQARU 2017
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. The complexity of inferences and explanations in probabilistic logic programming. 2017, Anais.. Cham: Springer, 2017. Disponível em: https://doi.org/10.1007/978-3-319-61581-3_40. Acesso em: 26 dez. 2025. -
APA
Cozman, F. G., & Mauá, D. D. (2017). The complexity of inferences and explanations in probabilistic logic programming. In Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. Cham: Springer. doi:10.1007/978-3-319-61581-3_40 -
NLM
Cozman FG, Mauá DD. The complexity of inferences and explanations in probabilistic logic programming [Internet]. Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. 2017 ;[citado 2025 dez. 26 ] Available from: https://doi.org/10.1007/978-3-319-61581-3_40 -
Vancouver
Cozman FG, Mauá DD. The complexity of inferences and explanations in probabilistic logic programming [Internet]. Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. 2017 ;[citado 2025 dez. 26 ] Available from: https://doi.org/10.1007/978-3-319-61581-3_40 - DL-Lite Bayesian networks: a tractable probabilistic graphical model
- On the complexity of propositional and relational credal networks
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- Specifying credal sets with probabilistic answer set programming
- On the semantics and complexity of probabilistic logic programs
- Credal sum-product networks
- Fast local search methods for solving limited memory influence diagrams
- A tractable class of model counting problems
- The finite model theory of bayesian networks: descriptive complexity
- The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws
Informações sobre o DOI: 10.1007/978-3-319-61581-3_40 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2858737.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
