The structure and complexity of credal semantics (2016)
- Authors:
- USP affiliated authors: COZMAN, FABIO GAGLIARDI - EP ; MAUÁ, DENIS DERATANI - IME
- Unidades: EP; IME
- Subjects: INTELIGÊNCIA ARTIFICIAL; ANÁLISE MULTIVARIADA; PROGRAMAÇÃO LÓGICA; COMPUTABILIDADE E COMPLEXIDADE
- Language: Inglês
- Imprenta:
- Publisher: CEUR Workshop Proceedings
- Publisher place: Aachen
- Date published: 2016
- Source:
- Título do periódico: CEUR Workshop Proceedings
- ISSN: 1613-0073
- Volume/Número/Paginação/Ano: v. 1661, p. 3-14, 2016
- Conference titles: International Workshop on Probabilistic Logic Programming- PLP
-
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. The structure and complexity of credal semantics. CEUR Workshop Proceedings. Aachen: CEUR Workshop Proceedings. Disponível em: http://ceur-ws.org/Vol-1661/paper-01.pdf. Acesso em: 23 abr. 2024. , 2016 -
APA
Cozman, F. G., & Mauá, D. D. (2016). The structure and complexity of credal semantics. CEUR Workshop Proceedings. Aachen: CEUR Workshop Proceedings. Recuperado de http://ceur-ws.org/Vol-1661/paper-01.pdf -
NLM
Cozman FG, Mauá DD. The structure and complexity of credal semantics [Internet]. CEUR Workshop Proceedings. 2016 ; 1661 3-14.[citado 2024 abr. 23 ] Available from: http://ceur-ws.org/Vol-1661/paper-01.pdf -
Vancouver
Cozman FG, Mauá DD. The structure and complexity of credal semantics [Internet]. CEUR Workshop Proceedings. 2016 ; 1661 3-14.[citado 2024 abr. 23 ] Available from: http://ceur-ws.org/Vol-1661/paper-01.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-The Structure... |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas