A Journey to the Frontiers of Query Rewritability

This paper is about (first order) query rewritability in the context of theory-mediated query answering. The starting point of our journey is the FUS/FES conjecture, saying that if a theory is core-terminating (FES) and admits query rewriting (BDD, FUS) then it is uniformly bounded. We show that this conjecture is true for a wide class of "local" BDD theories. Then we ask how non-local can a BDD theory actually be and we discover phenomena which we think are quite counter-intuitive.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/21/2023

A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join

We consider the dichotomy conjecture for consistent query answering unde...
research
03/01/2022

Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms

The Aaronson-Ambainis conjecture (Theory of Computing '14) says that eve...
research
04/13/2023

Influences of Fourier Completely Bounded Polynomials and Classical Simulation of Quantum Algorithms

We give a new presentation of the main result of Arunachalam, Briët and ...
research
12/24/2020

Global Context Networks

The Non-Local Network (NLNet) presents a pioneering approach for capturi...
research
03/24/2023

Roudneff's Conjecture in Dimension 4

J.-P. Roudneff conjectured in 1991 that every arrangement of n ≥ 2d+1≥ 5...
research
09/10/2022

Towards Diversity-tolerant RDF-stores

We propose a novel approach to designing RDF-stores with the goal of imp...

Please sign up or login with your details

Forgot password? Click here to reset