3 Efficient Encodings of Finite Domains

Ambiguity (lexical ambiguity, attachment ambiguity) is a major source of combinatorial complexity. It is typically addressed by resorting to some form of disjunctive representation. In this chapter, we are going to explain how constraint programming using finite domains allows the compact representation and efficient processing of common types of disjunctive information.

Denys Duchier
Version 1.2.0 (20010221)