We consider the task of weighted first-order model counting (WFOMC) used for probabilistic
inference in the area of statistical relational learning. Given a formula φ, domain size n and a …

We consider the two-variable logic with counting quantifiers (C2) interpreted over finite
structures that contain two forests of ranked trees. This logic is strictly more expressive than …

It is shown that order-invariance of two-variable first-logic is decidable in the finite. This is an
immediate consequence of a decision procedure obtained for the finite satisfiability problem …

The uniform one-dimensional fragment of first-order logic was introduced a few years ago as
a generalization of the two-variable fragment of first-order logic to contexts involving …

We consider the extension of with quantifiers that state that the number of elements where a
formula holds should belong to a given ultimately periodic set. We show that both …

In this article we discuss fragments and extensions of two-variable logics motivated by
practical applications. We outline the decidability frontier, describing some of the techniques …

The uniform one-dimensional fragment of first-order logic was introduced a few years ago as
a generalization of the two-variable fragment to contexts involving relations of arity greater …

Decidable logics play a major role in knowledge representation, automated verification, and
database management. A common ground relating many of these logics is the two-variable …

The finite satisfiability problem for the two-variable fragment of first-order logic interpreted
over trees was recently shown to be ExpSpace-complete. We consider two extensions of this …

We consider an extension of two-variable, first-order logic with counting quantifiers and
arbitrarily many unary and binary predicates, in which one distinguished predicate is …