research
∙
03/22/2023
Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study
The chase procedure is a fundamental algorithmic tool in databases that ...
share
research
∙
03/22/2023
The Complexity of Why-Provenance for Datalog Queries
Explaining why a database query result is obtained is an essential task ...
research
∙
06/24/2022
Generative Datalog with Stable Negation
Extending programming languages with stochastic behaviour such as probab...
research
∙
06/13/2022
Absolute Expressiveness of Subgraph Motif Centrality Measures
In graph-based applications, a common task is to pinpoint the most impor...
research
∙
04/22/2022
Uniform Operational Consistent Query Answering
Operational consistent query answering (CQA) is a recent framework for C...
research
∙
04/22/2022
Non-Uniformly Terminating Chase: Size and Complexity
The chase procedure, originally introduced for checking implication of d...
research
∙
12/17/2021
Counting Database Repairs Entailing a Query: The Case of Functional Dependencies
A key task in the context of consistent query answering is to count the ...
research
∙
11/18/2020
First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries
We focus on ontology-mediated queries (OMQs) based on (frontier-)guarded...
research
∙
03/17/2020
When is Ontology-Mediated Querying Efficient?
In ontology-mediated querying, description logic (DL) ontologies are use...
research
∙
12/28/2019
The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs
Ontology-mediated querying and querying in the presence of constraints a...
research
∙
01/12/2019
All-Instances Restricted Chase Termination: The Guarded Case
The chase procedure is a fundamental algorithmic tool in database theory...
research
∙
09/16/2018