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: 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: 04 mar. 2026. , 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 2026 mar. 04 ] 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 2026 mar. 04 ] Available from: http://ceur-ws.org/Vol-1661/paper-01.pdf - Dealing with cycles in graph-based probabilistic models: the case of Logical Credal Networks
- Thirty years of credal networks: specification, algorithms and complexity
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- Probabilistic logic programming under the L-Stable semantics
- Specifying credal sets with probabilistic answer set programming
- Robustifying sum-product networks
- The complexity of Bayesian networks specified by propositional and relational languages
- The finite model theory of bayesian networks: descriptive complexity
- Complexity results for probabilistic answer set programming
- The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws
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
