Coalition Logic CL is a logic for reasoning about cooperative agency,
that is, a formalism intended to describe the ability of groups of
agents to achieve an outcome in a strategic game.
In this talk we discuss a resolution-based calculus for Coalition
Logic CL. The calculus operates on `coalition problems', a normal form
for CL, and the inference rules of the calculus provide the basis for
a decision procedure for the satisfiability problem in CL. We also
present some preliminary experimental results for two prototypical
implementations of the calculus for CL and compare both with a
tableau-based decision procedure.