research
∙
01/27/2019
Subsumption of Weakly Well-Designed SPARQL Patterns is Undecidable
Weakly well-designed SPARQL patterns is a recent generalisation of well-...
share
research
∙
08/07/2018
The Window Validity Problem in Rule-Based Stream Reasoning
Rule-based temporal query languages provide the expressive power and fle...
research
∙
04/25/2018
Stratified Negation in Limit Datalog Programs
There has recently been an increasing interest in declarative data analy...
research
∙
11/10/2017
Stream Reasoning in Temporal Datalog
In recent years, there has been an increasing interest in extending trad...
research
∙
05/19/2017
The Bag Semantics of Ontology-Based Data Access
Ontology-based data access (OBDA) is a popular approach for integrating ...
research
∙
05/19/2017
Foundations of Declarative Data Analysis Using Limit Datalog Programs
Motivated by applications in declarative data analysis, we study Datalog...
research
∙
04/20/2015
Computing Horn Rewritings of Description Logics Ontologies
We study the problem of rewriting an ontology O1 expressed in a DL L1 in...
research
∙
11/19/2014
Ontology Module Extraction via Datalog Reasoning
Module extraction - the task of computing a (preferably small) fragment ...
research
∙
04/11/2014