Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Deciding boundedness of monadic sirups   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.

17
The categories of this paper are: q-fin
28
The categories of this paper are: alg-geom
5
The categories of this paper are: gr-qc
16
The categories of this paper are: stat
26
The categories of this paper are: bayes-an
13
The categories of this paper are: quant-ph
3
The categories of this paper are: physics
0
The categories of this paper are: hep-ph
14
The categories of this paper are: math-ph
2
The categories of this paper are: math
7
The categories of this paper are: hep-th
25
The categories of this paper are: patt-sol
18
The categories of this paper are: econ
9
The categories of this paper are: nlin
15
The categories of this paper are: nucl-ex
4
The categories of this paper are: cond-mat