16.3 Solving Dominance Constraints Efficiently

In this section, we provide an implementation of the dominance constraint solver based on finite set constraints in Oz. Our solver behave efficiently on the examples from scope underspecification we have seen so far.

• 16.3.1 Sets of Nodes

• 16.3.2 Encoding Nodes as Records

• 16.3.3 Translation to Set Constraints

• 16.3.4 Treeness Condition

• 16.3.5 Encoding Dominance Constraints

• 16.3.6 The Solver as a Module

• 16.3.7 Solution Predicate

• 16.3.8 Graphical Output with DaVinci

• 16.3.9 Exercises

• 16.3.10 Complete Solver