Set Constraints In Computational Linguisti s

Set Constraints In Computational Linguisti s | Solving Tree Des riptions | Denys Du hier University of the Saarland du hierps.uni-sb.de June 30, 1999 Computational linguisti s has always been a priviledged appli ation domain for onstraint programming. While attention has traditionally fo used on fea- ture onstraints, set onstraints are now emerging as aording espe ially elegant and on ise de larative formulations that naturally obtain very eÆ ient opera- tional semanti s using onstraint propagation. In [DG99, DN99? we show how to reformulate, in terms of set onstraints, the problem of nding minimal models of tree des riptions expressed in an extended version of dominan e logi . In [Du 99? we provide an a ount of parsing, in the framework of dependen y grammar, using set onstraints, that is both a su in t de larative spe i ation of the problem as a CSP and a very eÆ ient implementation when regarded as a on urrent onstraint program. Both appli ations an be viewed as highly ombinatorial onguration problems and set onstraints allow elegant de larative spe i ations that are also eÆ ient onstraint programs for enumerating solutions. In this paper, we propose to des ribe our appli ation of set onstraints to the problem of nding solutions of tree des riptions.

• ied representation


• trees rather


• formedness onstraint


• semanti underspe


• onstraint


• rather than


• support pre eden