Higher-Order Coalition Logic

  • Authors:
  • Guido Boella;Dov M. Gabbay;Valerio Genovese;Leendert van der Torre

  • Affiliations:
  • University of Torino, Italy, guido@di.unito.it;King's College, London, dov.gabbay@kcl.ac.uk;University of Luxembourg, Luxembourg, and University of Torino, Italy, valerio.genovese@uni.lu;University of Luxembourg, Luxembourg, leendert@vandertorre.com

  • Venue:
  • Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}ψ]φ expressing that the coalition of all agents satisfying ψ(x) can achieve a state in which φ holds. We use neighborhood semantics to model extensive games of perfect information with simultaneous actions and we provide a framework reasoning about agents in the same way as it is reasoning about their abilities. We illustrate higher-order coalition logic to represent and reason about coalition formation and cooperation, we show a more general and expressive way to quantify over coalitions than quantified coalition logic, we give an axiomatization and prove completeness.