257 citations · 486 across the 35 of their papers we have counts for
5 papers · 1 filter
On Deciding the Data Complexity of Answering Linear Monadic Datalog Queries with LTL Operators(Extended Version)
Alessandro Artale, Anton Gnatenko, Vladislav Ryzhikov +1
Our concern is the data complexity of answering linear monadic datalog queries whose atoms in the rule bodies can be prefixed by operators of linear temporal logic LTL. We first ob…
A tetrachotomy of ontology-mediated queries with a covering axiom
Olga Gerasimova, Stanislav Kikot, Agi Kurucz +2
Our concern is the problem of efficiently determining the data complexity of answering queries mediated by description logic ontologies and constructing their optimal rewritings to…
Query Inseparability for ALC Ontologies
Elena Botoeva, Carsten Lutz, Vladislav Ryzhikov +2
We investigate the problem whether two ALC ontologies are indistinguishable (or inseparable) by means of queries in a given signature, which is fundamental for ontology engineering…
Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey
Elena Botoeva, Boris Konev, Carsten Lutz +3
The question whether an ontology can safely be replaced by another, possibly simpler, one is fundamental for many ontology engineering and maintenance tasks. It underpins, for exam…
Combining Spatial and Temporal Logics: Expressiveness vs. Complexity
D. Gabelaia, R. Kontchakov, A. Kurucz +2
In this paper, we construct and investigate a hierarchy of spatio-temporal formalisms that result from various combinations of propositional spatial and temporal logics such as the…