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

The logic of information flows (LIF) has recently been proposed as a generalframework in the field of knowledge representation. In this framework, tasks ofprocedural nature can still be modeled in a declarative, logic-based fashion.In this paper, we focus on the task of query processing under limited accesspatterns, a well-studied problem in the database literature. We show that LIFis well-suited for modeling this task. Toward this goal, we introduce a variantof LIF called "forward" LIF (FLIF), in a first-order setting. FLIF takes anovel graph-navigational approach; it is an XPath-like language thatnevertheless turns out to be equivalent to the "executable" fragment offirst-order logic defined by Nash and Lud\"ascher. One can also classify thevariables in FLIF expressions as inputs and outputs. Expressions where inputsand outputs are disjoint, referred to as io-disjoint FLIF expressions, allow aparticularly transparent translation into algebraic query plans that respectthe access limitations. Finally, we show that general FLIF expressions canalways be put into io-disjoint form.

Executable First-Order Queries in the Logic of Information Flows