Decidable model-checking for a resource logic with production of resources

Alechina, Natasha, Logan, Brian, Nguyen, Hoang Nga and Raimondi, Franco (2014) Decidable model-checking for a resource logic with production of resources. In: 21st European Conference on Artificial Intelligence (ECAI-2014), 18-22 Aug 2014, Prague, Czech Republic.

[img]
Preview
PDF - Published version (with publisher's formatting)
Available under License Creative Commons Attribution-NonCommercial.

Download (265kB) | Preview

Abstract

Several logics for expressing coalitional ability under resource bounds have been proposed and studied in the literature. Previous work has shown that if only consumption of resources is considered or the total amount of resources produced or consumed on any path in the system is bounded, then the model-checking problem for several standard logics, such as Resource-Bounded Coalition Logic (RB-CL) and Resource-Bounded Alternating-Time Temporal Logic (RB-ATL) is decidable. However, for coalition logics with unbounded resource production and consumption, only some undecidability results are known. In this paper, we show that the model-checking problem for RB-ATL with unbounded production and consumption of resources is decidable.

Item Type: Conference or Workshop Item (Paper)
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 15136
Notes on copyright: © 2014 The Authors and IOS Press. This article is published online with Open Access by IOS Press and distributed under the terms of the Creative Commons Attribution Non-Commercial License.
Useful Links:
Depositing User: Franco Raimondi
Date Deposited: 23 Apr 2015 08:35
Last Modified: 18 Apr 2019 17:26
URI: https://eprints.mdx.ac.uk/id/eprint/15136

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year