Symbolic Negotiation with Linear Logic
2004 (English)In: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, ISSN 0302-9743, Vol. 3259, 71-88 p.Article in journal (Refereed) Published
Negotiation over resources and multi-agent planning are important issues in multi-agent systems research. Previously it has been demonstrated  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.
Place, publisher, year, edition, pages
Springer, 2004. Vol. 3259, 71-88 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-81371ISI: 000226639100005ScopusID: 2-s2.0-23144453269OAI: oai:DiVA.org:kth-81371DiVA: diva2:497378
Fourth International Workshop on Computational Logic in Multi-Agent Systems, CLIMA IV
4th International Workshop on Computational Logic in Multi-Agent Systems Location: Ft Lauderdale, FL Date: JAN 06-07, 2004. QC 201203022012-02-102012-02-102012-03-14Bibliographically approved