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/

Zendy Plus

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

Zendy Tools

Zendy Open

We introduce the class CXRPQ of conjunctive xregex path queries, which areobtained from conjunctive regular path queries (CRPQs) by adding stringvariables (also called backreferences) as found in practical implementations ofregular expressions. CXRPQs can be considered user-friendly, since they combinetwo concepts that are well-established in practice: pattern-based graph queriesand regular expressions with backreferences. Due to the string variables,CXRPQs can express inter-path dependencies, which are not expressible by CRPQs.The evaluation complexity of CXRPQs, if not further restricted, is PSPACE-hardin data-complexity. We identify three natural fragments with more acceptableevaluation complexity: their data-complexity is in NL, while their combinedcomplexity varies between EXPSPACE, PSPACE and NP. In terms of expressivepower, we compare the CXRPQ-fragments with CRPQs and unions of CRPQs, and withextended conjunctive regular path queries (ECRPQs) and unions of ECRPQs.

Conjunctive Regular Path Queries with String Variables