In the generative literature, clause type effects have typically been modeled in one of two ways—“truncation” whereby embedded clauses are structurally reduced relative to root clauses, and intervention, by which non-root clauses have additional material that blocks movement available in root contexts. This paper analyzes two clause type effects in Basque— the possibility of verb-initial word o...

Many aspects of the relation of different decision tree and DNF complexity measures of Boolean functions have been more or less substantially explored. This paper adds a new detail to the picture: we prove that DNF tautologies with terms conflicting in one or two variables pairwise possess a tree-like structure. An equivalent reformulation of this result (adopting the terminology of [7, 8, 9]) ...

Based on the definition of the relative clause from Song (2001), this paper examines the relative clause in the Hui’an dialect from four parameters: (a) the relativization marker used; (b) the position of the head noun relative to the restricting clause; (c) the role and encoding of the head noun in the restricting clause; and (d) the role and encoding of the head noun in the main clause. The H...

This is the report-version of a mini-series of two articles [60, 61] on the foundations of conjunctive normal forms with non-boolean variables. These two parts are here bundled in one report, each part yielding a chapter. Part I We consider the problem of generalising boolean formulas in conjunctive normal form by allowing non-boolean variables, with the goal of maintaining combinatorial proper...

Chinese event descriptive clause splitting is the task of splitting a complex Chinese sentence into several clauses. In this paper, we present a discriminative approach for Chinese event descriptive clause splitting task. By formulating the Chinese clause splitting task as a sequence labeling problem, we apply the structured SVMs model to Chinese clause splitting. Compared with other two baseli...

Model counting is an important problem in artificial intelligence and is applied in several areas of information science. Extension rule is a method which could be used to count models. But it’s not appropriate when clause length is short or clause number is huge. After studying extension rule, we found that the satisfiability problem could be solved by hitting set algorithms. And the models co...

While clause resolution is central to logic programming, practical eeorts to optimize resolution have largely concerned eecient clause indexing. One recent exception is Uniication Factoring 5], which optimizes backtracking through clause heads. Here we consider the problem of optimizing clause resolution in a more general setting than Uniication Factoring. One fundamental change is to use mode ...

While clause resolution is central to logic programming, practical eeorts to optimize resolution have largely concerned eecient clause indexing. One recent exception is Uniication Factoring 5], which optimizes backtracking through clause heads. Here we consider the problem of optimizing clause resolution in a more general setting than Uniication Factoring. One fundamental change is to use mode ...