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

Alechina, Natasha, Logan, Brian, Nguyen, Hoang Nga and Raimondi, Franco ORCID: https://orcid.org/0000-0002-9508-7713 (2014) Decidable model-checking for a resource logic with production of resources. ECAI 2014: 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, including prestigious applications of artificial intelligence (PAIS-2014) proceedings. In: 21st European Conference on Artificial Intelligence (ECAI-2014), 18-22 Aug 2014, Prague, Czech Republic. ISBN 9781614994183. ISSN 0922-6389 [Conference or Workshop Item] (doi:10.3233/978-1-61499-419-0-9)

Preview

PDF - Published version (with publisher's formatting) Available under License Creative Commons Attribution-NonCommercial 4.0. 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.

Actions (login required)

View Item

Statistics

DownloadsShow export options

Export as CSVXMLJSON

Activity Overview

6 month trend

54Downloads

6 month trend

396Hits

Additional statistics are available via IRStats2.