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 study consistent query answering over knowledge bases expressed byexistential rules. Specifically, we establish the data complexity of consistentquery answering and repair checking under tuple-deletion semantics for ageneral class of disjunctive existential rules and for several subclassesthereof (acyclic, linear, full, guarded, and sticky). In particular, weidentify several cases in which the above problems are tractable or evenfirst-order rewritable, and present new query rewriting techniques that can bethe basis for practical inconsistency-tolerant query answering systems.

Consistent Query Answering for Existential Rules under Tuple-Deletion Semantics