3 citations · 3 across the 5 of their papers we have counts for
Showing 2022Show 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.LO2022
Unique Characterisability and Learnability of Temporal Instance Queries
Marie Fortin, Boris Konev, Vladislav Ryzhikov +3
We aim to determine which temporal instance queries can be uniquely characterised by a (polynomial-size) set of positive and negative temporal data examples. We start by considerin…