Skip to main content

Priority-Based Merging Operator Without Distance Measures

  • Conference paper
  • First Online:
Multi-Agent Systems (EUMAS 2014)

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

Included in the following conference series:

Abstract

This paper proposes a refinement of the PS-Merge merging operator, which is an alternative merging approach that employs the notion of partial satisfiability rather than the usual distance measures. Our approach will add to PS-Merge a mechanism to deal with a kind of priority based on the quantity of information of the agents. We will refer to the new operator as Pr-Merge. We will also analyze its logical properties as well its complexity by conceiving an algorithm with a distinct strategy from that presented for PS-Merge.

This research is supported by CNPq (Universal 2012 - Proc. n° 473110/2012-1), and CNPq Casadinho/PROCAD Project (n° 552578/2011-8).

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 EPUB and 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

References

  1. Arrow, K.J., Sen, A., Suzumura, K.: Handbook of Social Choice & Welfare, vol. 2. Elsevier, New York (2010)

    Google Scholar 

  2. Bloch, I., Hunter, A., Appriou, A., Ayoun, A., Benferhat, S., Besnard, P., Cholvy, L., Cooke, R., Cuppens, F., Dubois, D., et al.: Fusion: general concepts and characteristics. Int. J. Intell. Syst. 16(10), 1107–1134 (2001)

    Article  Google Scholar 

  3. Chevaleyre, Y., Endriss, U., Lang, J., Maudet, N.: A short introduction to computational social choice. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 51–69. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Dalal, M.: Investigations into a theory of knowledge base revision. In: Proceedings of the Seventh American National Conference on Artificial Intelligence (AAAI 1988), pp. 475–479 (1988)

    Google Scholar 

  5. Everaere, P., Konieczny, S., Marquis, P.: Quota and gmin merging operators. In: Proceedings of 19th International Joint Conference on Artificial Intelligence (IJCAI 2005) (2005)

    Google Scholar 

  6. Everaere, P., Konieczny, S., Marquis, P.: Conflict-based merging operators. In: KR, pp. 348–357 (2008)

    Google Scholar 

  7. Everaere, P., Konieczny, S., Marquis, P.: A diff-based merging operator. In: Proceedings of the NMR, vol. 8, pp. 19–25 (2008)

    Google Scholar 

  8. Grégoire, E., Konieczny, S.: Logic-based approaches to information fusion. Inf. Fus. 7(1), 4–18 (2006)

    Article  Google Scholar 

  9. Konieczny, S., Lang, J., Marquis, P.: Distance-based merging: a general framework and some complexity results. KR 2, 97–108 (2002)

    Google Scholar 

  10. Konieczny, S., Lang, J., Marquis, P.: DA\(^2\) merging operators. Artif. Intell. 157(1), 49–79 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. 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)

    Chapter  Google Scholar 

  12. Konieczny, S., Pérez, R.P.: On the frontier between arbitration and majority. In: KR, pp. 109–120 (2002)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. Lafage, C., Lang, J.: Propositional distances and preference representation. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol. 2143, pp. 48–59. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Macías, V.B., Parra, P.P.: Model-based belief merging without distance measures. In: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, p. 154. ACM (2007)

    Google Scholar 

  16. Macías, V.B., Parra, P.P.: Implementing PS-merge operator. In: Aguirre, A.H., Borja, R.M., Garciá, C.A.R. (eds.) MICAI 2009. LNCS, vol. 5845, pp. 39–50. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  17. Pozos Parra, P., Borja Macías, V.: Partial satisfiability-based merging. In: Gelbukh, A., Kuri Morales, Á.F. (eds.) MICAI 2007. LNCS (LNAI), vol. 4827, pp. 225–235. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. Pozos-Parra, P., Perrussel, L., Thevenin, J.M.: Belief merging using normal forms. In: Batyrshin, I., Sidorov, G. (eds.) MICAI 2011, Part I. LNCS, vol. 7094, pp. 40–51. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  19. Revesz, P.Z.: On the semantics of theory change: arbitration between old and new information. In: Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 71–82. ACM (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Henrique Viana .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Viana, H., Alcântara, J. (2015). Priority-Based Merging Operator Without Distance Measures. In: Bulling, N. (eds) Multi-Agent Systems. EUMAS 2014. Lecture Notes in Computer Science(), vol 8953. Springer, Cham. https://doi.org/10.1007/978-3-319-17130-2_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-17130-2_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-17129-6

  • Online ISBN: 978-3-319-17130-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics