A resolution-based calculus for Coalition Logic (Extended Version)
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.
For each technical report listed here, copyright and all intellectual property rights remain with the respective authors. Copyright is effective from the year of publication in each case. By downloading a file from this page, you agree to use it only for purposes of research and scholarship. Any other use of this material or storage of it in any medium or its sale or distribution in any form is expressly forbidden without prior written permission from the authors concerned.