Belief Base Rationalization for Propositional Merging
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 951-955.
Abstract
Existing belief merging operators take advantage of all the models from the bases, including those contradicting the integrity constraints. In this paper, we show that this is not suited to every merging scenario. We study the case when the bases are rationalized with respect to the integrity constraints during the merging process. We define in formal terms several independence conditions for merging operators and show how they interact with the standard IC postulates for belief merging. Especially, we give an independence-based axiomatic characterization of a distance-based operator.
@inproceedings{ijcai2011p164,
title = {Belief Base Rationalization for Propositional Merging},
author = {Konieczny, Sébastien and Marquis, Pierre and Schwind, Nicolas},
booktitle = {Proceedings of the Twenty-Second International Joint Conference on
Artificial Intelligence, {IJCAI-11}},
publisher = {AAAI Press/International Joint Conferences on Artificial Intelligence},
editor = {Toby Walsh},
pages = {951--955},
year = {2011},
month = {7},
doi = {10.5591/978-1-57735-516-8/IJCAI11-164},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-164},
}
TY - CPAPER TI - Belief Base Rationalization for Propositional Merging AU - Konieczny, Sébastien AU - Marquis, Pierre AU - Schwind, Nicolas T2 - Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11 PB - AAAI Press/International Joint Conferences on Artificial Intelligence PY - 2011 SP - 951 EP - 955 DO - 10.5591/978-1-57735-516-8/IJCAI11-164 UR - https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-164 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: