15.3 Finite Domains and Agreement Testing

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.

• 15.3.1 What's the Problem

• 15.3.2 Finite Domains as Abstract Data Structures

• 15.3.3 Finite Domain Functor

• 15.3.4 Domains of Atoms and Integers

• 15.3.5 Auxilary Arithmetic Functions

• 15.3.6 Products of Domains

• 15.3.7 Application to Agreement Checking

• 15.3.8 The Complete Package: domains.pkg