Skip to main content

Abstract

Model-based propositional belief merging operators are constructed from distances between the interpretations, or states, of the logic under consideration. In this paper we extend the notion of a distance between interpretations to generalised versions of propositional interpretations referred to as m-states. m-states allow for the definition of m-merging operators, which are generalisations of classical model-based merging operators. We show how m-merging, combined with appropriate measures of satisfaction, can be used to construct a logical framework for agent mediation: a process of intervening between parties with conflicting demands to facilitate a compromise.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. 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: Proceedings of the Sixth International Conference (KR 1998), pp. 488–498. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  2. Konieczny, S., Lang, J., Marquis, P.: Distance-based merging: a general framework and some complexity results. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Eighth International Conference (KR 2002), pp. 97–108 (2002)

    Google Scholar 

  3. Liberatore, P., Schaerf, M.: Arbitration (or How to Merge Knowledge Bases). IEEE Transactions on Knowledge and Engineering 10, 76–90 (1998)

    Article  Google Scholar 

  4. Konieczny, S., Lang, J., Marquis, P.: DA 2 Merging Operators. Artificial Intelligence 157, 49–79 (2004)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  6. Revesz, P.Z.: On the semantics of arbitration. International Journal of Algebra and Computation 7, 133–160 (1997)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  8. Konieczny, S., Pérez, R.P.: Merging information under under constraints: a qualitative framework. Journal of Logic and Computation 5, 773–808 (2002)

    Article  Google Scholar 

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

    Google Scholar 

  10. Everaere, P., Konieczny, S., Marquis, P.: On Merging Strategy-Proofness. In: Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (2004)

    Google Scholar 

  11. Booth, R.: A negotiation-style framework for non-prioritised revision. In: Proceedings of the Eighth Conference on Theoretical Aspects of Rationality and Knowledge, pp. 137–150 (2001)

    Google Scholar 

  12. Booth, R.: Social contraction and belief negotiation. In: Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning, pp. 374–384 (2002)

    Google Scholar 

  13. Konieczny, S.: Propositional Belief Merging and Belief Negotiation Model. In: Tenth International Workshop on Non-Monotonic Reasoning (2004)

    Google Scholar 

  14. Meyer, T., Foo, N., Kwok, R., Zhang, D.: Logical foundations of negotiation: strategies and preferences. In: Proceedings of KR 2004 (2004)

    Google Scholar 

  15. Meyer, T., Foo, N., Kwok, R., Zhang, D.: Logical foundations of negotiation: Outcome, concession and adaptation. In: Proceedings of AAAI 2004 (2004)

    Google Scholar 

  16. Zhang, D., Foo, N., Meyer, T., Kwok, R.: Negotiation as mutual belief revision. In: Proceedings of the Nineteenth National Conference on Artificial Intelligence, AAAI 2004 (2004)

    Google Scholar 

  17. Lin, F., Reiter, R.: Forget it! In: Proceedings of the AAAI Falls Symposium on Relevance, New Orleans (LA), pp. 154–159 (1994)

    Google Scholar 

  18. Lang, J., Marquis, P.: Complexity results for independence and definability. In: Proceedings of the 6th International Conference on Knowledge Representation and Reasoning (KR 1998), Trento, pp. 356–367 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meyer, T., Parra, P.P., Perrussel, L. (2005). Mediation Using m-States. 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_42

Download citation

  • DOI: https://doi.org/10.1007/11518655_42

  • 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)

Publish with us

Policies and ethics