257 citations · 486 across the 35 of their papers we have counts for
3 papers · 1 filter
First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
Alessandro Artale, Roman Kontchakov, Alisa Kovtunova +3
Aiming at ontology-based data access to temporal data, we design two-dimensional temporal ontology and query languages by combining logics from the (extended) DL-Lite family with l…
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…
Deciding FO-definability of regular languages
Agi Kurucz, Vladislav Ryzhikov, Yury Savateev +1
We prove that, similarly to known PSpace-completeness of recognising FO(<)-definability of the language L(A) of a DFA A, deciding both FO(<,C)- and FO(<,MOD)-definability are PSpac…