Logic of coalitional ability under bounded resources

Natasha Alechina ( University of Nottingham )

Recent work on ATL 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. Our motivating example is modelling distributed reasoning, where the resources of interest are time, memory and communication, and we want to be able to reason whether a coalition of agents can derive a goal formula under given resource restrictions. I will present a logic for reasoning about such properties, which is an extension of Coalition Logic with explicit resource requirements for strategies.

This is joint work with Brian Logan, Hoang Nga Nguyen and Abdur Rakib.