A logic for coalitions with bounded resources

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

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.

Citation

Alechina, N., Logan, B., Nga, N. H., & Rakib, A. (2009, July). A logic for coalitions with bounded resources. Paper presented at Twenty First International Joint Conference on Artificial Intelligence, Pasadena CA, USA

• Presentation Conference Type: Conference Paper (unpublished)
• Conference Name: Twenty First International Joint Conference on Artificial Intelligence
• Conference Location: Pasadena CA, USA
• Start Date: Jul 13, 2009
• End Date: Jul 17, 2009
• Acceptance Date: Mar 31, 2009
• Publication Date: Jul 13, 2009
• Deposit Date: Jun 16, 2017
• Peer Reviewed: Peer Reviewed
• Volume: 2
• Pages: 659-664
• Keywords: Resource-Bounds, Coalition Logic
• Public URL: https://uwe-repository.worktribe.com/output/994366
• Publisher URL: https://www.ijcai.org/Proceedings/09/Papers/115.pdf
• Additional Information: Title of Conference or Conference Proceedings : The Twenty First International Joint Conference on Artificial Intelligence