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. 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 language | English |
---|---|
Pages (from-to) | 907-937 |
Number of pages | 31 |
Journal | Journal of Logic and Computation |
Volume | 21 |
Issue number | 6 |
DOIs | |
Publication status | Published - Dec 2011 |
Externally published | Yes |
Keywords
- Coalition logic
- resources