Handbook of theoretical computer science (vol. B)
Tractable multiagent planning for epistemic goals
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Alternating-Time Temporal Logic
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Reasoning about action and cooperation
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
A normal simulation of coalition logic and an epistemic extension
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Alternating-time temporal logic with explicit strategies
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
XPath, transitive closure logic, and nested tree walking automata
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reasoning about coalitional games
Artificial Intelligence
Complete Axiomatizations of MSO, FO(TC1) and FO(LFP1) on Finite Trees
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Organizing Coherent Coalitions
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Modal Logics for Preferences and Cooperation: Expressivity and Complexity
Knowledge Representation for Agents and Multi-Agent Systems
Coalition Description Logic with Individuals
Electronic Notes in Theoretical Computer Science (ENTCS)
Tractable model checking for fragments of higher-order coalition logic
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
A logic of argumentation for specification and verification of abstract argumentation frameworks
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
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.