This package provides a solver for dominance constraints.
Dominance constraints are tree descriptions that can talk about the ancestor relation in a tree. The prime application of dominance constraints is scope underspecification in natural language.
The present implementation is based on finite set constraints and disjunctive propagators. It was first implemented by Denys Duchier and then adapted by members of the Chorus-Project. Other solver for dominance constraints or the more general constraint language of lambda structures (CLLS) are available too (mogul:/chorus/clls-solver-ke).