Ordered Resolution for Coalition Logic

  • Ullrich Hustadt
  • Paul Gainer
  • Clare Dixon
  • Cláudia Nalon
  • Lan Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9323)


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 represent choices made by agents explicitly, and the inference rules of the calculus provide the basis for a decision procedure for the satisfiability problem in CL. We give correctness, termination and complexity results for our calculus. We also present experimental results for an implementation of the calculus and show that it outperforms a tableau-based decision procedure for Alternating-Time Temporal Logic (CL) on two classes of benchmark formulae for CL.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672–713 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Areces, C., Gennari, R., Heguiabehere, J., de Rijke, M.: Tree-Based heuristic in modal theorem proving. In: Proc. ECAI 2000. IOS Press (2000)Google Scholar
  3. 3.
    Areces, C., Gorín, D.: Resolution with order and selection for hybrid logics. J. of Automated Reasoning 46, 1–42 (2011), doi:10.1007/s10817-010-9167-0MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 19–99. Elsevier (2001)Google Scholar
  5. 5.
    Borgo, S.: Coalitions in action logic. In: Proc. IJCAI 2007, pp. 1822–1827 (2007)Google Scholar
  6. 6.
    David, A.: TATL: Implementation of ATL tableau-based decision procedure. In: Galmiche, D., Larchey-Wendling, D. (eds.) TABLEAUX 2013. LNCS, vol. 8123, pp. 97–103. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  7. 7.
    van Drimmelen, G.: Satisfiability in alternating-time temporal logic. In: Proc. LICS 2003, pp. 208–207. IEEE (2003)Google Scholar
  8. 8.
    Gainer, P., Hustadt, U., Dixon, C.: CLProver++ (2015),
  9. 9.
    Goranko, V.: Coalition games and alternating temporal logics. In: Proc. TARK 2001, pp. 259–272. Morgan Kaufmann (2001)Google Scholar
  10. 10.
    Goranko, V., van Drimmelen, G.: Complete axiomatization and decidability of alternating-time temporal logic. Theor. Comput. Sci. 353(1), 93–117 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Goranko, V., Shkatov, D.: Tableau-based decision procedures for logics of strategic ability in multiagent systems. ACM Trans. Comput. Log. 11(1), 1–51 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Hansen, H.H.: Tableau games for coalition logic and alternating-time temporal logic – theory and implementation. Master’s thesis, University of Amsterdam, The Netherlands, October 2004Google Scholar
  13. 13.
    Horrocks, I., Hustadt, U., Sattler, U., Schmidt, R.A.: Computational modal logic. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic, pp. 181–245. Elsevier (2006)Google Scholar
  14. 14.
    Hustadt, U., Konev, B.: TRP++: A temporal resolution prover. In: Baaz, M., Makowsky, J., Voronkov, A. (eds.) Collegium Logicum, pp. 65–79. Kurt Gödel Society (2004)Google Scholar
  15. 15.
    Kovács, L., Voronkov, A.: First-order theorem proving and vampire. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 1–35. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  16. 16.
    Nalon, C., Zhang, L., Dixon, C., Hustadt, U.: A resolution-based calculus for coalition logic. J. Logic Comput. 24(4), 883–917 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Nalon, C., Zhang, L., Dixon, C., Hustadt, U.: A resolution prover for coalition logic. In: Proc. SR2014. Electron. Proc. Theor. Comput. Sci., vol. 146, pp. 65–73 (2014)Google Scholar
  18. 18.
    Pauly, M.: Logic for Social Software. Ph.D. thesis, University of Amsterdam, The Netherlands (2001)Google Scholar
  19. 19.
    Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. J. Symb. Comput. 2, 293–304 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Schulz, S.: Simple and efficient clause subsumption with feature vector indexing. In: Bonacina, M.P., Stickel, M.E. (eds.) Automated Reasoning and Mathematics. LNCS, vol. 7788, pp. 45–67. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  21. 21.
    Schulz, S.: System description: E 1.8. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) LPAR-19 2013. LNCS, vol. 8312, pp. 735–743. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  22. 22.
    Walther, D., van der Hoek, W., Wooldridge, M.: Alternating-time temporal logic with explicit strategies. In: Proc. TARK 2007, pp. 269–278. ACM (2007)Google Scholar
  23. 23.
    Walther, D., Lutz, C., Wolter, F., Wooldridge, M.: ATL satisfiability is indeed ExpTime-complete. J. Logic Comput. 16(6), 765–787 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Weidenbach, C., Dimova, D., Fietzke, A., Kumar, R., Suda, M., Wischnewski, P.: SPASS version 3.5. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol. 5663, pp. 140–145. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  25. 25.
    Zhang, L., Hustadt, U., Dixon, C.: A resolution calculus for branching-time temporal logic CTL. ACM Trans. Comput. Log. 15(1), 10:1–10:38 (2014)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Ullrich Hustadt
    • 1
  • Paul Gainer
    • 1
  • Clare Dixon
    • 1
  • Cláudia Nalon
    • 2
  • Lan Zhang
    • 3
  1. 1.Department of Computer ScienceUniversity of LiverpoolLiverpoolUK
  2. 2.Department of Computer ScienceUniversity of BrasíliaBrasíliaBrazil
  3. 3.Information SchoolCapital University of Economics and BusinessBeijingChina

Personalised recommendations