... and their indefinite compo- nents have been conjoined together. In step 2 of the algorithm each of the disjuncts of DESC.INDEFINITE is checked for compatibility with DESC.DEFINITE, using the ... than the information contained in disjunctions. Thus a formula can be regarded as having a definite part, containing only unconditional conjuncts, and an indefinite part, containing a set of ... which represents the definite information of the re- sult. This step can be performed by existing unification al- gorithms for DGs. In the second step, the indefinite components of both de- scriptions...