ML Anthology

A Logic for Coalitions with Bounded Resources

Natasha Alechina, Brian Logan, Nguyen Hoang Nga, Abdur Rakib
IJCAI 2009 pp. 659-664
doi:10.1093/logcom/exq032 /ijcai/2009/alechina2009ijcai-logic/

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. Natasha Alechina, Brian Logan, Hoang Nga Nguyen, Abdur Rakib

PDF Semantic Scholar

Cite

Text

Alechina et al. "A Logic for Coalitions with Bounded Resources." International Joint Conference on Artificial Intelligence, 2009. doi:10.1093/logcom/exq032

Markdown

[Alechina et al. "A Logic for Coalitions with Bounded Resources." International Joint Conference on Artificial Intelligence, 2009.](https://mlanthology.org/ijcai/2009/alechina2009ijcai-logic/) doi:10.1093/logcom/exq032

BibTeX

@inproceedings{alechina2009ijcai-logic,
  title     = {{A Logic for Coalitions with Bounded Resources}},
  author    = {Alechina, Natasha and Logan, Brian and Nga, Nguyen Hoang and Rakib, Abdur},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2009},
  pages     = {659-664},
  doi       = {10.1093/logcom/exq032},
  url       = {https://mlanthology.org/ijcai/2009/alechina2009ijcai-logic/}
}