| Texto completo | |
| Autor(es): |
Cozman, Fabio G.
;
Marinescu, Radu
;
Lee, Junkyu
;
Gray, Alexander
;
Riegel, Ryan
;
Bhattacharjya, Debarun
Número total de Autores: 6
|
| Tipo de documento: | Artigo Científico |
| Fonte: | INTERNATIONAL JOURNAL OF APPROXIMATE REASONING; v. 172, p. 18-pg., 2024-06-28. |
| Resumo | |
We examine the recently proposed language of Logical Credal Networks , a powerful representation formalism that combines probabilities and logic. In particular we investigate the consequences of distinct Markov conditions upon their underlying semantics. We introduce the notion of structure for a Logical Credal Network and show that a structure without directed cycles leads to a wellknown factorization result. For networks with directed cycles, we discuss the differences between Markov conditions, factorization results, and specification requirements. We consider several scenarios in causal reasoning that can be tackled by the formalism, in particular looking at partial identifiability and cycles. (AU) | |
| Processo FAPESP: | 19/07665-4 - Centro de Inteligência Artificial |
| Beneficiário: | Fabio Gagliardi Cozman |
| Modalidade de apoio: | Auxílio à Pesquisa - Programa eScience e Data Science - Centros de Pesquisa em Engenharia |