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.
翻译:本文是关于( 第一顺序) 质询在理论引导的答题中可重写。 我们旅程的起点是 FUS/ FES 的猜想, 指出如果理论是核心终止( FES), 并承认重写( BDD, FUS), 那么它就会被一致地捆绑。 我们显示, 对于一大批“ 本地” BDD 理论来说, 这个猜想是真实的。 然后我们问非本地的 BDD 理论是如何实际存在的, 我们发现一些我们认为是反直觉的现象 。