32 In certain cases an extension of the constraint language with named disjunctions or contexted constraints ( Maxwell and Kaplan 1989 ; Eisele and Dorre 1990 ; Griffith 1996 ) can be used to circumvent constraint propagation .
an overview of disjunctive constraint satisfaction
John Maxwell Ronald Kaplan
The information common to all solutions to the interaction call is lifted up into the lexical entry and becomes available upon lexical lookup . 32 In certain cases an extension of the constraint language with named disjunctions or contexted constraints ( Maxwell and Kaplan 1989 ; Eisele and Dorre 1990 ; Griffith 1996 ) can be used to circumvent constraint propagation . Encoding the disjunctive possibilities for lexical rule application in this way , instead of with definite clause attachments , makes all relevant lexical information available at lexical lookup .
32 In certain cases an extension of the constraint language with named disjunctions or contexted constraints ( @@CITATION ; Eisele and Dorre 1990 ; Griffith 1996 ) can be used to circumvent constraint propagation .