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 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.
Similar content being viewed by others
References
C. Baral, S. Kraus, J. Minker and V.S. Subrahmanian, Combining knowledge bases consisting in first order theories, Comput. Intell. 8(1) (1992) 45-71.
S. Benferhat, D. Dubois and H. Prade, From semantic to syntactic approaches to information combination in possibilistic logic, in: Aggregation and Fusion of Imperfect Information (Physica Verlag, 1997) pp. 141-151.
S. Benferhat, D. Dubois, S. Kaci and H. Prade, A principled analysis of merging operations in possibilistic logic, in: Proceedings of the Sixteenth International Conference on Uncertainty in Artificial Intelligence (UAI'00), Stanford (2000) pp. 24-31.
S. Benferhat, D. Dubois, S. Kaci and H. Prade, Encoding information fusion in possibilistic logic: a general framework for rational syntactic merging, in: Proceedings of 14th European Conference on Artificial Intelligence (ECAI'00) (2000) pp. 3-7.
S. Benferhat, D. Dubois, H. Prade and M.A. Williams, A practical approach to revising prioritized knowledge bases, in: Third International Conference on Knowledge-Based Intelligent Information Engineering Systems, KES'99, Adelaide, Australia (1999) pp. 170-174.
L. Cholvy, Reasoning about merging information, in: Handbook of Defeasible Reasoning and Uncertainty Management Systems, Vol. 3 (1998) pp. 233-263.
M. Dalal, Investigations into a theory of knowledge base revision: preliminary report, in: Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI'88) (1988) pp. 475-479.
D. Dubois, J. Lang and H. Prade, Possibilistic logic, in: Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3 (1994) pp. 439-513.
D. Dubois and H. Prade, Possibility theory and data fusion in poorly informed environments, Control Engineering Practice 2 (1994) 811-823.
D. Dubois, H. Fargier and H. Prade, Beyond min aggregation in multicriteria decision: (ordered) weighted min, discrimin, leximin, in: The Ordered Weighted Averaging Operators-Theory and Applications, eds. R.R. Yager and J. Kacprzyk (Kluwer Academic, Boston, 1997) pp. 181-192.
P. Gärdenfors, Knowledge in Flux (MIT Press, Cambridge, MA, 1988).
S. Konieczny and R. Pino Pérez, On the logic of merging, in: Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98) (1998) pp. 488-498.
S. Konieczny and R. Pino Pérez, Merging with integrity constraints, in: Proceedings of the Fifth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'99), Lecture Notes in Artificial Intelligence, Vol. 1638 (1999) pp. 233-244.
C. Lafage and J. Lang, Logical representation of preferences for group decision making, 7th International Conference on Principles of Knowledge Representation and Reasoning, eds. Cohn et al., Breckenridge, CO (2000) pp. 457-468.
P. Liberatore and M. Schaerf, Arbitration: A commutative operator for belief revision, in: Proceedings of the Second World Conference on the Fundamentals of Artificial Intelligence (1995) pp. 217-228.
J. Lin, Integration of weighted knowledge bases, Artif. Intell. 83 (1996) 363-378.
J. Lin and A.O. Mendelzon, Merging databases under constraints, Internat. J. Cooperative Inform. Syst. 7(1) (1998) 55-76.
T. Meyer, On the semantics of merging, in: Proceedings of 8th Workshop on Non-Monotonic Reasoning (NMR'00) (2000).
N. Rescher and R. Manor, On inference from inconsistent premises, Theory and Decision 1 (1970) 179-219.
P.Z. Revesz, On the semantics of theory change: arbitration between old and new information, in: Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Databases (1993) pp. 71-92.
P.Z. Revesz, On the semantics of arbitration, Internat. J. Algebra Comput. 7(2) (1997) 133-160.
M.A. Williams, Iterated theory base change: A computational model, in: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI'95), Montreal (1995) pp. 1541-1550.
R.R. Yager and J. Kacprzyk, eds., The Ordered Weighted Averaging Operation: Theory, Methodology and Applications (Kluwer, Norwell, MA, 1997).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Benferhat, S., Dubois, D., Kaci, S. et al. Possibilistic Merging and Distance-Based Fusion of Propositional Information. Annals of Mathematics and Artificial Intelligence 34, 217–252 (2002). https://doi.org/10.1023/A:1014446411602
Issue Date:
DOI: https://doi.org/10.1023/A:1014446411602