{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T22:33:27Z","timestamp":1767998007685,"version":"3.49.0"},"reference-count":17,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2017,1,17]],"date-time":"2017-01-17T00:00:00Z","timestamp":1484611200000},"content-version":"vor","delay-in-days":585,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/E031226\/1"],"award-info":[{"award-number":["EP\/E031226\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6,7]]},"DOI":"10.1093\/logcom\/exv034","type":"journal-article","created":{"date-parts":[[2015,6,13]],"date-time":"2015-06-13T20:19:37Z","timestamp":1434226777000},"page":"631-663","source":"Crossref","is-referenced-by-count":8,"title":["Alternating-time temporal logic with resource bounds"],"prefix":"10.1093","volume":"28","author":[{"given":"Hoang Nga","family":"Nguyen","sequence":"first","affiliation":[{"name":"School of Computer Science, The University of Nottingham, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natasha","family":"Alechina","sequence":"additional","affiliation":[{"name":"School of Computer Science, The University of Nottingham, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Logan","sequence":"additional","affiliation":[{"name":"School of Computer Science, The University of Nottingham, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdur","family":"Rakib","sequence":"additional","affiliation":[{"name":"School of Computer Science, The University of Nottingham Malaysia Campus, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2015,6,12]]},"reference":[{"key":"key\n\t\t\t\t20180607120730_B1","first-page":"45","article-title":"Reasoning about coalitional games","volume":"173","author":"\u212bgotnes","year":"2009","journal-title":"Artificial Intelligence"},{"key":"key\n\t\t\t\t20180607120730_B2"},{"key":"key\n\t\t\t\t20180607120730_B3"},{"key":"key\n\t\t\t\t20180607120730_B4"},{"key":"key\n\t\t\t\t20180607120730_B5","first-page":"907","article-title":"Logic for coalitions with bounded resources","volume":"21","author":"Alechina","year":"2011","journal-title":"Journal of Logic and Computation"},{"key":"key\n\t\t\t\t20180607120730_B6","first-page":"672","article-title":"Alternating-time temporal logic","volume":"49","author":"Alur","year":"2002","journal-title":"Journal of the ACM"},{"key":"key\n\t\t\t\t20180607120730_B7"},{"key":"key\n\t\t\t\t20180607120730_B8"},{"key":"key\n\t\t\t\t20180607120730_B9","first-page":"244","article-title":"Automatic verification of finite-state concurrent systems using temporal logic specifications","volume":"8","author":"Clarke","year":"1986","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"key\n\t\t\t\t20180607120730_B10","first-page":"215","article-title":"On a logic for coalitional games with priced-resource agents","volume":"278","author":"Della Monica","year":"2011","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"key\n\t\t\t\t20180607120730_B11"},{"key":"key\n\t\t\t\t20180607120730_B12"},{"key":"key\n\t\t\t\t20180607120730_B13","first-page":"93","article-title":"Complete axiomatization and decidability of alternating-time temporal logic","volume":"353","author":"Goranko","year":"2006","journal-title":"Theoretical Computer Science"},{"key":"key\n\t\t\t\t20180607120730_B14"},{"key":"key\n\t\t\t\t20180607120730_B15"},{"key":"key\n\t\t\t\t20180607120730_B16","first-page":"149","article-title":"A modal logic for coalitional power in games","volume":"12","author":"Pauly","year":"2002","journal-title":"Journal of Logic and Computation"},{"key":"key\n\t\t\t\t20180607120730_B17","first-page":"835","article-title":"On the computational complexity of coalitional resource games","volume":"170","author":"Wooldridge","year":"2006","journal-title":"Artificial Intelligence"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/28\/4\/631\/25020788\/exv034.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T12:07:44Z","timestamp":1528373264000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/28\/4\/631\/2917812"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,12]]},"references-count":17,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,6,12]]},"published-print":{"date-parts":[[2018,6,7]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exv034","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,6]]},"published":{"date-parts":[[2015,6,12]]}}}