cognitive linguistics gives the most inclusive, consistent description of how language is organized, used and learned to date. cognitive linguistics contains a great number of concepts that are useful to second language learners.  if-clauses in english, on the other hand, remain intriguing for foreign language learners to struggle with, due to their intrinsic intricacies. efl grammar books are ...

In this paper, a new approach for clauses learning is proposed. By traversing the implication graph separately from x and ¬x, we derive a new class of biasserting clauses that can lead to a more compact implication graph. These new kinds of bi-asserting clauses are much shorter and tend to induce more implications than the classical bi-asserting clauses. Experimental results show that exploitin...

We consider secrecy problems for cryptographic protocols modeled using Horn clauses and present general classes of Horn clauses which can be efficiently decided. Besides simplifying the methods for the class of flat and onevariable clauses introduced for modeling of protocols with single blind copying [7,25], we also generalize this class by considering k-variable clauses instead of one-variabl...

This paper reports on an exploratory study of cross-linguistic influence in the acquisition relative clauses by young Norwegian learners English, comparing L1 and L2 English material from TRAWL (Tracking Written Learner Language) Corpus to GiG (Growth Grammar) Corpus. Previous this domain have usually involved language pairs that very different relativization strategies. investigates whether si...

Abstract This paper investigates the ordering of connecting subordinate and coordinate clauses in Japanese-Thai translation to examine whether it is possible maintain information flow from source text. Japanese preposed were translated using both postposed Thai Preposed used widely when they provided: 1) listed information; 2) grounded for comprehending main clauses; 3) framework within which a...

Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such descriptions: the interpretation of atomic judgments through recursive definitions and an encoding of binding constructs via generic judgments. However, logics encompa...

Nominal rewriting is based on the observation that if we add support for alphaequivalence to first-order syntax using the nominal-set approach, then systems with binding, including higher-order features such as lambda-calculus beta-reduction, can be smoothly represented. Nominal rewriting maintains a strict distinction between variables of the objectlanguage (atoms) and of the meta-language (va...

The main contribution of the paper is a PTIME decision procedure for the satisfiability problem in a class of first-order Horn clauses. Our result is an extension of the tractable classes of Horn clauses of Basin & Ganzinger in several respects. For instance, our clauses may contain atomic formulas S ` t where ` is a predicate symbol and S is a finite set of terms instead of a term. ` is used t...