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 present a unified approach to (both finite and unrestricted) worst-caseoptimal entailment of (unions of) conjunctive queries (U)CQs in the wide classof "locally-forward" description logics. The main technique that we employ is ageneralisation of Lutz's spoiler technique, originally developed for CQentailment in ALCHQ. Our result closes numerous gaps present in the literature,most notably implying ExpTime-completeness of (U)CQ-querying for any superlogicof ALC contained in ALCHbregQ, and, as we believe, is abstract enough to beemployed as a black-box in many new scenarios.

Lutz's Spoiler Technique Revisited: A Unified Approach to Worst-Case  Optimal Entailment of Unions of Conjunctive Queries in Locally-Forward  Description Logics