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: 26 jan. 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 jan. 26 ] 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 jan. 26 ] Available from: https://openreview.net/pdf?id=aUPT1kEiwP - The structure and complexity of credal semantics
- Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity
- Fast local search methods for solving limited memory influence diagrams
- The complexity of MAP inference in Bayesian networks specified through logical languages
- On the complexity of propositional and relational credal networks
- DL-Lite Bayesian networks: a tractable probabilistic graphical model
- The complexity of plate probabilistic models
- On the complexity of propositional and relational credal networks
- The effect of combination functions on the complexity of relational Bayesian networks
- Specifying probabilistic relational models with description logics
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
