Large and open multiparallel corpora are a valuable resource for contrastive corpus linguists if the data is annotated and stored in a way that allows precise and flexible ad hoc searches. A linguistic query language should also support computational linguists in automated multilingual data mining. We review a broad range of approaches for linguistic query and reporting languages according to u...

In this paper, we investigate Duplicator-Spoiler Games, a method of comparing the properties of structures. These games are especially significant because they have deep connections to logical expressibility. Traditionally, Duplicator-Spoiler Games were played with a preset, finite number of turns. We do not examine such situations but instead consider games of arbitrary lengths, which we repre...

A major concern when reasoning about time in artificial intelligence problems is computational tractability. We present a method for applying temporal reasoners to large scale dynamic problems. We present a partitioning of the temporal database and means of constraint propagation that presents an efficient approach for producing tractable systems. Our goal is not to enhance underlying reasoners...

The notion of logical reducibilities is derived from the idea of interpretations between theories. It was used by Lovász and Gács [LG77] and Immerman [Imm87] to give complete problems for certain complexity classes and hence establish new connections between logical definability and computational complexity. However, the notion is also interesting in a purely logical context. For example, it is...

Calculations can naturally be described as graphs in which vertices represent computation and edges re ̄ect data dependencies. By partitioning the vertices of a graph, the calculation can be divided among processors of a parallel computer. However, the standard methodology for graph partitioning minimizes the wrong metric and lacks expressibility. We survey several recently proposed alternatives...

Axiomatization of Gödel-Dummett predicate logics S2G, S3G, and PG, where PG is the weakest logic in which all prenex operations are sound, and the relationships of these logics to logics known from the literature are discussed. Examples of non-prenexable formulas are given for those logics where some prenex operation is not available. Inter-expressibility of quantifiers is explored for each of ...

Given a finite set S and a function f : Sn → Sm, we consider the problem of making a data structure which maintains a value of x ∈ Sn and allows us to efficiently change an arbitrary coordinate of x and efficiently evaluate fi(x) for arbitrary i. We both examine the problem for specific choices of f and relate the possibility of an efficient solution to general properties of f : expressibility ...