The elimination of redundant nondeterminism is based on Unfold/Fold transformation techniques ( Tamaki and Sato 1984 ) .29 The unfolding transformation is also referred to as partial execution , for example , by Pereira and Shieber ( 1987 ) .
prolog and natural language analysis csli lecture notes center for the study of language and information
Fernando Pereira Stuart Shieber
We thereby eliminate the redundant nondeterminism resulting from multiply defined frame predicates . The elimination of redundant nondeterminism is based on Unfold/Fold transformation techniques ( Tamaki and Sato 1984 ) .29 The unfolding transformation is also referred to as partial execution , for example , by Pereira and Shieber ( 1987 ) . Intuitively understood , unfolding comprises the evaluation of a particular literal in the body of a clause at compile-time .
The elimination of redundant nondeterminism is based on Unfold/Fold transformation techniques ( Tamaki and Sato 1984 ) .29 The unfolding transformation is also referred to as partial execution , for example , by @@CITATION .