On the first-order rewritability of conjunctive queries over binary guarded existential rules

Cristina Civili, Riccardo Rosati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

We study conjunctive query answering and first-order rewritability of
conjunctive queries for binary guarded existential rules. In particular, we prove
that the problem of establishing whether a given set of binary guarded existential
rules is such that all conjunctive queries admit a first-order rewriting is decidable,
and present a technique for solving this problem. These results have a
important practical impact, since they make it possible to identify those sets of
binary guarded existential rules for which it is possible to answer every conjunctive
query through query rewriting and standard evaluation of a first-order query
(actually, a union of conjunctive queries) over a relational database system.
Original languageEnglish
Title of host publicationProceedings of the 30th Italian Conference on Computational Logic, Genova, Italy, July 1-3, 2015.
Pages25-30
Number of pages6
Publication statusPublished - Sept 2015

Fingerprint

Dive into the research topics of 'On the first-order rewritability of conjunctive queries over binary guarded existential rules'. Together they form a unique fingerprint.

Cite this