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

We consider the extension of two-variable guarded fragment logic with localPresburger quantifiers. These are quantifiers that can express properties suchas ``the number of incoming blue edges plus twice the number of outgoing rededges is at most three times the number of incoming green edges'' and capturesvarious description logics with counting, but without constant symbols. We showthat the satisfiability of this logic is EXP-complete. While the lower boundalready holds for the standard two-variable guarded fragment logic, the upperbound is established by a novel, yet simple deterministic graph theoretic basedalgorithm.

On two-variable guarded fragment logic with expressive local Presburger constraints