We consider the problem of weighted first-order model counting (WFOMC): given a first-
order sentence ϕ and domain size n∈ N, determine the weighted sum of models of ϕ over …

We investigate extensions of dependence logic with generalized quantifiers. We also
introduce and investigate the notion of a generalized atom. We define a system of semantics …

We introduce a novel decidable fragment of first-order logic. The fragment is one-
dimensional in the sense that quantification is limited to applications of blocks of existential …

Verification of properties expressed in the two-variable fragment of first-order logic FO2 has
been investigated in a number of contexts. The satisfiability problem for FO2 over arbitrary …

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 …

Uniform one-dimensional fragment UF_1^= is a formalism obtained from first-order logic by
limiting quantification to applications of blocks of existential (universal) quantifiers such that …

We define the adjacent fragment AF of first-order logic, obtained by restricting the sequences
of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes …

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 …

We study the finite satisfiability problem for the two-variable fragment of first-order logic
extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We …