Using the semantic dimension, the linguist can specify unification based flat semantic formulae in the sense of (Copestake et al., 2001) i.e., non recursive formulae describing first order formulae with lambda binders replaced by unification variables and where scope may be underspecified.
for instance, when combined with a class C containing a variable X named 6 arg 1 and a variable Y named index subject , the SubjArg1 linking constraint ensures that X and Y are identified.