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

Tools

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

Full text not available from this repository.

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)
RIS ID: https://nottingham-repository.worktribe.com/output/734063
Additional Information: Published in: ECAI 2014: 21st European Conference on Artificial Intelligence: 18-22 August 2014, Prague, Czech Republic: including Prestigious Applications of Intelligent Systems (PAIS 2014): proceedings. Amsterdam : IOS Press, 2014. ISBN: 9781614994183, pp. 9-14, doi: 10.3233/978-1-61499-419-0-9
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Alechina, Natasha
Date Deposited: 18 Sep 2015 13:48
Last Modified: 04 May 2020 16:52
URI: https://eprints.nottingham.ac.uk/id/eprint/30179

Actions (Archive Staff Only)

Edit View Edit View