Logic for coalitions with bounded resources

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

doi:10.1093/logcom/exq032

Logic for coalitions with bounded resources

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

University of Nottingham

Research output: Contribution to journal › Article › peer-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. 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	https://doi.org/10.1093/logcom/exq032
Publication status	Published - 24 Aug 2010
Externally published	Yes

Access to Document

10.1093/logcom/exq032

Cite this

@article{38aad41df9c34a60bef12ed2257e09b8,

title = "Logic for coalitions with bounded resources",

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.",

author = "N. Alechina and B. Logan and H.N. Nguyen and A. Rakib",

year = "2010",

month = aug,

day = "24",

doi = "10.1093/logcom/exq032",

language = "English",

volume = "21",

pages = "907--937",

journal = "Journal of Logic and Computation",

issn = "0955-792X",

publisher = "Oxford University Press",

number = "6",

}

TY - JOUR

T1 - Logic for coalitions with bounded resources

AU - Alechina, N.

AU - Logan, B.

AU - Nguyen, H.N.

AU - Rakib, A.

PY - 2010/8/24

Y1 - 2010/8/24

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-82455192521&partnerID=MN8TOARS

U2 - 10.1093/logcom/exq032

DO - 10.1093/logcom/exq032

M3 - Article

SN - 0955-792X

VL - 21

SP - 907

EP - 937

JO - Journal of Logic and Computation

JF - Journal of Logic and Computation

IS - 6

ER -

Logic for coalitions with bounded resources

Abstract

Access to Document

Other files and links

Fingerprint

Cite this