| C80-1051 | grammar is an ordinary part of a | Prolog program | . It defines a language as well |
| C02-1128 | auxiliary predicates : a pure | Prolog program | is equivalent to a DCG generating |
| C92-3140 | ( D , R ) The top call of the | Prolog program | produced by tim translator is |
| C92-3140 | well-formedness and the associated | Prolog program | . 2 . PARTIAL SYNTHESIS FOR GUIDED |
| C92-3140 | coroutining process and the associated | Prolog program | . 1 . INTRODUCTION The objective |
| C90-2055 | the lexicon are compiled into a | Prolog program | . Unification which is a basic |
| C92-3140 | PROGRAM The reversibility of certain | Prolog programs | is well known . So , in order |
| C92-3140 | , R ) . We have the following | Prolog program | : well formed ( S ) : - list |
| C92-3140 | Semantic rules I I I $ Translator $ | Prolog Program | : ~ entence ( D , R ) The top |
| C88-2136 | clauses are then translated into a | Prolog program | ( Figure 4 ) by the DCG translator |
| C92-3140 | composition . Finally , The core | Prolog program | ensuring that a sentence is well-formed |
| C04-1203 | earlier , question words have small | Prolog programs | corresponding to them . The answer |
| A83-1020 | implementation on EMAS allows large | PROLOG programs | to be run . The interpretive |
| C90-2060 | arguments in any given literal in a | PROLOG program | , as required by the inversion |
| C92-3140 | time of the ILLICO interface is a | Prolog program | . Lexical rules ( the lexicon |
| A00-1001 | ( BusLOG ) which is actually a | Prolog program | . This is done by a production |
| C86-1142 | defined in a CFG or a DCG into a | Prolog program | which functions as a word predictor |
| C88-2136 | necessary for bottom up parsing , this | Prolog program | can parse the input string with |
| C92-3140 | semantic rules are translated into a | Prolog program | according to the following schema |
| C86-1027 | well-formedness . ) The high ~ level | Prolog program | for this stage is given below |
