Hoang Nga Nguyen
Logic for coalitions with bounded resources
Nguyen, Hoang Nga; Alechina, Natasha; Logan, Brian; Nga, Nguyen Hoang; Rakib, Abdur
Authors
Natasha Alechina
Brian Logan
Nguyen Hoang Nga
Rakib Abdur Rakib.Abdur@uwe.ac.uk
Senior Lecturer in Mobile Security
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.
Citation
Nguyen, H. N., Alechina, N., Logan, B., Nga, N. H., & Rakib, A. (2011). Logic for coalitions with bounded resources. Journal of Logic and Computation, 21(6), 907-937. https://doi.org/10.1093/logcom/exq032
Journal Article Type | Article |
---|---|
Acceptance Date | Apr 15, 2010 |
Publication Date | Dec 1, 2011 |
Deposit Date | Jun 16, 2017 |
Publicly Available Date | Jun 16, 2017 |
Journal | Journal of Logic and Computation |
Print ISSN | 0955-792X |
Electronic ISSN | 1465-363X |
Publisher | Oxford University Press (OUP) |
Peer Reviewed | Peer Reviewed |
Volume | 21 |
Issue | 6 |
Pages | 907-937 |
DOI | https://doi.org/10.1093/logcom/exq032 |
Keywords | Coalition logic, resources |
Public URL | https://uwe-repository.worktribe.com/output/976116 |
Publisher URL | https://doi.org/10.1093/logcom/exq032 |
Related Public URLs | https://academic.oup.com/logcom/article-lookup/doi/10.1093/logcom/exq032 |
Additional Information | Additional Information : This is a pre-copyedited, author-produced version of an article accepted for publication in Journal of Logic and Computation following peer review. The version of record Alechina, N., Logan, B., Nga, N. H. and Rakib, A. (2010) Logic for coalitions with bounded resources. Journal of Logic and Computation, 21 (6). pp. 907-937. ISSN 0955-792X Available from: http://eprints.uwe.ac.uk/32076 is available online at: xxxxxxx https://doi.org/10.1093/logcom/exq032. |
Files
JLC'11.pdf
(306 Kb)
PDF
You might also like
Analysing the predictivity of features to characterise the search space
(2022)
Conference Proceeding
Memory-constrained context-aware reasoning
(2022)
Conference Proceeding
A probabilistic logic for resource-bounded multi-agent systems
(2019)
Presentation / Conference
Probabilistic resource-bounded alternating-time temporal logic
(2019)
Presentation / Conference
Model checking ontology-driven reasoning agents using strategy and abstraction
(2019)
Journal Article
Downloadable Citations
About UWE Bristol Research Repository
Administrator e-mail: repository@uwe.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search