A nice application of finite domain constraints in computational linguistics concernce agreement checking. This can be done by describing Cartesian products of finite sets by finite domain constraints.
domains.pkg