Conditional Independence for Iterated Belief Revision
Abstract
Conditional independence is a crucial concept for efficient probabilistic reasoning. For symbolic and qualitative reasoning, however, it has played only a minor role. Recently, Lynn, Delgrande, and Peppas have considered conditional independence in terms of syntactic multivalued dependencies. In this paper, we define conditional independence as a semantic property of epistemic states and present axioms for iterated belief revision operators to obey conditional independence in general. We show that c-revisions for ranking functions satisfy these axioms, and exploit the relevance of these results for iterated belief revision in general.
Cite
Text
Kern-Isberner et al. "Conditional Independence for Iterated Belief Revision." International Joint Conference on Artificial Intelligence, 2022. doi:10.24963/IJCAI.2022/373Markdown
[Kern-Isberner et al. "Conditional Independence for Iterated Belief Revision." International Joint Conference on Artificial Intelligence, 2022.](https://mlanthology.org/ijcai/2022/kernisberner2022ijcai-conditional/) doi:10.24963/IJCAI.2022/373BibTeX
@inproceedings{kernisberner2022ijcai-conditional,
title = {{Conditional Independence for Iterated Belief Revision}},
author = {Kern-Isberner, Gabriele and Heyninck, Jesse and Beierle, Christoph},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2022},
pages = {2690-2696},
doi = {10.24963/IJCAI.2022/373},
url = {https://mlanthology.org/ijcai/2022/kernisberner2022ijcai-conditional/}
}