No Cover Image

Conference Paper/Proceeding/Abstract 16561 views 37 downloads

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

Natasha Alechina, Brian Logan, Hoang Nguyen Orcid Logo, Franco Raimondi

ECAI 2014 : 21st European Conference on Artificial Intelligence

Swansea University Author: Hoang Nguyen Orcid Logo

  • 61993.pdf

    PDF | Version of Record

    © 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

    Download (259.44KB)

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 m...

Full description

Published in: ECAI 2014 : 21st European Conference on Artificial Intelligence
ISBN: 978-1-61499-418-3 978-1-61499-419-0
ISSN: 0922-6389 1879-8314
Published: IOS Press 2014
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa61993
Tags: Add Tag
No Tags, Be the first to tag this record!
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.
College: Faculty of Science and Engineering