Possibilistic merging and distance-based fusion of propositional information

被引:55
作者
Benferhat, S [1 ]
Dubois, D [1 ]
Kaci, S [1 ]
Prade, H [1 ]
机构
[1] Univ Toulouse 3, CNRS, IRIT, F-31062 Toulouse 4, France
关键词
fusion; merging operators; possibilistic logic;
D O I
10.1023/A:1014446411602
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The problem of merging multiple sources information is central in many information processing areas such as databases integrating problems, multiple criteria decision making, expert opinion pooling, etc. Recently, several approaches have been proposed to merge propositional bases, or sets of (non-prioritized) goals. These approaches are in general semantically defined. Like in belief revision, they use implicit priorities, generally based on Dalal's distance, for merging the propositional bases and return a new propositional base as a result. An immediate consequence of the generation of a propositional base is the impossibility of decomposing and iterating the fusion process in a coherent way with respect to priorities since the underlying ordering is lost. This paper presents a general approach for fusing prioritized bases, both semantically and syntactically, when priorities are represented in the possibilistic logic framework. Different classes of merging operators are considered depending on whether the sources are consistent, conflicting, redundant or independent. we show that the approaches which have been recently proposed for merging propositional bases can be embedded in this setting. The result is then a prioritized base, and hence the process can be coherently decomposed and iterated. Moreover, this encoding provides a syntactic counterpart for the fusion of propositional bases.
引用
收藏
页码:217 / 252
页数:36
相关论文
共 23 条
  • [1] [Anonymous], AGGREGATION FUSION I
  • [2] [Anonymous], 1997, The Ordered Weighted Averaging Operators: Theory and Applications
  • [3] [Anonymous], 1988, KNOWLEDGE FLUX
  • [4] [Anonymous], 1998, KR 98
  • [5] Baral C., 1992, Computational Intelligence, V8, P45, DOI 10.1111/j.1467-8640.1992.tb00337.x
  • [6] BENFERHAT S, 1999, 3 INT C KNOWL BAS IN, P170
  • [7] BENFERHAT S, 2000, P 16 INT C UNC ART I, P24
  • [8] CHOLVY L, 1998, HDB DEFEASIBLE REASO, V3, P233
  • [9] Dalal M., 1988, P AAAI, P449
  • [10] POSSIBILITY THEORY AND DATA FUSION IN POORLY INFORMED ENVIRONMENTS
    DUBOIS, D
    PRADE, H
    [J]. CONTROL ENGINEERING PRACTICE, 1994, 2 (05) : 811 - 823