Constant delay enumeration for conjunctive queries Page 1 Constant Delay Enumeration for
Conjunctive Queries — a Tutorial Christoph Berkholz Fabian Gerhardt Nicole Schweikardt …

As an essential prodecure to improve design quality in the construction industry, automated
rule checking (ARC) requires intelligent rule interpretation from regulatory texts and precise …

We analyse the power of graph neural networks (GNNs) in terms of Boolean circuit
complexity and descriptive complexity. We prove that the graph queries that can be …

We present a new approach to semantic code search based on equational reasoning, and
the Yogo tool implementing this approach. Our approach works by considering not only the …

We prove that graphs G, G'satisfy the same sentences of first-order logic with counting of
quantifier rank at most k if and only if they are homomorphism-indistinguishable over the …

Reasoning with quantifier expressions in natural language combines logical and
arithmetical features, transcending strict divides between qualitative and quantitative. Our …

Disjoint-paths logic, denoted FO+ DP, extends first-order logic (FO) with atomic predicates
dp k [(x 1, y 1),…,(xk, yk)], expressing the existence of internally vertex-disjoint paths …

We investigate the query evaluation problem for fixed queries over fully dynamic databases,
where tuples can be inserted or deleted. The task is to design a dynamic algorithm that …

As a vital stage of automated rule checking (ARC), rule interpretation of regulatory texts
requires considerable effort. However, interpreting regulatory clauses with implicit properties …

Tractability results for the model checking problem of logics yield powerful algorithmic meta
theorems of the form: Every computational problem expressible in a logic $ L $ can be …