A Journey to the Frontiers of Query Rewritability
Abstract
We consider (first-order) query rewritability in the context of theorymediated query answering. The starting point of our journey is the FUS/FES conjecture, which states that any theory that is a finite expansion set (FES) and admits query rewriting (BDD, FUS) must be uniformly bounded. We show that this conjecture holds for a large class of BDD theories, which we call "local". Upon investigating how "non-local" BDD theories can actually get, we discover unexpected phenomena that, we think, are at odds with prevailing intuitions about BDD theories.
Domains
Computer Science [cs]| Origin | Files produced by the author(s) |
|---|