Let\mathcal A be finite relational structure of finite type, and let CSP (\mathcal A) denote the
following decision problem: if\mathcal I is a given structure of the same type as\mathcal A, is …

In this paper we systematically investigate the connections between logics with a finite
number of variables, structures of bounded pathwidth, and linear Datalog Programs. We …

Many combinatorial search problems can be expressed as “constraint satisfaction problems”
using an appropriate “constraint language”, that is, a set of relations over some fixed finite …

Minimal clones—a minicourse Page 1 ■ irebra univers. 54 (2005) 73-89 «¿2-5240/05/010073
- 17 noi 10.1007/S00012-005-1924-2 | ©Birkhäuser Verlag, Basel, 2005 | Algebra Universalis …

We show that an idempotent variety has ad-dimensional cube term if and only if its free
algebra on two generators has no d-ary compatible cross. We employ Hall's Marriage …

We prove that every locally finite, congruence modular, minimal variety is minimal as a
quasivariety. We also construct all finite, strictly simple algebras generating a congruence …

We prove that every finite, simple, surjective algebra having no proper subalgebras is either
quasiprimal or affine or isomorphic to an algebra term equivalent to a matrix power of a …

We show that every idempotent simple algebra which has a skew congruence in a power
either has an absorbing element or is a subreduct of an affine module. We refine this result …

A clone is a set of composition closed functions on some set. A non-trivial fact is that on a
finite set every clone contains a minimal clone. This naturally leads to the problem of …

We consider the following classes of quantified formulas. Fix a set of basic relations called a
basis. Take conjunctions of these basic relations applied to variables and constants in …