Graphoid Properties of Variants of Epistemic Independence Based on Regular Conditioning
Abstract
Graphoid properties attempt to capture the most important features of abstract “independence”. We examine which semi-graphoid properties are satisfied by various concepts of independence for credal sets; we focus on variants of epistemic, confirmational, and type-5 independence that are based on regular conditioning.
Cite
Text
Cozman. "Graphoid Properties of Variants of Epistemic Independence Based on Regular Conditioning." Proceedings of the Eleventh International Symposium on Imprecise Probabilities: Theories and Applications, 2019.Markdown
[Cozman. "Graphoid Properties of Variants of Epistemic Independence Based on Regular Conditioning." Proceedings of the Eleventh International Symposium on Imprecise Probabilities: Theories and Applications, 2019.](https://mlanthology.org/isipta/2019/cozman2019isipta-graphoid/)BibTeX
@inproceedings{cozman2019isipta-graphoid,
title = {{Graphoid Properties of Variants of Epistemic Independence Based on Regular Conditioning}},
author = {Cozman, Fabio},
booktitle = {Proceedings of the Eleventh International Symposium on Imprecise Probabilities: Theories and Applications},
year = {2019},
pages = {102-110},
volume = {103},
url = {https://mlanthology.org/isipta/2019/cozman2019isipta-graphoid/}
}