Symbolic Negotiation with Linear Logic
Agentlink Clearinghouse is powered by GNU EPrints developed by the School of Electronics and Computer Science of the University of Southampton.
Type: Conference or Workshop Item (Paper)

Küngas, Peep and Matskin, Mihhail (2004) Symbolic Negotiation with Linear Logic. In: Fourth International Workshop on Computational Logic in Multi-Agent Systems, CLIMA IV, 6-7 January, 2004, Fort Lauderdale, FL, USA.

Full text not available from this archive.


Negotiation over resources and multi-agent planning are important issues in multi-agent systems research. Previously it has been demonstrated~\cite{KuMa03} 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.

Deposited by Mr Peep Küngas on 14 March 2005

Archive Staff Only: edit this record


AgentLink is the European Commission's IST-funded Coordination Action for Agent-Based Computing
and is coordinated by the
University of Liverpool and University of Southampton
If you encounter any problems with these pages please contact