Finite model theory is an area of mathematical logic that grew out of computer science
applications. The main sources of motivational examples for finite model theory are found in …

A basic issue in computer science is the complexity of problems. Computational complexity
measures how much time or memory is needed as a function of the input problem size …

It is a folk result in database theory that SQL cannot express recursive queries such as
reachability; in fact, a new construct was added to SQL3 to overcome this limitation …

Theoretical foundations for querying databases based on bags are studied in this paper. We
fully determine the strength of many polynomial-time bag operators relative to an ambient …

We study the runtime verification of hyperproperties, expressed in the temporal logic
HyperLTL, as a means to inspect a system with respect to security polices. Runtime monitors …

We observe that many important computational problems in NC1 share a simple self-
reducibility property. We then show that, for any problem A having this self-reducibility …

We study adding aggregate operators, such as summing up elements of a column of a
relation, to logics with counting mechanisms. The primary motivation comes from database …

This article gives a thorough overview of what is known about first-order logic with counting
quantifiers and with arithmetic predicates. As a main theorem we show that Presburger …

Abstract The Massively Parallel Computation (MPC) model serves as a common abstraction
of many modern large-scale data processing frameworks, and has been receiving …

We make progress in understanding the complexity of the graph reachability problem in the
context of unambiguous logarithmic space computation; a restricted form of nondeterminism …