The constraint language: $\cal {L}$

In this section I define $\cal {L}$ as the underlying constraint language of $\cal {R}$($\cal {L}$). The definition is based on [84] and [89]. This constraint language is used to describe structured objects called `feature structures'. Its semantics will be defined with respect to sets of `feature graphs', which are directed, connected, labelled graphs.