C94-1022 by the more general notion of constraint solving . Constraint solvers may be embedded
C00-2087 problem is given by the paradigm of constraint solving . Parsing a phrase can be regarded
C90-2033 information of the verbs . By using the constraint solving techniques , efficiency can be
E95-1023 and terminating deterministic constraint solving procedure is given . Deterministic
C94-1075 involves a stack mechanism , and constraint solving results in a constraint . The
E95-1023 feature formalism ) itself . 5 Constraint Solving We are now ready to consider
E95-1023 constraints are in normal form if no constraint solving rules are applicable to it .
C94-1072 parser classes using different constraint solving mechanisms or different , parser
C04-1191 categories of unknown words using constraint solving over the properties of the known
C90-2033 an efficient way 4 . If passive constraint solving techniques are used , then how
E95-1023 where G ranges over g , 3g ) . The constraint solving rules given in figure 2 deal
E95-1023 in figure 1 and figure 2 . The constraint solving rules given in figure 1 deal
E91-1030 order logics . From Unification to Constraint Solving We will first show how to extend
C94-1075 etc. . By the way , remark that constraint solving can be hidden within the solver
C90-2033 executed effi - ciently ? Active constraint solving is equivalent to fold/unfold
C90-2033 Category , X , Y ) . If active constraint solving techniques are applied to the
E95-1023 following sections we show that our constraint solving rules are sound and every clash
E95-1023 any set of constraints . If a constraint solving rule transforms C8 to C ' 8 then
C94-1075 non-determinism . Third , the constraint solving , used by 1 ) oth eomi ) ilation
C90-2033 constraints are unsolved . As active constraint solving transforms constraints inde -
hide detail