A logic for coalitions with bounded resources

Natasha Alechina, Brian Logan, Nguyen Hoang Nga, Abdur Rakib

Research output: Chapter in Book/Report/Conference proceedingConference proceedingpeer-review

32 Citations (Scopus)

Abstract

Recent work on Alternating-Time Temporal Logic and Coalition Logic has allowed the expression of many interesting properties of coalitions and strategies. However there is no natural way of expressing resource requirements in these logics. This paper presents a Resource-Bounded Coalition Logic (RBCL) which has explicit representation of resource bounds in the language, and gives a complete and sound axiomatisation of RBCL.

Original languageEnglish
Title of host publicationProceedings of the IJCAI International Joint Conference on Artificial Intelligence
PublisherAAAI Press / International Joint Conferences on Artificial Intelligence
Pages659-664
Number of pages6
ISBN (Print)9781577354260
Publication statusPublished - 2009
Externally publishedYes
Event21st International Joint Conference on Artificial Intelligence, IJCAI 2009 - Pasadena, United States
Duration: 11 Jul 200916 Jul 2009

Publication series

NameIJCAI International Joint Conference on Artificial Intelligence
ISSN (Print)1045-0823

Conference

Conference21st International Joint Conference on Artificial Intelligence, IJCAI 2009
Country/TerritoryUnited States
CityPasadena
Period11/07/0916/07/09

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'A logic for coalitions with bounded resources'. Together they form a unique fingerprint.

Cite this