Paul Gainer

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper we introduce a calculus based on ordered resolution for Coalition Logic (CL), improving our previous approach based on unrefined resolution, and discuss the problems associated with imposing an ordering refinement in the context of CL. The calculus operates on 'coalition problems', a normal form for CL where we use coalition vectors that can(More)
  • 1