Abstract
Belief merging aims at building a common belief set issued from multiple belief sets. The quality of the resulting set is usually considered in terms of a closeness criterion between the initial belief sets and an integrity constraint with respect to the aim of the merging procedure. The notion of distance between belief sets is thus a crucial issue when we face the merging problem. The aim of this paper is to revisit belief merging operators, notably the majority and the arbitration operators, with the help of a new distance that considers, in a syntactical way, the importance of each symbol in the belief set.
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
Bittencourt, G., Marchi, J., Padilha, R.S.: A syntactic approach to satisfaction. In: Konev, B., Schmidt, R. (eds.) Proc. of the 4th Inter. Workshop on the Implementation of Logics, pp. 18–32. University of Liverpool and University of Manchester (2003)
Bittencourt, G., Perrussel, L., Marchi, J.: A syntactical approach to revision. In: de Mántaras, R.L., Saitta, L. (eds.) Proc. of the 16th Eureopean Conf. on Artificial Intelligence, ECAI 2004, Valencia, Spain, August 22–27, pp. 788–792. IOS Press, Amsterdam (2004)
Dalal, M.: Investigations into a theory of knowledge base revision: Preliminary report. In: Rosenbloom, P., Szolovits, P. (eds.) Proc. of the 7th National Conf. on Artificial Intelligence, vol. 2, pp. 475–479. AAAI Press, Menlo Park (1988)
Forbus, K.: Introducing actions into qualitative simulation. In: Proc. of IJCAI 1989, Detroit, MI, pp. 1273–1278 (1989)
Gärdenfors, P.: Knowledge in Flux: Modelling the Dynamics of Epistemic States. Bradford Books/MIT Press (1988)
Konieczny, S., Lang, J., Marquis, P.: Distance-based merging: a general framework and some complexity results. In: Proc. of KR 2002, pp. 97–108 (2002)
Konieczny, S., Pérez, R.P.: Merging information under constraints: a logical framework. Journal of Logic and Computation 12(5), 773–808 (2002)
Konieczny, S., Pérez, R.P.: Propositional belief base merging or how to merge beliefs/goals coming from several sources and some links with social choice theory. European Journal of Operational Research 160(3), 785–802 (2005)
Liberatore, P., Schaerf, M.: Arbitration (or how to merge knowledge bases). IEEE Transactions on Knowledge and Data Engineering 10(1), 76–90 (1998)
Lin, J., Mendelzon, A.: Knowledge base merging by majority. Kluwer, Dordrecht (1999)
Marchi, J., Bittencourt, G., Perrussel, L.: A syntactical approach to belief update. In: Gelbukh, A., de Albornoz, Á., Terashima-Marín, H. (eds.) MICAI 2005. LNCS (LNAI), vol. 3789, pp. 142–151. Springer, Heidelberg (2005)
Revesz, P.Z.: On the Semantics of Arbitration. Journal of Algebra and Computation 7(2), 133–160 (1997)
Socher, R.: Optimizing the clausal normal form transformation. Journal of Automated Reasoning 7(3), 325–336 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perrussel, L., Marchi, J., Bittencourt, G. (2008). Quantum-Based Belief Merging. In: Geffner, H., Prada, R., Machado Alexandre, I., David, N. (eds) Advances in Artificial Intelligence – IBERAMIA 2008. IBERAMIA 2008. Lecture Notes in Computer Science(), vol 5290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88309-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-88309-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88308-1
Online ISBN: 978-3-540-88309-8
eBook Packages: Computer ScienceComputer Science (R0)