Belief Base Rationalization for Propositional Merging
نویسندگان
چکیده
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.
منابع مشابه
Propositional merging operators based on set-theoretic closeness
In the propositional setting, a well-studied family of merging operators are distance-based ones: the models of the merged base are the closest interpretations to the given profile. Closeness is, in this context, measured as a number resulting from the aggregation of the distances to each base of the profile. In this work we define a new familly of propositional merging operators, close to such...
متن کاملMerging Knowledge Bases in Possibilistic Logic by Lexicographic Aggregation
Belief merging is an important but difficult problem in Artificial Intelligence, especially when sources of information are pervaded with uncertainty. Many merging operators have been proposed to deal with this problem in possibilistic logic, a weighted logic which is powerful for handling inconsistency and dealing with uncertainty. They often result in a possibilistic knowledge base which is a...
متن کاملFirst-Order Belief Merging using Dilations
The aim of belief merging is to merge conflicting information while preserving as much of it as possible. Most proposals in the literature work with knowledge bases expressed in propositional logic. We propose a new framework for merging knowledge bases expressed in (subsets of) first-order logic. Dilation operators (a concept originally introduced by Bloch and Lang) are employed and developed,...
متن کاملEncoding Information Fusion in Possibilistic Logic: A General Framework for Rational Syntactic Merging
The problem of merging multiple sources information is central in many information processing areas such as databases integration problems, multiple criteria decision making, expert opinion pooling, etc. Recently, several approaches have been proposed to merge classical propositional bases, or sets of (non-prioritized) goals. These approaches are in general semantically defined. Like in belief ...
متن کاملA diff-Based Merging Operator
Merging operators aim at defining the beliefs (resp. the goal) of a group of agents from a profile of bases, gathering the beliefs (resp. the goals) of each member of the group. In the propositional setting, a well-studied family of merging operators are distance-based ones: the models of the merged base are the closest interpretations to the given profile. Closeness is, in this context, measur...
متن کامل