On the boundary of (un)decidability: decidable model-checking for a fragment of resource agent logic

The model-checking problem for Resource Agent Logic is known to be undecidable. We review existing (un)decidability results and identify a significant fragment of the logic for which model checking is decidable. We discuss aspects which makes model checking decidable and prove undecidability of two...

Full description

Bibliographic Details
Main Authors: Alechina, Natasha, Bulling, Nils, Logan, Brian, Nguyen, Hoang Nga
Format: Conference or Workshop Item
Published: 2015
Online Access:https://eprints.nottingham.ac.uk/30178/
_version_ 1848793936515039232
author Alechina, Natasha
Bulling, Nils
Logan, Brian
Nguyen, Hoang Nga
author_facet Alechina, Natasha
Bulling, Nils
Logan, Brian
Nguyen, Hoang Nga
author_sort Alechina, Natasha
building Nottingham Research Data Repository
collection Online Access
description The model-checking problem for Resource Agent Logic is known to be undecidable. We review existing (un)decidability results and identify a significant fragment of the logic for which model checking is decidable. We discuss aspects which makes model checking decidable and prove undecidability of two open fragments over a class of models in which agents always have a choice of doing nothing.
first_indexed 2025-11-14T19:08:13Z
format Conference or Workshop Item
id nottingham-30178
institution University of Nottingham Malaysia Campus
institution_category Local University
last_indexed 2025-11-14T19:08:13Z
publishDate 2015
recordtype eprints
repository_type Digital Repository
spelling nottingham-301782020-05-04T17:12:24Z https://eprints.nottingham.ac.uk/30178/ On the boundary of (un)decidability: decidable model-checking for a fragment of resource agent logic Alechina, Natasha Bulling, Nils Logan, Brian Nguyen, Hoang Nga The model-checking problem for Resource Agent Logic is known to be undecidable. We review existing (un)decidability results and identify a significant fragment of the logic for which model checking is decidable. We discuss aspects which makes model checking decidable and prove undecidability of two open fragments over a class of models in which agents always have a choice of doing nothing. 2015-07-25 Conference or Workshop Item PeerReviewed Alechina, Natasha, Bulling, Nils, Logan, Brian and Nguyen, Hoang Nga (2015) On the boundary of (un)decidability: decidable model-checking for a fragment of resource agent logic. In: International Joint Conference on Artificial Intelligence (IJCAI-15), 25-31 July 2015, Buenos Aires, Argentina. http://ijcai.org/papers15/Papers/IJCAI15-214.pdf
spellingShingle Alechina, Natasha
Bulling, Nils
Logan, Brian
Nguyen, Hoang Nga
On the boundary of (un)decidability: decidable model-checking for a fragment of resource agent logic
title On the boundary of (un)decidability: decidable model-checking for a fragment of resource agent logic
title_full On the boundary of (un)decidability: decidable model-checking for a fragment of resource agent logic
title_fullStr On the boundary of (un)decidability: decidable model-checking for a fragment of resource agent logic
title_full_unstemmed On the boundary of (un)decidability: decidable model-checking for a fragment of resource agent logic
title_short On the boundary of (un)decidability: decidable model-checking for a fragment of resource agent logic
title_sort on the boundary of (un)decidability: decidable model-checking for a fragment of resource agent logic
url https://eprints.nottingham.ac.uk/30178/
https://eprints.nottingham.ac.uk/30178/