CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Logic for coalitions with bounded resources
Authors
Natasha Alechina
Brian Logan
+3 more
Nguyen Hoang Nga
Hoang Nga Nguyen
Abdur Rakib
Publication date
1 December 2011
Publisher
'Oxford University Press (OUP)'
Doi
Cite
Abstract
Recent work on Alternating-Time Temporal Logic and Coalition Logic has allowed the expression of many interesting properties of coalitions and strategies. However, there is no natural way of expressing resource requirements in these logics. In this article, we present a Resource-Bounded Coalition Logic (RBCL) that has explicit representation of resource bounds in the language. We give a complete and sound axiomatization of RBCL, a procedure for deciding satisfiability of RBCL formulas, and a model-checking algorithm. © 2010 The Author
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
UWE Bristol Research Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:uwe-repository.worktribe.c...
Last time updated on 08/06/2020
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 05/06/2019