No Cover Image

Journal article 490 views 40 downloads

Alternating-time temporal logic with resource bounds

Hoang Nguyen Orcid Logo, Natasha Alechina, Brian Logan, Abdur Rakib

Journal of Logic and Computation, Volume: 28, Issue: 4, Pages: 631 - 663

Swansea University Author: Hoang Nguyen Orcid Logo

  • 61988.pdf

    PDF | Version of Record

    This is an Open Access article distributed under the terms of the Creative Commons Attribution License

    Download (452.5KB)

Check full text

DOI (Published version): 10.1093/logcom/exv034

Abstract

Many problems in AI and multi-agent systems research are most naturally formulated in terms of the abilities of a coalition of agents. There exist several excellent logical tools for reasoning about coalitional ability. However, coalitional ability can be affected by the availability of resources, a...

Full description

Published in: Journal of Logic and Computation
ISSN: 0955-792X 1465-363X
Published: Oxford University Press (OUP) 2015
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa61988
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2022-12-15T15:57:43Z
last_indexed 2023-01-13T19:23:08Z
id cronfa61988
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2022-12-15T16:01:08.3395599</datestamp><bib-version>v2</bib-version><id>61988</id><entry>2022-11-22</entry><title>Alternating-time temporal logic with resource bounds</title><swanseaauthors><author><sid>cb24d5c5080534dc5b5e3390f24dd422</sid><ORCID>0000-0003-0260-1697</ORCID><firstname>Hoang</firstname><surname>Nguyen</surname><name>Hoang Nguyen</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2022-11-22</date><deptcode>SCS</deptcode><abstract>Many problems in AI and multi-agent systems research are most naturally formulated in terms of the abilities of a coalition of agents. There exist several excellent logical tools for reasoning about coalitional ability. However, coalitional ability can be affected by the availability of resources, and there is no straightforward way of reasoning about resource requirements in logics such as Coalition Logic (CL) and Alternating-time Temporal Logic (ATL). In this article, we describe a logic for reasoning about coalitional ability under resource constraints. We extend ATL with costs of actions and hence of strategies. We give a complete and sound axiomatization of the resulting logic, Resource-Bounded ATL (RB-ATL) and a model-checking algorithm for it.</abstract><type>Journal Article</type><journal>Journal of Logic and Computation</journal><volume>28</volume><journalNumber>4</journalNumber><paginationStart>631</paginationStart><paginationEnd>663</paginationEnd><publisher>Oxford University Press (OUP)</publisher><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint>0955-792X</issnPrint><issnElectronic>1465-363X</issnElectronic><keywords/><publishedDay>12</publishedDay><publishedMonth>6</publishedMonth><publishedYear>2015</publishedYear><publishedDate>2015-06-12</publishedDate><doi>10.1093/logcom/exv034</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><funders/><projectreference/><lastEdited>2022-12-15T16:01:08.3395599</lastEdited><Created>2022-11-22T12:14:31.4040000</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Hoang</firstname><surname>Nguyen</surname><orcid>0000-0003-0260-1697</orcid><order>1</order></author><author><firstname>Natasha</firstname><surname>Alechina</surname><order>2</order></author><author><firstname>Brian</firstname><surname>Logan</surname><order>3</order></author><author><firstname>Abdur</firstname><surname>Rakib</surname><order>4</order></author></authors><documents><document><filename>61988__26091__acfcb6ea39de4fbc95ccb58fe618c8f4.pdf</filename><originalFilename>61988.pdf</originalFilename><uploaded>2022-12-15T15:58:07.5217467</uploaded><type>Output</type><contentLength>463365</contentLength><contentType>application/pdf</contentType><version>Version of Record</version><cronfaStatus>true</cronfaStatus><documentNotes>This is an Open Access article distributed under the terms of the Creative Commons Attribution License</documentNotes><copyrightCorrect>true</copyrightCorrect><language>eng</language><licence>http:// creativecommons.org/licenses/by/4.0/</licence></document></documents><OutputDurs/></rfc1807>
spelling 2022-12-15T16:01:08.3395599 v2 61988 2022-11-22 Alternating-time temporal logic with resource bounds cb24d5c5080534dc5b5e3390f24dd422 0000-0003-0260-1697 Hoang Nguyen Hoang Nguyen true false 2022-11-22 SCS Many problems in AI and multi-agent systems research are most naturally formulated in terms of the abilities of a coalition of agents. There exist several excellent logical tools for reasoning about coalitional ability. However, coalitional ability can be affected by the availability of resources, and there is no straightforward way of reasoning about resource requirements in logics such as Coalition Logic (CL) and Alternating-time Temporal Logic (ATL). In this article, we describe a logic for reasoning about coalitional ability under resource constraints. We extend ATL with costs of actions and hence of strategies. We give a complete and sound axiomatization of the resulting logic, Resource-Bounded ATL (RB-ATL) and a model-checking algorithm for it. Journal Article Journal of Logic and Computation 28 4 631 663 Oxford University Press (OUP) 0955-792X 1465-363X 12 6 2015 2015-06-12 10.1093/logcom/exv034 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2022-12-15T16:01:08.3395599 2022-11-22T12:14:31.4040000 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Hoang Nguyen 0000-0003-0260-1697 1 Natasha Alechina 2 Brian Logan 3 Abdur Rakib 4 61988__26091__acfcb6ea39de4fbc95ccb58fe618c8f4.pdf 61988.pdf 2022-12-15T15:58:07.5217467 Output 463365 application/pdf Version of Record true This is an Open Access article distributed under the terms of the Creative Commons Attribution License true eng http:// creativecommons.org/licenses/by/4.0/
title Alternating-time temporal logic with resource bounds
spellingShingle Alternating-time temporal logic with resource bounds
Hoang Nguyen
title_short Alternating-time temporal logic with resource bounds
title_full Alternating-time temporal logic with resource bounds
title_fullStr Alternating-time temporal logic with resource bounds
title_full_unstemmed Alternating-time temporal logic with resource bounds
title_sort Alternating-time temporal logic with resource bounds
author_id_str_mv cb24d5c5080534dc5b5e3390f24dd422
author_id_fullname_str_mv cb24d5c5080534dc5b5e3390f24dd422_***_Hoang Nguyen
author Hoang Nguyen
author2 Hoang Nguyen
Natasha Alechina
Brian Logan
Abdur Rakib
format Journal article
container_title Journal of Logic and Computation
container_volume 28
container_issue 4
container_start_page 631
publishDate 2015
institution Swansea University
issn 0955-792X
1465-363X
doi_str_mv 10.1093/logcom/exv034
publisher Oxford University Press (OUP)
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 1
active_str 0
description Many problems in AI and multi-agent systems research are most naturally formulated in terms of the abilities of a coalition of agents. There exist several excellent logical tools for reasoning about coalitional ability. However, coalitional ability can be affected by the availability of resources, and there is no straightforward way of reasoning about resource requirements in logics such as Coalition Logic (CL) and Alternating-time Temporal Logic (ATL). In this article, we describe a logic for reasoning about coalitional ability under resource constraints. We extend ATL with costs of actions and hence of strategies. We give a complete and sound axiomatization of the resulting logic, Resource-Bounded ATL (RB-ATL) and a model-checking algorithm for it.
published_date 2015-06-12T04:21:15Z
_version_ 1763754403802644480
score 11.037603

Similar Items