Symbolic negotiation with linear logic

  • Authors:
  • Peep Küngas;Mihhail Matskin

  • Affiliations:
  • Department of Computer and Information Science, Norwegian University of Science and Technology, Trondheim, Norway;Department of Microelectronics and Information Technology, Royal Institute of Technology, Kista, Sweden

  • Venue:
  • CLIMA IV'04 Proceedings of the 4th international conference on Computational Logic in Multi-Agent Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Negotiation over resources and multi-agent planning are important issues in multi-agent systems research. Previously it has been demonstrated [18] how symbolic negotiation and distributed planning together could be formalised as distributed Linear Logic (LL) theorem proving. LL has been chosen mainly because of its expressive power for representation of resources and its computation-oriented nature. This paper extends the previous work by taking advantage of a richer fragment of LL and introducing two sorts of nondeterministic choices into negotiation. This allows agents to reason and negotiate under certain degree of uncertainty. Additionally, a way of granting unbounded access to resources during negotiation is considered. Finally we extend our framework with first-order LL for expressing more complex offers during negotiation.