English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Several logics for expressing coalitional ability under resource bounds havebeen proposed and studied in the literature. Previous work has shown that ifonly consumption of resources is considered or the total amount of resourcesproduced or consumed on any path in the system is bounded, then themodel-checking problem for several standard logics, such as Resource-BoundedCoalition Logic (RB-CL) and Resource-Bounded Alternating-Time Temporal Logic(RB-ATL) is decidable. However, for coalition logics with unbounded resourceproduction and consumption, only some undecidability results are known. In thispaper, we show that the model-checking problem for RB-ATL with unboundedproduction and con- sumption of resources is decidable but EXPSPACE-hard. Wealso investigate some tractable cases and provide a detailed comparison to avariant of the resource logic RAL, together with new complexity results.

Technical Report: Model-Checking for Resource-Bounded ATL with Production and Consumption of Resources