有界度结构上的一阶查询计算
First-order query evaluation on structures of bounded degree
摘要：
我们考虑有界度结构上一阶查询的枚举问题。结果表明，这个问题是在Constant-Delaylin类。一个枚举问题属于Constant-Delaylin，如果对于一个大小为n的输入，它可以通过以下方式解决：-一个O（n）的预计算阶段建立一个索引结构，-随后是一个没有重复的枚举答案的阶段，并且两个连续输出之间有一个恒定的延迟。本文基于一阶逻辑的Gaifman局部性定理给出了这一结果的另一种证明。此外，我们得到的常数产生的总评估时间是输入公式的大小的三倍指数，匹配的最知名的评估算法的复杂性。
英文摘要：
We consider the enumeration problem of first-order queries over structures of bounded degree. It was shown that this problem is in the Constant-Delaylin class. An enumeration problem belongs to Constant-Delaylin if for an input of size n it can be solved by: - an O(n) precomputation phase building an index structure, - followed by a phase enumerating the answers with no repetition and a constant delay between two consecutive outputs. In this article we give a different proof of this result based on Gaifman's locality theorem for first-order logic. Moreover, the constants we obtain yield a total evaluation time that is triply exponential in the size of the input formula, matching the complexity of the best known evaluation algorithms.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
