LiEP CIS-2000-027: Encoding classical fusion in ordered knowledge bases framework.

Temporary registration page before publication by Linköping University Electronic Press, series Computer and Information Science

The following article is intended to be published shortly by Linköping University Electronic Press. The present page gives access to the article, but does not provide the guarantees of persistence.

Encoding classical fusion in ordered knowledge bases framework.

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 ISSN 1401-9841
Issue:	Vol. 5(2000): nr 027
URL:	http://www.ep.liu.se/ea/cis/2000/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.
Keywords:

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.

Keywords:

First posting 1999-04-06	In ETAI Newsletter and Decision and Reasoning under Uncertainty
Intended publication 1999-12-21	Postscript part I -- Checksum Postscript part II -- Checksum II
Info from authors
Third-party information

[About LiEP] [About Checksum validation] [About compression formats]

Editor-in-chief: editor@ep.liu.se
Webmaster: webmaster@ep.liu.se