| W03-2123 | examples the TrindiKit relies on | Prolog unification | to obtain the correct results |
| E93-1010 | Furthermore , we used ordinary | Prolog unification | on such terms rather than the |
| J89-1003 | type checking was accomplished by | Prolog unification | of type trees , representing |
| J14-1005 | bidirectional grammar implemented as a | Prolog unification | grammar . Two examples are shown |
| P87-1003 | distinctness , is handled through | Prolog unification | . 18 ) The engine failed . Boundedness |
| E89-1013 | unification instead of the normal | Prolog unification | . In cu-Prolog , constraints |
| E89-1013 | -LSB- 12 , E which is the usual | Prolog unification | plus constrain transformation |
| E95-1028 | compiled to a form that allows normal | Prolog unification | to be used for category matching |
| J89-1003 | these transformations is mainly | Prolog unification | , but there is an augmentation |
| N03-3005 | unification is carried through internal | Prolog unification | , we encoded descriptions as |
| C90-3080 | the nonaal ( " destructive " ) | PROLOG unification | . Furthermore , QPATR provides |
| P90-1028 | presented here depend partly on the | Prolog unification | mechanism . 221 In order to initiate |
| E89-1024 | repeated variables and for which | PROLOG unification | provides an immediate test of |
| J90-1004 | would not be caught by the default | Prolog unification | algorithm . The base case , incorporating |
