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

Query answering is an important problem in AI, database and knowledgerepresentation. In this paper, we develop saturation-based Boolean conjunctivequery answering and rewriting procedures for the guarded, the loosely guardedand the clique-guarded fragments. Our query answering procedure improvesexisting resolution-based decision procedures for the guarded and the looselyguarded fragments and this procedure solves Boolean conjunctive query answeringproblems for the guarded, the loosely guarded and the clique-guarded fragments.Based on this query answering procedure, we also introduce a novelsaturation-based query rewriting procedure for these guarded fragments. Unlikemainstream query answering and rewriting methods, our procedures derive acompact and reusable saturation, namely a closure of formulas, to handle thechallenge of querying for distributed datasets. This paper lays the theoreticalfoundations for the first automated deduction decision procedures for Booleanconjunctive query answering and the first saturation-based Boolean conjunctivequery rewriting in the guarded, the loosely guarded and the clique-guardedfragments.

Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments