We introduce an connectionist approach to uniica-tion using a local and a distributed representation. A Prolog-System using these uniication-strategies has been build. Prolog is a Logic Programming Language which utilizes uniication. We introduce a uncertainty measurement in uniication. This measurement is based on the structure-abilities of the chosen representations. The strategy using a loca...

The SRI team joined the subtask of Chinese-English Patent machine translation evaluation, and submitted the transla­ tion results using a combined output from two types of gram­ mars supported in SRlnterp, with two different word seg­ mentations. We investigated the effect of adding sparse fea­ tures, together with several optimization strategies. Also,for the PatentMT domain, we carried out pr...

The escape-time method was introduced to generate images of Julia and Mandelbrot sets, then applied to visualize attractors of iterated function systems. This paper extends it further to language-restricted iterated function systems (LRIFS's). They generalize the original deeni-tion of IFS's by providing means for restricting the sequences of applicable transformations. The resulting at-tractor...

This paper considers the treatment of undeened terms in the Z speciication language. We argue, on pragmatic grounds, that speciica-tion and proof are activities which place connicting requirements on the handling of undeenedness. We believe that the connict can be reconciled by encouraging speciications that are independent of the treatment of undeened terms and by gaining a better understandin...

We describe a deenitional approach to the combination of functional and logic programming based on the theory of Partial Induc-tive Deenitions. The described method produces programs directly exe-cutable in the deenitional programming language GCLA. We show both a basic calculus for functional logic program deenitions and discuss a reened version where the rules deenitional resolution, deenitio...

Requirements for tools which support the creation and the intelligible presentation of formal deductions are investigated They are contrasted with requirements which emphasize the interactive construc tion of correct proofs As an example the design and the implementation of a set of support tools for Deva is described Deva is a typed functional language and has been used in a number of case stu...

In this paper we propose a new method to express quantifica-tion and especially quantifier scope in French generation. Our approach is based on two points: the identification of the sentence components between which quantifier scope can indeed be expressed and a mechanism to reinforce the expression of quantifier scope. This approach is being integrated in a written French generator , called He...