On the first-order rewritability of conjunctive queries over binary guarded existential rules
نویسندگان
چکیده
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.
منابع مشابه
Davide Ancona
della relazione invitata A framework for data, knowledge, and reasoning: Datalog± . . . . . . . . . . . . . 1 Georg Gottlob Fondamenti e risultati teorici A Diophantine representation of Wolstenholme’s pseudoprimality . . . . . . . 2 Luca Vallata, Eugenio Omodeo A natural sequent calculus for Lewis’ logic of counterfactuals . . . . . . . . . . . 13 Nicola Olivetti, Gian Luca Pozzato Infinite de...
متن کاملAcyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs
The complete picture of the complexity of conjunctive query answering under guarded disjunctive existential rules has been recently settled. However, in the case of (unions of) acyclic conjunctive queries ((U)ACQs) there are some fundamental questions which are still open. It is the precise aim of the present paper to close those questions, and to understand whether the acyclicity of the query ...
متن کاملAnswering Conjunctive Regular Path Queries over Guarded Existential Rules
In ontology-mediated query answering (OMQA), a database is enriched with an ontological layer and queries are answered by taking into account the information from both the data and ontology. Although most work on OMQA to date has focused on the fundamental conjunctive queries (CQs), navigational queries are gaining increasing attention. The simplest such queries are regular path queries (RPQs),...
متن کاملBounded Implication for Existential Rules (Extended Abstract)
The problem This paper deals with the property of boundedness in rule languages. Boundedness is an important notion that formalizes the fact that a rule set Σ can be unfolded into a finite set Σ of acyclic (i.e., non-recursive) rules such that Σ and Σ are equivalent on every database: it is therefore a crucial property for optimizing the processing of rules. Such a property has been extensively...
متن کاملTowards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules
The complete picture of the complexity of answering (unions of) conjunctive queries under the main guarded-based classes of disjunctive existential rules has been recently settled. It has been shown that the problem is very hard, namely 2ExpTime-complete, even for fixed sets of rules expressed in lightweight formalisms. This gives rise to the question whether its complexity can be reduced by re...
متن کامل