Probabilistic graphical models specified by probabilistic logic programs: semantics and complexit (2016)
- Authors:
- USP affiliated authors: COZMAN, FABIO GAGLIARDI - EP ; MAUÁ, DENIS DERATANI - IME
- Unidades: EP; IME
- Subjects: LÓGICA MATEMÁTICA; PROBABILIDADE
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Journal of Machine Learning Research
- ISSN: 1533-7928
- Volume/Número/Paginação/Ano: n. 52, p. 110-121, 2016
- Conference titles: International Conference on Probabilistic Graphical Models - PMLR
-
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. Probabilistic graphical models specified by probabilistic logic programs: semantics and complexit. Journal of Machine Learning Research. Brookline: Escola Politécnica, Universidade de São Paulo. Disponível em: http://proceedings.mlr.press/v52/cozman16.pdf. Acesso em: 19 abr. 2024. , 2016 -
APA
Cozman, F. G., & Mauá, D. D. (2016). Probabilistic graphical models specified by probabilistic logic programs: semantics and complexit. Journal of Machine Learning Research. Brookline: Escola Politécnica, Universidade de São Paulo. Recuperado de http://proceedings.mlr.press/v52/cozman16.pdf -
NLM
Cozman FG, Mauá DD. Probabilistic graphical models specified by probabilistic logic programs: semantics and complexit [Internet]. Journal of Machine Learning Research. 2016 ;( 52): 110-121.[citado 2024 abr. 19 ] Available from: http://proceedings.mlr.press/v52/cozman16.pdf -
Vancouver
Cozman FG, Mauá DD. Probabilistic graphical models specified by probabilistic logic programs: semantics and complexit [Internet]. Journal of Machine Learning Research. 2016 ;( 52): 110-121.[citado 2024 abr. 19 ] Available from: http://proceedings.mlr.press/v52/cozman16.pdf - 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-2016-Probabilistic... |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas