No Cover Image

Journal article 378 views 26 downloads

Alternating-time temporal logic with resource bounds

Hoang Nguyen Orcid Logo, Natasha Alechina, Brian Logan, Abdur Rakib

Journal of Logic and Computation, Volume: 28, Issue: 4, Pages: 631 - 663

Swansea University Author: Hoang Nguyen Orcid Logo

  • 61988.pdf

    PDF | Version of Record

    This is an Open Access article distributed under the terms of the Creative Commons Attribution License

    Download (452.5KB)

Check full text

DOI (Published version): 10.1093/logcom/exv034

Abstract

Many problems in AI and multi-agent systems research are most naturally formulated in terms of the abilities of a coalition of agents. There exist several excellent logical tools for reasoning about coalitional ability. However, coalitional ability can be affected by the availability of resources, a...

Full description

Published in: Journal of Logic and Computation
ISSN: 0955-792X 1465-363X
Published: Oxford University Press (OUP) 2015
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa61988
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract: Many problems in AI and multi-agent systems research are most naturally formulated in terms of the abilities of a coalition of agents. There exist several excellent logical tools for reasoning about coalitional ability. However, coalitional ability can be affected by the availability of resources, and there is no straightforward way of reasoning about resource requirements in logics such as Coalition Logic (CL) and Alternating-time Temporal Logic (ATL). In this article, we describe a logic for reasoning about coalitional ability under resource constraints. We extend ATL with costs of actions and hence of strategies. We give a complete and sound axiomatization of the resulting logic, Resource-Bounded ATL (RB-ATL) and a model-checking algorithm for it.
College: Faculty of Science and Engineering
Issue: 4
Start Page: 631
End Page: 663