@TECHREPORT{Nalon+Zhang+Dixon+Hustadt@ULCSTR2013,
 AUTHOR        = {Cl{\'a}udia Nalon and Lan Zhang and Clare Dixon and Ullrich Hustadt},
 TITLE         = {A resolution-based calculus for Coalition Logic (Extended Version)},
 INSTITUTION   = {Department of Computer Science, University of Liverpool},
 YEAR          = {2013},
 TYPE          = {Technical Report},
 NUMBER        = {ULCS-13-004},
 ADDRESS       = {Liverpool, UK},
 URL           = {http://intranet.csc.liv.ac.uk/research/techreports/tr2013/ulcs-13-004.pdf},
 ABSTRACT      = {We present a resolution-based calculus for the Coalition Logic CL, a
non-normal modal logic used for reasoning about cooperative agency. We present
a normal form and a set of resolution-based inference rules to solve the 
satisfiability problem in CL. We also show that the calculus presented here is sound,
complete, and terminating.}
}