| Full text | |
| Author(s): |
Cozman, Fabio G.
;
Marinescu, Radu
;
Lee, Junkyu
;
Gray, Alexander
;
Riegel, Ryan
;
Bhattacharjya, Debarun
Total Authors: 6
|
| Document type: | Journal article |
| Source: | INTERNATIONAL JOURNAL OF APPROXIMATE REASONING; v. 172, p. 18-pg., 2024-06-28. |
| Abstract | |
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) | |
| FAPESP's process: | 19/07665-4 - Center for Artificial Intelligence |
| Grantee: | Fabio Gagliardi Cozman |
| Support Opportunities: | Research Grants - Research Program in eScience and Data Science - Research Centers in Engineering Program |