Abstract
When information comes from different sources inconsistent beliefs may appear. To handle inconsistency, several model-based belief merging operators have been proposed. Starting from the beliefs of a group of agents which might conflict, these operators return a unique consistent belief base which represents the beliefs of the group. The operators, parameterized by a distance between interpretations and aggregation function, usually only take into account consistent bases. Consequently, the information in the base, which is not responsible for conflicts, may be ignored. This paper presents an algorithm for implementing the PS-Merge operator, an alternative method of merging that uses the notion of Partial Satisfiability instead of distance measures. This operator allows us to take into account inconsistent bases. Also in order to use the PS-Merge operator to solve ITC problems a pre-processing transformation was proposed.
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
Baral, C., Kraus, S., Minker, J., Subrahmanian, V.S.: Combining knowledge bases consisting of first-order theories. Computational Intelligence 1(8), 45–71 (1992)
Bloch, I., Hunter, A.: Fusion: General concepts and characteristics. International Journal of Intelligent Systems 10(16), 1107–1134 (2001)
Borja Macías, V., Pozos Parra, P.: Model-based belief merging without distance measures. In: Proceedings of the Sixth International Conference on Autonomous Agents and Multiagent Systems, Honolulu, Hawai’i, pp. 613–615. ACM, New York (2007)
Gorogiannis, N., Hunter, A.: Implementing semantic merging operators using binary decision diagrams. Int. J. Approx. Reasoning 49(1), 234–251 (2008)
Konieczny, S., Lang, J., Marquis, P.: Da2 merging operators. Artificial Intelligence Journal(AIJ) 157(1-2), 49–79 (2004)
Konieczny, S., Pino-Pérez, R.: On the logic of merging. In: Cohn, A.G., Schubert, L., Shapiro, S.C. (eds.) KR 1998: Principles of Knowledge Representation and Reasoning, pp. 488–498. Morgan Kaufmann, San Francisco (1998)
Konieczny, S., Pino Pérez, R.: Merging with integrity constraints. In: Hunter, A., Parsons, S. (eds.) ECSQARU 1999. LNCS (LNAI), vol. 1638, p. 233. Springer, Heidelberg (1999)
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. In: Pareschi, R., Fronhoefer, B. (eds.) Dynamic Worlds: From the Frame Problem to Knowledge Management. Kluwer Academic, Dordrecht (1999)
Marien, M., Wittocx, J., Denecker, M., Bruynooghe, M.: Sat(id): Satisfiability of propositional logic extended with inductive definitions. In: Proceedings of the Eleventh International Conference on Theory and Applications of Satisfiability Testing, pp. 211–224 (2008)
Meyer, T., Parra, P.P., Perrussel, L.: Mediation using m-states. In: Godo, L. (ed.) ECSQARU 2005. LNCS (LNAI), vol. 3571, pp. 489–500. Springer, Heidelberg (2005)
Pozos Parra, P., Borja Macías, V.: Partial satisfiability-based merging. In: Proceedings of the Sixth Mexican International Conference on Artificial Intelligence, pp. 225–235 (2007)
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 Database Systems, pp. 71–82 (1993)
Revesz, P.Z.: On the Semantics of Arbitration. 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
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Macías, V.B., Parra, P.P. (2009). Implementing PS-Merge Operator. In: Aguirre, A.H., Borja, R.M., Garciá, C.A.R. (eds) MICAI 2009: Advances in Artificial Intelligence. MICAI 2009. Lecture Notes in Computer Science(), vol 5845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05258-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-05258-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05257-6
Online ISBN: 978-3-642-05258-3
eBook Packages: Computer ScienceComputer Science (R0)