When combining languages for symbolic constraints, one is typically faced with the problem of how to treat \mixed" constraints. The two main problems are (1) how to deene a combined solution structure over which these constraints are to be solved, and (2) how to combine the constraint solving methods for pure constraints into one for mixed constraints. The paper introduces the notion of a \free...
