Multilinear and linear programs for partially identifiable queries in quasi-markovian structural causal models (2025)
- Authors:
- USP affiliated authors: MAUÁ, DENIS DERATANI - IME ; COZMAN, FABIO GAGLIARDI - EP ; ARROYO, JOAO PEDRO - EP ; RODRIGUES, JOAO GABRIEL BARRETO - EP ; LAWAND, DANIEL ANGELO ESTEVES - IME
- Unidades: IME; EP
- Subjects: ÁLGEBRA MULTILINEAR; ANÁLISE CAUSAL; INTELIGÊNCIA ARTIFICIAL
- Keywords: Efeito causal
- Language: Inglês
- Imprenta:
- Publisher: AUAI Press
- Publisher place: Corvallis
- Date published: 2025
- Source:
- Título: Proceedings
- Volume/Número/Paginação/Ano: p. 1-14, 2025
- Conference titles: Conference on Uncertainty in Artificial Intelligence - UAI
-
ABNT
ARROYO, João Pedro et al. Multilinear and linear programs for partially identifiable queries in quasi-markovian structural causal models. 2025, Anais.. Corvallis: AUAI Press, 2025. p. 1-14. Disponível em: https://openreview.net/pdf?id=aUPT1kEiwP. Acesso em: 09 maio 2026. -
APA
Arroyo, J. P., Mauá, D. D., Rodrigues, J. G. B., Lawand, D. A. E., Lee, J., Marinescu, R., et al. (2025). Multilinear and linear programs for partially identifiable queries in quasi-markovian structural causal models. In Proceedings (p. 1-14). Corvallis: AUAI Press. Recuperado de https://openreview.net/pdf?id=aUPT1kEiwP -
NLM
Arroyo JP, Mauá DD, Rodrigues JGB, Lawand DAE, Lee J, Marinescu R, Gray A, Laurentino ER, Cozman FG. Multilinear and linear programs for partially identifiable queries in quasi-markovian structural causal models [Internet]. Proceedings. 2025 ; 1-14.[citado 2026 maio 09 ] Available from: https://openreview.net/pdf?id=aUPT1kEiwP -
Vancouver
Arroyo JP, Mauá DD, Rodrigues JGB, Lawand DAE, Lee J, Marinescu R, Gray A, Laurentino ER, Cozman FG. Multilinear and linear programs for partially identifiable queries in quasi-markovian structural causal models [Internet]. Proceedings. 2025 ; 1-14.[citado 2026 maio 09 ] Available from: https://openreview.net/pdf?id=aUPT1kEiwP - Probabilities of causation and root cause analysis with quasi-Markovian models
- Dealing with cycles in graph-based probabilistic models: the case of Logical Credal Networks
- Robustifying sum-product networks
- The complexity of Bayesian networks specified by propositional and relational languages
- The finite model theory of bayesian networks: descriptive complexity
- The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws
- Complexity results for probabilistic answer set programming
- On the complexity of propositional and relational credal networks
- The effect of combination functions on the complexity of relational Bayesian networks
- Specifying credal sets with probabilistic answer set programming
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3262622.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
