The regular languages with a neutral letter expressible in first-order l...
The Iltis project provides an interactive, web-based system for teaching...
Which amount of parallel resources is needed for updating a query result...
We introduce a model of register automata over infinite trees with extre...
In 2015, it was shown that reachability for arbitrary directed graphs ca...
Dynamic Complexity studies the maintainability of queries with logical
f...
Given a graph whose nodes may be coloured red, the parity of the number ...
Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable ...
Recently it was shown that the transitive closure of a directed graph ca...
Logic is a foundation for many modern areas of computer science. In
arti...