A Comparison of Merging Operators in Possibilistic Logic
نویسندگان
چکیده
In this paper, we compare merging operators in possibilistic logic. We first propose an approach to evaluating the discriminating power of a merging operator. After that, we analyze the computational complexity of existing possibilistic merging operators. Finally, we consider the compatibility of possibilistic merging operators with propositional merging operators.
منابع مشابه
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...
متن کاملA principled analysis of merging operations in possibilistic logic
Possibilistic logic offers a qualitative frame work for representing pieces of information associated with levels of uncertainty or pri ority. The fusion of multiple sources infor mation is discussed in this setting. Differ ent classes of merging operators are consid ered including conjunctive, disjunctive, rein forcement, adaptive and averaging operators. Then we propose to analyse these...
متن کاملMerging Rules: Preliminary Version
In this paper we consider the merging of rules or conditionals. In contrast to other approaches, we do not invent a new approach from scratch, for one particular kind of rule, but we are interested in ways to generalize existing revision and merging operators from belief merging to rule merging. First, we study ways to merge rules based on only a notion of consistency of a set of rules, and ill...
متن کاملAn Inconsistency-Tolerant Approach to Information Merging Based on Proposition Relaxation
Inconsistencies between different information sources may arise because of statements that are inaccurate, albeit not completely false. In such scenarios, the most natural way to restore consistency is often to interpret assertions in a more flexible way, i.e. to enlarge (or relax) their meaning. As this process inherently requires extra-logical information about the meaning of atoms, extension...
متن کاملConflict-Based Belief Revision Operators in Possibilistic Logic
In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...
متن کامل