The depth and timing of source text understanding during translation production is controversial in translation process research. Two theories seem to compete: defenders of the deep/alternating school assume that translators proceed in cycles of comprehension-transferproduction, while other translation scholars suggest that translations may be produced in a fashion of shallow and parallel compr...

This research discusses the Indonesian nomina majemuk translation from into English. The problems of this cover what are strategies and theories employed in English lelaki harimau novel. purposes to identify data obtained an novel entitled its version. uses a qualitative method random sampling technique. is based on Chesterman’s strategies. collected through documentation observation by reading...

The homograph resolution algorithm developed in the All-Union Centre for Translation of Scientific and Technical Literature and Documentation provides for analysis of English homographs without any ending or ending in -s. The forms ending in -ing and -ed, were involved only when checks run for those endings produced a reliable result and helped resolve homography or narrow it. What constitutes ...

This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the level of declarative reading, practical methodology and formal semantics. At the level of methodology, we put forward the thesis that in many (but not all) existing applications of ASP, an ASP program is used to encode de...

Answer set programming (ASP) is a paradigm for declarative problem solving where problems are first formalized as rule sets, i.e., answer-set programs, in a uniform way and then solved by computing answer sets for programs. The satisfiability modulo theories (SMT) framework follows a similar modelling philosophy but the syntax is based on extensions of propositional logic rather than rules. Qui...

We present a novel third-order theory W 1 1 of bounded arithmetic suitable for reasoning about PSPACE functions. This theory has the advantages of avoiding the smash function symbol and is otherwise much simpler than previous PSPACE theories. As an example we outline a proof in W 1 1 that from any configuration in the game of Hex, at least one player has a winning strategy. We then exhibit a tr...

Recent evolution of linguistic theories heavily rely upon the concept of constraint. Also, several authors have pointed out the similitude existing between the categories of feature-based theories and the notions of objects or frames. We show that a generalization of constraint programs called configuration programs can be applied to natural language parsing. We propose here a systematic transl...

A previous paper introduced the nonmono-tonic formalism of causal theories, along with a general method for representing action domains in it. Here we show that causal action theories provide a basis for eeective automated planning. To this end, we deene several properties plans may have, such as executability, determinism, and validity. We then identify a class of causal action theories for wh...

A careful analysis of the definition of knowledge translation highlights the importance of the judicious translation of research into practice and policy. There is, however, a considerable gap between research and practice. Closing the research-to-practice gap involves changing clinical practice, a complex and challenging endeavor. There is increasing recognition that efforts to change practice...