research
∙
03/11/2022
The Regular Languages of First-Order Logic with One Alternation
The regular languages with a neutral letter expressible in first-order l...
share
research
∙
05/12/2021
Iltis: Teaching Logic in the Web
The Iltis project provides an interactive, web-based system for teaching...
research
∙
01/21/2021
Work-sensitive Dynamic Complexity of Formal Languages
Which amount of parallel resources is needed for updating a query result...
research
∙
01/11/2021
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic
We introduce a model of register automata over infinite trees with extre...
research
∙
04/27/2020
Dynamic complexity of Reachability: How many changes can we handle?
In 2015, it was shown that reachability for arbitrary directed graphs ca...
research
∙
10/14/2019
Dynamic Complexity Meets Parameterised Algorithms
Dynamic Complexity studies the maintainability of queries with logical f...
research
∙
10/14/2019
Dynamic Complexity of Parity Exists Queries
Given a graph whose nodes may be coloured red, the parity of the number ...
research
∙
04/01/2019
A More General Theory of Static Approximations for Conjunctive Queries
Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable ...
research
∙
04/23/2018
Reachability and Distances under Multiple Changes
Recently it was shown that the transitive closure of a directed graph ca...
research
∙
04/04/2018
