Abstract
Different methods have been proposed for merging multiple and potentially conflicting informations. Sum-based operators offer a natural method for merging commensurable prioritized belief bases. Their popularity is due to the fact that they satisfy the majority property and they adopt a non cautious attitude in deriving plausible conclusions.
This paper analyses the sum-based merging operator when sources to merge are incommensurable, namely they do not share the same meaning of uncertainty scales. We first show that the obtained merging operator can be equivalently characterized either in terms of an infinite set of compatible scales, or by a well-known Pareto ordering on a set of models. We then study different families of compatible scales useful for merging process. This paper also provides a postulates-based analysis of our merging operators.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Everaere, P., Konieczny, S., Marquis, P.: Conflict-based merging operators. In: Proceedings of KR 2008, pp. 348–357 (2008)
Lin, J.: Integration of weighted knowledge bases. Artificial Intelligence 83(2), 363–378 (1996)
Konieczny, S., Pino Pérez, R.: Merging information under constraints: a logical framework. Journal of Logic and Computation 12(5), 773–808 (2002)
Guilin, Q., Liu, W., Bell, D.A.: Merging stratified knowledge bases under constraints. In: Proceedings of AAAI 2006, July 2006, pp. 348–356 (2006)
Benferhat, S., Lagrue, S., Rossit, J.: An egalitarist fusion of incommensurable ranked belief bases under constraints. In: Proceedings of AAAI 2007, pp. 367–372 (2007)
Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 439–513. Oxford University Press, Oxford (1994)
Spohn, W.: Ordinal conditional functions: a dynamic theory of epistemic state. Causation in Decision, Belief Change and Statistics, 105–134 (1988)
Williams, M.A.: Iterated theory base change: A computational model. In: Proceedings of IJCAI 1995, pp. 1541–1547 (1995)
Meyer, T.: On the semantics of combination operations. Journal of Applied Non-Classical Logics 11(1-2), 59–84 (2001)
Nebel, B.: Belief revision and default reasoning: Syntax-based approaches. In: Proceedings of KR 1991, July 1991, pp. 417–428 (1991)
Liberatore, P., Schaerf, M.: Arbitration: A commutative operator for belief revision. In: Proceedings of the 2nd World Conference on the Fundamentals of Artificial Intelligence, pp. 217–228 (1995)
Everaere, P., Konieczny, S., Marquis, P.: A diff-based merging operator. In: Proceedings of NMR 2008, pp. 19–25 (2008)
Brewka, G.: Preferred subtheories: an extended logical framework for default reasoning. In: Proceedings of IJCAI 1989, pp. 1043–1048 (1989)
Benferhat, S., Dubois, D., Prade, H.: Some Syntactic Approaches to the Handling of Inconsistent Knowledge Bases: a Comparative Study Part 2: the Prioritized Case. In: Orłowska, E. (ed.) Logic at Work: Essays Dedicated to the Memory of H. Rasiowa, pp. 437–511. Physica-Verlag (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benferhat, S., Lagrue, S., Rossit, J. (2009). An Analysis of Sum-Based Incommensurable Belief Base Merging. In: Godo, L., Pugliese, A. (eds) Scalable Uncertainty Management. SUM 2009. Lecture Notes in Computer Science(), vol 5785. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04388-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-04388-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04387-1
Online ISBN: 978-3-642-04388-8
eBook Packages: Computer ScienceComputer Science (R0)