We consider the problem of generalising boolean formulas in conjunctive normal form by allowing non-boolean variables, where our goal is to maintain combinatorial properties. Requiring that a literal involves only a single variable, the most general form of literals is given by the well-known “signed literals”, however we will argue that only the most restricted form of generalised clause-sets,...

We study the problem of (eeciently) deleting such clauses from conjunctive normal forms (clause-sets) which can not contribute to any proof of unsatissability. For that purpose we introduce the notion of an autarky system, associated with a canonical normal form for every clause-set by deleting superruous clauses. Clause-sets where no clauses can be deleted are called lean, a natural generaliza...

The focus of this paper is the description of the surface syntax relations in the simple clause in Old French and the way they can be described in a dependency grammar. The declension system of Old French is not reliable enough to cope with the identification of the dependents of the main verb, but it remains true that related grammatical markers are still observable and obey rules that forbid ...

The Agreement between the United States of America, Mexican States, and Canada (USMCA) includes a sunset clause that states agreement shall terminate 16 years after date its entry into force, unless each Party expresses will to continue for another years. We apply John H. Jackson’s theory on power oriented rule diplomacy analyze clause. argue offer strong incentives diplomacy, this likely affec...

There are at least four senses in which one can talk about clause or sentence types in a language. One way is in terms of the distinction between declarative, interrogative, and imperative sentences. This distinction, really one of sentence type, is discussed elsewhere in this anthology, in Chapter I.5 on Speech Act Distinctions in Syntax. A second sense of clause type is represented by the dis...

In this paper, we study text classification algorithms by utilizing two concepts from Information Extraction discipline; dependency patterns and stemmer analysis. To the best of our knowledge, this is the first study to fully explore all possible dependency patterns during the formation of the solution vector in the Text Categorization problem. The benchmark of the classical approach in text cl...