Logic for coalitions with bounded resources

N. Alechina, B. Logan, H.N. Nguyen, A. Rakib

Research output: Contribution to journalArticlepeer-review

31 Citations (Scopus)


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. In this article, we present a Resource-Bounded Coalition Logic (RBCL) that has explicit representation of resource bounds in the language. We give a complete and sound axiomatization of RBCL, a procedure for deciding satisfiability of RBCL formulas, and a model-checking algorithm.
Original languageEnglish
Pages (from-to)907-937
Number of pages31
JournalJournal of Logic and Computation
Issue number6
Publication statusPublished - 24 Aug 2010
Externally publishedYes


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

Cite this