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

This paper aims at finding a subclass of DTDs that covers many of thereal-world DTDs while offering a polynomial-time complexity for deciding theXPath satisfiability problem. In our previous work, we proposed RW-DTDs, whichcover most of the real-world DTDs (26 out of 27 real-world DTDs and 1406 out of1407 DTD rules). However, under RW-DTDs, XPath satisfiability with only child,descendant-or-self, and sibling axes is tractable. In this paper, we proposeMRW-DTDs, which are slightly smaller than RW-DTDs but have tractability onXPath satisfiability with parent axes or qualifiers. MRW-DTDs are a propersuperclass of duplicate-free DTDs proposed by Montazerian et al., and cover 24out of the 27 real-world DTDs and 1403 out of the 1407 DTD rules. UnderMRW-DTDs, we show that XPath satisfiability problems with (1) child, parent,and sibling axes, and (2) child and sibling axes and qualifiers are bothtractable, which are known to be intractable under RW-DTDs.

XPath Satisfiability with Parent Axes or Qualifiers Is Tractable under Many of Real-World DTDs