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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In a recent paper by Hellerstein [15], a tight relationship was conjecturedbetween the number of strata of a Datalog${}^\neg$ program and the number of"coordination stages" required for its distributed computation. Indeed, Amelootet al. [9] showed that a query can be computed by a coordination-freerelational transducer network iff it is monotone, thus answering in theaffirmative a variant of Hellerstein's CALM conjecture, based on a particulardefinition of coordination-free computation. In this paper, we present threeadditional models for declarative networking. In these variants, relationaltransducers have limited access to the way data is distributed. This variationallows transducer networks to compute more queries in a coordination-freemanner: e.g., a transducer can check whether a ground atom $A$ over the inputschema is in the "scope" of the local node, and then send either $A$ or $\negA$ to other nodes.  We show the surprising result that the query given by the well-foundedsemantics of the unstratifiable win-move program is coordination-free in someof the models we consider. We also show that the original transducer networkmodel [9] and our variants form a strict hierarchy of classes ofcoordination-free queries. Finally, we identify different syntactic fragmentsof Datalog${}^{\neg\neg}_{\forall}$, called semi-monotone programs, which canbe used as declarative network programming languages, whose distributedcomputation is guaranteed to be eventually consistent and coordination-free.

Win-Move is Coordination-Free (Sometimes)