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

In our paper [G{\l}uch, Marcinkowski, Ostropolski-Nalewaja, LICS ACM, 2018]we have solved an old problem stated in [Calvanese, De Giacomo, Lenzerini,Vardi, SPDS ACM, 2000] showing that query determinacy is undecidable forRegular Path Queries. Here a strong generalisation of this result is shown, and-- we think -- a very unexpected one. We prove that no regularity is needed:determinacy remains undecidable even for finite unions of conjunctive pathqueries.

The First Order Truth behind Undecidability of Regular Path Queries Determinacy