Proceedings of the Workshop Semantic Content Acquisition and Representation (SCAR) 2007

This is the proceedings of the Workshop on Semantic Content Acquisition and Representation, held in conjunction with NODALIDA 2007, on May 24 2007 in Tartu, Estonia.</p

Semantic constraints on case assignment in secondary adjectival predicates in russian

Adjectival secondary predicates can enter into two Case frames in Russian, the agreeing form and the Instrumental. The paper argues that these Case frames go together with two syntactic positions in the clause which are correlated with two different interpretations, the true depictive and the temporally restricted reading, respectively. The availability of the two readings depends on the houndedness of the secondary predicate. Only bounded predicates can enter into both Case frames and only partially non-bounded predicates can appear in the Instrumental. The paper therefore argues that the pertinent two-way SL/IL-contrast is to he replaced by a three-way distinction in terms of boundedness. The paper outlines the syntax and semantics of the true depictive and the temporally restricted interpretation and discusses how adjectival secondary predicates whose salient properties involve a cotemporary interpretation with the matrix predicate and a control relation of an individual argument, differ from temporal adjuncts as well as from non-finite clauses

Morphological focus marking in Gùrùntùm (West Chadic)

The paper presents an in-depth study of focus marking in Gùrùntùm, a West Ch adic language spoken in Bauchi Province of Northern Nigeria. Focus in Gùrùntùm is marked morphologically by means of a focus marker a, which typically precedes the focus constituent. Even though the morphological focus-marking system of Gùrùntùm allows for a lot of fine-grained distinctions in information structure (IS) in principle, the language is not entirely free of focus ambiguities that arise as the result of conflicting IS- and syntactic requirements that govern the placement of focus markers. We show that morphological focus marking with a applies across different types of focus, such as newinformation, contrastive, selective and corrective focus, and that a does not have a second function as a perfectivity marker, as is assumed in the literature. In contrast, we show at the end of the paper that a can also function as a foregrounding device at the level of discourse structure

Information-Theoretic Aspects of Control in a Bio-Hybrid Robot Device

Information processing in natural systems radically differs from current information technology. This difference is particularly apparent in the area of robotics, where both organisms and artificial devices face a similar challenge: the need to act in real time in a complex environment and to do so with computing resources severely limited by their size and power consumption. The formidable gap between artificial and natural systems in terms of information processing capability motivates research into the biological modes of information processing. Such undertakings, however, are hampered by the fact that nature directly exploits the manifold physical characteristics of its computing substrates, while available theoretical tools in general ignore the underlying implementation. Here we sketch the concept of bounded computability in an attempt towards reconciling the information-theoretic perspective with the need to take the material basis of information processing into account. We do so in the context of Physarum polycephalum as a naturally evolved information processor and the use of this organism as an integral component of a robot controller

Going higher in the First-order Quantifier Alternation Hierarchy on Words

We investigate the quantifier alternation hierarchy in first-order logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a regular language to the levels $\mathcal{B}\Sigma_2$ (boolean combination of formulas having only 1 alternation) and $\Sigma_3$ (formulas having only 2 alternations beginning with an existential block). Our proof works by considering a deeper problem, called separation, which, once solved for lower levels, allows us to solve membership for higher levels

Logic Meets Algebra: the Case of Regular Languages

The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical formalism required to define them. The algebraic point of view on automata is an essential complement of this classification: by providing alternative, algebraic characterizations for the classes, it often yields the only opportunity for the design of algorithms that decide expressibility in some logical fragment. We survey the existing results relating the expressibility of regular languages in logical fragments of MSO[S] with algebraic properties of their minimal automata. In particular, we show that many of the best known results in this area share the same underlying mechanics and rely on a very strong relation between logical substitutions and block-products of pseudovarieties of monoid. We also explain the impact of these connections on circuit complexity theory.Comment: 37 page

A Formalization of Polytime Functions

We present a deep embedding of Bellantoni and Cook's syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to the original characterization by Cobham that required a bound to be proved manually. Compared to the paper proof by Bellantoni and Cook, we have been careful in making our proof fully contructive so that we obtain more precise bounding polynomials and more efficient translations between the two characterizations. Another difference is that we consider functions on bitstrings instead of functions on positive integers. This latter change is motivated by the application of our formalization in the context of formal security proofs in cryptography. Based on our core formalization, we have started developing a library of polytime functions that can be reused to build more complex ones.Comment: 13 page

Papers on predicative constructions : Proceedings of the workshop on secundary predication, October 16-17, 2000, Berlin

This volume presents a collection of papers touching on various issues concerning the syntax and semantics of predicative constructions. A hot topic in the study of predicative copula constructions, with direct implications for the treatment of he (how many he's do we need?), and wider implications for the theories of predication, event-based semantics and aspect, is the nature and source of the situation argument. Closer examination of copula-less predications is becoming increasingly relevant to all these issues, as is clearly illustrated by the present collection