Finite Constraint Language (Constraint Satisfaction)

Definition

Finite Constraint Language (Constraint Satisfaction)

A constraint language $\Gamma$ is finite if it contains only finitely many relations:

$$\Gamma =\{R_1,\dots ,R_m\},m<\infty .$$

This restricts the number of available relation types, not the number of values in their common domain.