Descriptive complexity theory establishes a connection between the computational
complexity of algorithmic problems (the computational resources required to solve the …

The recent breakthrough paper by Calude et al. has given the first algorithm for solving
parity games in quasi-polynomial time, where previously the best algorithms were mildly …

In this survey, we review practical algorithms for graph-theoretic problems that are
expressible in monadic second-order logic. Monadic second-order (MSO) logic allows …

Abstract Probabilistic Answer Set Programming (PASP) combines rules, facts, and
independent probabilistic facts. We argue that a very useful modeling paradigm is obtained …

Stochastic games provide a versatile model for reactive systems that are affected by random
events. This dissertation advances the algorithmic theory of stochastic games to incorporate …

We give a logical characterization of the polynomial-time properties of graphs embeddable
in some surface. For every surface S, a property P of graphs embeddable in S is decidable …

We consider the sabotage modal logic SML which was suggested by van Benthem. SML is
the modal logic equipped with a 'transition-deleting'modality and hence a modal logic over …

Descriptive Complexity has been very successful in characterizing complexity classes of
decision problems in terms of the properties definable in some logics. However, descriptive …

We survey and discuss several solution concepts for infinite turn-based multiplayer games
with qualitative (ie, win-Iose) objectives of the players. These games generalise in a natural …

We examine the meaning and the complexity of probabilistic logic programs that consist of a
set of rules and a set of independent probabilistic facts (that is, programs based on Sato's …