Markov Conditions and Factorization in Logical Credal Networks
Abstract
We examine the recently proposed language of Logical Credal Networks, in particular investigating the consequences of various Markov conditions. We introduce the notion of structure for a Logical Credal Network and show that a structure without directed cycles leads to a well-known factorization result. For networks with directed cycles, we analyze the differences between Markov conditions, factorization results, and specification requirements.
Cite
Text
Cozman. "Markov Conditions and Factorization in Logical Credal Networks." Proceedings of the Thirteenth International Symposium on Imprecise Probability: Theories and Applications, 2023.Markdown
[Cozman. "Markov Conditions and Factorization in Logical Credal Networks." Proceedings of the Thirteenth International Symposium on Imprecise Probability: Theories and Applications, 2023.](https://mlanthology.org/isipta/2023/cozman2023isipta-markov/)BibTeX
@inproceedings{cozman2023isipta-markov,
title = {{Markov Conditions and Factorization in Logical Credal Networks}},
author = {Cozman, Fabio Gagliardi},
booktitle = {Proceedings of the Thirteenth International Symposium on Imprecise Probability: Theories and Applications},
year = {2023},
pages = {130-140},
volume = {215},
url = {https://mlanthology.org/isipta/2023/cozman2023isipta-markov/}
}