257 citations · 486 across the 35 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022★ 3 cited
Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic
Agi Kurucz, Vladislav Ryzhikov, Yury Savateev +1
Our concern is the problem of determining the data complexity of answering an ontology-mediated query (OMQ) formulated in linear temporal logic LTL over (Z,<) and deciding whether…
cs.CC2021★ 2 cited
Deciding boundedness of monadic sirups
Stanislav Kikot, Agi Kurucz, Vladimir Podolskii +1
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 s…