一元糖浆的有界性判定
Deciding boundedness of monadic sirups
摘要：
我们发现，决定有界性（又名FO-可重写性）的一元单规则数据库程序（sirups）是2 Exp-hard，这符合自1988年以来已知的上限，并最终解决了一个长期存在的开放问题。我们得到这个结果作为一个副产品的一元“析取糖浆”-布尔合取查询q与一元和二元谓词介导的析取规则T（x）vF（x）<- A（x）-根据其评估的数据复杂性进行分类的尝试。除了建立，决定FO-rewritability的分离式糖浆与dag-shaped q也是2 Exp-hard，我们取得了实质性的进展，获得一个完整的FO/L-硬度二分法的分离式糖浆与ditree-shaped q。
英文摘要：
We show that deciding boundedness (aka FO-rewritability) of monadic single rule datalog programs (sirups) is 2Exp-hard, which matches the upper bound known since 1988 and finally settles a long-standing open problem. We obtain this result as a byproduct of an attempt to classify monadic `disjunctive sirups' -- Boolean conjunctive queries q with unary and binary predicates mediated by a disjunctive rule T(x)vF(x) <- A(x) -- according to the data complexity of their evaluation. Apart from establishing that deciding FO-rewritability of disjunctive sirups with a dag-shaped q is also 2Exp-hard, we make substantial progress towards obtaining a complete FO/L-hardness dichotomy of disjunctive sirups with ditree-shaped q.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
