Showing cs.AIShow all
3 papers · 1 filter
cs.AI2025
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…
cs.AI2019
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…
cs.AI2018
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…