Belief base rationalization for propositional merging. (9th October 2018)

• Record Type: Journal Article
• Authors: Schwind, Nicolas; Konieczny, Sébastien; Marquis, Pierre
• Is Part Of: Journal of logic and computation. Volume 28:Number 7(2018)
• Page Start: 1601
• Page End: 1634
• Publication Date: 2018-10-09
• Subjects: belief merging -- rationalization -- belief revision -- belief update -- independence to rationalization; Logic programming -- Periodicals; Logic, Symbolic and mathematical -- Periodicals; Computational complexity -- Periodicals; 005.115
• DOI: 10.1093/logcom/exy029
• Languages: English
• ISSNs: 0955-792X

Abstract

Abstract: Existing belief merging operators take advantage of all the models from the bases, including those contradicting the integrity constraint. In this paper, we argue that this is not suited to every merging scenario, especially when the integrity constraint encodes physical laws. In that case the bases have to be 'rationalized' with respect to the integrity constraint during the merging process. We define several conditions characterizing the operators that are independent to such a rationalization process, and we show how these conditions interact with the standard IC postulates for belief merging. Especially, we give an independence-based axiomatic characterization of a distance-based operator.