Reference : Higher-Order Coalition Logic
Scientific congresses, symposiums and conference proceedings : Paper published in a journal
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/24943
Higher-Order Coalition Logic
English
Boella, Guido [> >]
Gabbay, Dov M. [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Genovese, Valerio [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
van der Torre, Leon mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2010
Bibliothèque(s) : revue de l'Association des bibliothécaires de France
Association des bibliothécaires de France
555–560
Yes
International
1632-9201
Paris
France
ECAI
2010
[en] Higher-Order Coalition
[en] 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.
Researchers ; Professionals ; Students ; Others
http://hdl.handle.net/10993/24943
10.3233/978-1-60750-606-5-555
http://ebooks.iospress.nl/publication/5835
The original publication is available at http://ebooks.iospress.nl

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
blank.pdfPublisher postprint10.85 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.