|Title:||Encoding classical fusion in ordered knowledge bases framework|
|Authors:||S. Benferhat, D. Dubois, S. Kaci, and H. Prade|
|Series:||Linköping Electronic Articles
in Computer and Information Science
|Issue:||Vol. 5 (2000), No. 027|
|Abstract:|| 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 classical propositional bases,
or sets of (non-prioritized) goals. These approaches are in general semantically
defined. Like in belief revision, they use priorities, generally based on
Dalal's distance, for merging the classical bases and return a new classical
base as a result.
An immediate consequence of the generation of a classical base is the impossibility of iterating the fusion process in a coherent way w.r.t. 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 including conjunctive, disjunctive, reinforcement and adaptive operators.We show that the approaches which have been recently proposed for merging classical propositional bases can be embedded in this setting. The result is then a prioritized base, and hence the process can be coherently iterated. Moreover, we also provide a syntactic counterpart for the fusion of classical bases.
|In ETAI Newsletter and Decision and Reasoning under Uncertainty|
| Original publication
part I -- Checksum
Checksum (old) Information about recalculation of checksum
Postscript part II -- Checksum II
Checksum II (old) Information about recalculation of checksum
This article was first posted on the Internet as specified under "First posting", and appeared on the E-press server on the date specified under "Original publication".