ion over y and s yields (17) einlaufen: λy .λs.Ez (MOVE(y) & BECOME(LOC(y,INT[z])))(s) The existentially bound variable z represents the denotation of das Stadion in (18) die Athleten liefen in das Stadion ein the athletes ran into the stadium [ein] The theory is silent about how this identification comes about, but this might come out straightforwardly: ein saturates an argument position and t...

In this paper we present a logic for dealing with preorders, where functions and predicates behave monotonically or antimonotonically in their arguments, and incorporating order-sorted relations into the syntax of the language. For this logic a ground tableau-based deduction method and a free variable extension version are proposed, proving their soundness and completeness. Finally, an implemen...

We present a calculus that integrates equality handling by superposition into a free variable tableau calculus. We prove completeness of this calculus by an adaptation of the model generation [1, 15] technique commonly used for completeness proofs of resolution calculi. The calculi and the completeness proof are compared to earlier results of Degtyarev and Voronkov [7].

Several issues concerning an analysis of large and sparse linear programming problems prior to solving them with an interior point based optimizer are addressed in this paper. Three types of presolve procedures are distinguished. Routines from the rst class repeatedly analyze an LP problem formulation: eliminate empty or singleton rows and columns, look for primal and dual forcing or dominated ...

This paper presents an analysis of Internally Headed Relative Clause (IHRC) construction in Japanese within the framework of Combinatory Categorial Grammar [Steedman 2000]. Shimoyama [1999] argues that when an IHRC appears within the scope of a universal quantifier, the interpretation of the IHRC exemplifies E-type anaphora and that the LF representation of the IHRC should have a variable bound...

Variable selection is popular in high-dimensional data analysis to identify the truly informative variables. Many variable selection methods have been developed under various model assumptions. Whereas success has been widely reported in literature, their performances largely depend on validity of the assumed models, such as the linear or additive models. This article introduces a model-free va...

We present algorithms for uniication and anti-uniication in the Calculus of Constructions, where occurrences of free variables (the variables subject to in-stantiation) are restricted to higher-order patterns, a notion investigated for the simply-typed-calculus by Miller. Most general uniiers and least common anti-instances are shown to exist and are unique up to a simple equivalence. The uniic...

Cats are nice. (: : :) because cats never overlap. Abstract In this paper we discuss two approaches to adverbial quantiication, the so-called`bound variable approach' and thèsituation-based approach', and we address the suggestion that has been made in the literature that the latter reduces to the former as soon as the underlying structure of situations has been characterized at the required le...

We discuss an adaptation of the technique of saturation up to redundancy, as introduced by Bachmair and Ganzinger [1], to tableau and sequent calculi for classical first-order logic. This technique can be used to easily show the completeness of optimized calculi that contain destructive rules e.g. for simplification, rewriting with equalities, etc., which is not easily done with a standard Hint...