Belief Base Rationalization for Propositional Merging

Sébastien Konieczny, Pierre Marquis, Nicolas Schwind

IJCAI 2011 pp. 951-956

doi:10.5591/978-1-57735-516-8/IJCAI11-164 /ijcai/2011/konieczny2011ijcai-belief/

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.

PDF IJCAI Semantic Scholar

Cite

Text

Konieczny et al. "Belief Base Rationalization for Propositional Merging." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-164

Markdown

[Konieczny et al. "Belief Base Rationalization for Propositional Merging." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/konieczny2011ijcai-belief/) doi:10.5591/978-1-57735-516-8/IJCAI11-164

BibTeX

@inproceedings{konieczny2011ijcai-belief,
  title     = {{Belief Base Rationalization for Propositional Merging}},
  author    = {Konieczny, Sébastien and Marquis, Pierre and Schwind, Nicolas},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {951-956},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-164},
  url       = {https://mlanthology.org/ijcai/2011/konieczny2011ijcai-belief/}
}