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 consider the setting of ontological database access, where an Abox isgiven in form of a relational database D and where a Boolean conjunctive queryq has to be evaluated against D modulo a Tbox T formulated in DL-Lite or LinearDatalog+/-. It is well-known that (T,q) can be rewritten into an equivalentnonrecursive Datalog program P that can be directly evaluated over D. However,for Linear Datalog? or for DL-Lite versions that allow for role inclusion, therewriting methods described so far result in a nonrecursive Datalog program Pof size exponential in the joint size of T and q. This gives rise to theinteresting question of whether such a rewriting necessarily needs to be ofexponential size. In this paper we show that it is actually possible totranslate (T,q) into a polynomially sized equivalent nonrecursive Datalogprogram P.

Rewriting Ontological Queries into Small Nonrecursive Datalog Programs