Abstract
Two conciliation processes for intelligent agents based on an iterated merge-then-revise change function for belief profiles are introduced and studied. The first approach is skeptical in the sense that at any revision step, each agent considers that her current beliefs are more important than the current beliefs of the group, while the other case is considered in the second, credulous approach. Some key features of such conciliation processes are pointed out for several merging operators; especially, the convergence issue, the existence of consensus and the properties of the induced iterated merging operators are investigated.
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
Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic of theory change: Partial meet contraction and revision functions. Journal of Symbolic Logic 50, 510–530 (1985)
Baral, C., Kraus, S., Minker, J.: Combining multiple knowledge bases. IEEE Transactions on Knowledge and Data Engineering 3(2), 208–220 (1991)
Baral, C., Kraus, S., Minker, J., Subrahmanian, V.S.: Combining knowledge bases consisting of first-order theories. Computational Intelligence 8(1), 45–71 (1992)
Booth, R.: A negociation-style framework for non-prioritised revision. In: Proceedings of the Eighth Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2001), pp. 137–150 (2001)
Booth, R.: Social contraction and belief negociation. In: Proceedings of the Eighth Conference on Principles of Knowledge Representation and Reasoning (KR 2002), pp. 374–384 (2002)
Dalal, M.: Investigations into a theory of knowledge base revision: preliminary report. In: Proceedings of the Seventh American National Conference on Artificial Intelligence (AAAI 1988), pp. 475–479 (1988)
Gärdenfors, P.: Knowledge in flux. MIT Press, Cambridge (1988)
Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artificial Intelligence 52, 263–294 (1991)
Konieczny, S.: Belief base merging as a game. Journal of Applied Non-Classical Logics 14(3), 275–294 (2004)
Konieczny, S.: Propositional belief merging and belief negotiation model. In: Proceedings of the International Workshop on Non-Monotonic Reasoning (NMR 2004), pp. 249–257 (2004)
Konieczny, S., Lang, J., Marquis, P.: DA2 merging operators. Artificial Intelligence 157(1-2), 49–79 (2004)
Konieczny, S., Pino Pérez, R.: On the logic of merging. In: Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR 1998), pp. 488–498 (1998)
Konieczny, S., Pino Pérez, R.: Merging with integrity constraints. In: Hunter, A., Parsons, S. (eds.) ECSQARU 1999. LNCS (LNAI), vol. 1638, pp. 233–244. Springer, Heidelberg (1999)
Konieczny, S., Pino Pérez, R.: Merging information under constraints: a qualitative framework. Journal of Logic and Computation 12(5), 773–808 (2002)
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.O.: Knowledge base merging by majority. In: Dynamic Worlds: From the Frame Problem to Knowledge Management, Kluwer, Dordrecht (1999)
Revesz, P.Z.: On the semantics of theory change: arbitration between old and new information. In: Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Databases, pp. 71–92 (1993)
Revesz, P.Z.: On the semantics of arbitration. International Journal of Algebra and Computation 7(2), 133–160 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gauwin, O., Konieczny, S., Marquis, P. (2005). Conciliation and Consensus in Iterated Belief Merging. In: Godo, L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2005. Lecture Notes in Computer Science(), vol 3571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11518655_44
Download citation
DOI: https://doi.org/10.1007/11518655_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27326-4
Online ISBN: 978-3-540-31888-0
eBook Packages: Computer ScienceComputer Science (R0)