Given a finite set of vectors over a finite totally ordered domain, we study the problem of computing a constraint in conjunctive normal form such that the set of solutions for the produced constraint is identical to the original set. We develop an efficient polynomial-time algorithm for the general case, followed by specific polynomial-time algorithms producing Horn, dual Horn, and bijunctive ...

We will aim for two things: (1) extend the empirical focus beyond English whatand howexclamatives, to include exclamatives common in other languages that are based on other wh-words; (2) counter the common assumption that exclamative semantics needs to involve some kind of scalar mechanism. Before we motivate and present our analysis, a word of caution is in order. To simplify matters for this ...

Given a finite set of vectors over a finite totally ordered domain, we study the problem of computing a constraint in conjunctive normal form such that the set of solutions for the produced constraint is identical to the original set. We develop an efficient polynomial-time algorithm for the general case, followed by specific polynomial-time algorithms producing Horn, dual Horn, and bijunctive ...

PP-Def is the problem which takes as input a relation r and a finite set Γ of relations on the same finite domain A, and asks whether r is definable by a conjunctive query over (A,Γ), i.e., by a formula of the form ∃~yφ(~x, ~y) where φ(~x, ~y) is a conjunction of atomic formulas built using the relations in Γ∪ {=}, and where the variables range over A. (Such formulas ∃~yφ(~x, ~y) are called pri...

2 Introduction Within the Principle and Parameters model of Universal Grammar (UG), double negatives, which I will henceforth refer to as Negative Concord (NC), have been argued to invoke a fundamental syntactic relation between the head and the specifier of a constituent. More precisely, it has been proposed that sentential negation universally projects a syntactic constituent conform to X' th...

Wh-exclamatives are usually considered degree constructions (e.g., Zanuttini & Portner 2003, Castroviejo 2008, Rett 2008). However, Japanese possesses what I call negative wh-expressives, which unrelated to degree. argue that unlike typical wh-exclamatives, wh-expressive sentences express a speaker’s attitude, and their compositional system is similar of an interrogative sentence except for...

The search for natural NP-intermediate problems is one of the holy grails within computational complexity. Ladner’s original diagonalization technique for generating NP-intermediate problems, blowing holes, has a serious shortcoming: it creates problems with a highly artificial structure by arbitrarily removing certain problem instances. In this article we limit this problem by generalizing Lad...

We consider methods for constructing NP-intermediate problems under the assumption that P 6= NP. We generalize Ladner’s original method for obtaining NP-intermediate problems by using parameters with various characteristics. In particular, this generalization allows us to obtain new insights concerning the complexity of CSP problems. We begin by fully characterizing the problems that admit NP-i...

This paper considers negative triggers (negative and negative quantifiers) and the interpretation of simple sentences containing more than one occurrence of those items (multiple negation sentences). In the most typical interpretations those sentences have more negative expressions than negations in their semantic representation. It is first shown that this compositionality problem remains in c...

in this research azeri negative sentences are scrutinized with a focus on negative concord item (nci) s. linguists such asenç (1998), kornfilt (1997) and progovac (2005) assert that turkish and azeri lack negative concord item but we put forward a claim in the contrary. our purpose is to prove the existence of nci in azeri turkic. this paper includes an introduction to negative markers and spec...