Skip to main content

Graph-Based Belief Merging

  • Conference paper
  • First Online:
Logic, Rationality, and Interaction (LORI 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9394))

Included in the following conference series:

Abstract

Graphs are employed to define a variety of distance-based binary merging operators. We provide logical characterization results for each class of merging operators introduced and discuss the extension of this approach to the merging of sequences and multisets.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Borgida, A., Imielinski, T.: Decision making in commitees - a framework for dealing with inconsistency and non-monotonicity. In: NMR, pp. 21–32 (1984)

    Google Scholar 

  2. Baral, C., Kraus, S., Minker, J.: Combining multiple knowledge bases. IEEE Transactions on Knowledge and Data Engineering 3, 208–220 (1991), doi:10.1109/69.88001

    Article  Google Scholar 

  3. 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–82 (1993)

    Google Scholar 

  4. Liberatore, P., Schaerf, M.: Arbitration (or how to merge knowledge bases). IEEE Trans. Knowl. Data Eng. 10(1), 76–90 (1998)

    Article  Google Scholar 

  5. Smets, P.: The combination of evidence in the transferable belief model. IEEE Transactions on Pattern Analysis and Machine Intelligence 12, 447–458 (1990), doi:10.1109/34.55104

    Article  Google Scholar 

  6. Rabinowicz, W.: Global belief revision based on similarities between worlds. In: Hansson, S.O., Rabinowicz, W. (eds.) Logic for a Change: Essays Dedicated to Sten Lindström on the Occasion of His Fiftieth Birthday. Uppsala prints and preprints in philosophy, no. 9, pp. 80–105. Department of Philosophy, Uppsala University (1995)

    Google Scholar 

  7. Hall, D., Martin Liggins, I., Chong, C., Linas, J.: Distributed Data Fusion for Network-Centric Operations. CRC PressINC (2012)

    Google Scholar 

  8. Elmagarmid, A., Rusinkiewicz, M., Sheth, A.: Management of heterogeneous and autonomous database systems. Morgan Kaufmann Publishers Inc., San Francisco (1999)

    Google Scholar 

  9. Delgrande, J.P., Schaub, T.: A consistency-based approach for belief change. Artif. Intell. 151(1-2), 1–41 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Konieczny, S., Pérez, R.P.: Logic based merging. J. Philosophical Logic 40(2), 239–270 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Andréka, H., Ryan, M., Schobbens, P.: Operators and laws for combining preference relations. Journal of Logic and Computation 12(1), 13–53 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Schlechta, K.: Non-prioritized belief revision based on distances between models. Theoria 63(1-2), 34–53 (1997)

    Article  MathSciNet  Google Scholar 

  13. Konieczny, S., Pérez, R.P.: Merging with integrity constraints. In: Hunter, A., Parsons, S. (eds.) ECSQARU 1999. LNCS (LNAI), vol. 1638, pp. 233–244. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Georgatos, K.: On indistinguishability and prototypes. Logic Journal of the IGPL 11(5), 531–545 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. Poincaré, H.: La Valeur de la Science. Flammarion, Paris (1905)

    MATH  Google Scholar 

  17. Zeeman, E.C.: The topology of the brain and visual perception. In: Fort, M.K. (ed.) The Topology of 3-Manifolds, pp. 240–256. Prentice Hall, Englewood Cliffs (1962)

    Google Scholar 

  18. Georgatos, K.: Geodesic revision. Journal of Logic and Computation 19(3), 447–459 (2009), doi:10.1093/logcom

    Article  MathSciNet  MATH  Google Scholar 

  19. Georgatos, K.: Conditioning by minimizing accessibility. In: Bonanno, G., Löwe, B., van der Hoek, W. (eds.) LOFT 2008. LNCS (LNAI), vol. 6006, pp. 20–33. Springer, Heidelberg (2010)

    Google Scholar 

  20. Georgatos, K.: Iterated contraction based on indistinguishability. In: Artemov, S., Nerode, A. (eds.) LFCS 2013. LNCS, vol. 7734, pp. 194–205. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  21. Lehmann, D.J., Magidor, M., Schlechta, K.: Distance semantics for belief revision. J. Symb. Log. 66(1), 295–317 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Konstantinos Georgatos .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Georgatos, K. (2015). Graph-Based Belief Merging. In: van der Hoek, W., Holliday, W., Wang, Wf. (eds) Logic, Rationality, and Interaction. LORI 2015. Lecture Notes in Computer Science(), vol 9394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48561-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48561-3_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48560-6

  • Online ISBN: 978-3-662-48561-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics