... C1 and C2:C1 The graph of M is a tree of solid edges: (i) allhandles are labels i. e.,arg(M)=/0 and M con-tains no handle constraints, (ii) handles don’tproperly outscope themselve, and ... instance, an alternative analysis for theabove constraint is given in Fig. 8. The constraintadds an additional argument handle to and and places a dominance edge from this handle to “avail-able.” ... Constraints:Translation, Evaluation, and Analysis Ruth Fuchss,1Alexander Koller,1Joachim Niehren,2 and Stefan Thater11Dept. of Computational Linguistics, Saarland University, Saarbrücken, Germany∗2INRIA...