Skip to main content
Springer Nature Link
Log in

Partial Satisfiability-Based Merging

  • Conference paper
MICAI 2007: Advances in Artificial Intelligence (MICAI 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4827))

Included in the following conference series:

  • 1022 Accesses

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 different belief bases which might conflict, these operators return a unique consistent 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 some information which is not responsible for conflicts may be ignored. An alternative way of merging uses the notion of Partial Satisfiability to define PS-Merge, a model-based merging operator that produces similar results to other merging approaches, but while other approaches require many merging operators in order to achieve satisfactory results for different scenarios PS-Merge obtains similar results for all these different scenarios with a unique operator. This paper analyzes some of the properties satisfied by PS-Merge.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bloch, I., Hunter, A.: Fusion: General concepts and characteristics. International Journal of Intelligent Systems 10(16), 1107–1134 (2001)

    Article  Google Scholar 

  2. Liberatore, P., Schaerf, M.: Arbitration (or how to merge knowledge bases). IEEE Transactions on Knowledge and Data Engineering 10(1), 76–90 (1998)

    Article  Google Scholar 

  3. Konieczny, S., Pino-Pérez, R.: On the logic of merging. In: Cohn, A.G., Schubert, L., Shapiro, S.C. (eds.) Principles of Knowledge Representation and Reasoning, pp. 488–498. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  4. Revesz, P.Z.: On the Semantics of Arbitration. Journal of Algebra and Computation 7 (2), 133–160 (1997)

    Article  MathSciNet  Google Scholar 

  5. Lin, J., Mendelzon, A.: Knowledge base merging by majority. In: Pareschi, R., B, F. (eds.) Dynamic Worlds: From the Frame Problem to Knowledge Management. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  6. Baral, C., Kraus, S., Minker, J., Subrahmanian, V.: Combining knowledge bases consisting of first-order theories. Computational Intelligence 1(8), 45–71 (1992)

    Article  Google Scholar 

  7. Borja Macías, V., Pozos Parra, P.: Model-based belief merging without distance measures. In: International Conference on Autonomous Agents and Multiagent Systems, Honolulu, Hawai, pp. 613–615. ACM Press, New York (2007)

    Google Scholar 

  8. Konieczny, S., Pino-Pérez, R.: Merging with integrity constraints. In: Hunter, A., Parsons, S. (eds.) ECSQARU 1999. LNCS (LNAI), vol. 1638, Springer, Heidelberg (1999)

    Google Scholar 

  9. Meyer, T., Pozos, P., Perrussel, L.: Mediation using m-states. In: Godo, L. (ed.) ECSQARU 2005. LNCS (LNAI), vol. 3571, pp. 489–500. Springer, Heidelberg (2005)

    Google Scholar 

  10. 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. ACM Press, New York (1993)

    Chapter  Google Scholar 

  11. Konieczny, S., Pino-Pérez, R.: Merging information under constraints: a logical framework. Journal of Logic and Computation 12 (5), 773–808 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Dalal, M.: Investigations into a theory of knowledge base revision. In: Procceedings of the 7th National Conference of the American Association for Artificial Intelligence, Saint Paul, Minnesota, pp. 475–479 (1988)

    Google Scholar 

  13. Halpern, J., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence 3(54), 319–379 (1992)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad Juárez Autónoma de Tabasco, Carretera Cunduacán - Jalpa Km. 1 Cunduacán Tabasco, México

    Pilar Pozos Parra

  2. Universidad Tecnológica de la Mixteca, Carretera a Acatlima Km 2.5 Huajuapan de León Oaxaca, México

    Verónica Borja Macías

Authors
  1. Pilar Pozos Parra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Verónica Borja Macías
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alexander Gelbukh Ángel Fernando Kuri Morales

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pozos Parra, P., Borja Macías, V. (2007). Partial Satisfiability-Based Merging. In: Gelbukh, A., Kuri Morales, Á.F. (eds) MICAI 2007: Advances in Artificial Intelligence. MICAI 2007. Lecture Notes in Computer Science(), vol 4827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76631-5_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76631-5_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76630-8

  • Online ISBN: 978-3-540-76631-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics