Multiple object semilinear motion planning

We present a method based on extended linear real quantifier elimination for multiple object semilinear motion planning, i.e. finding collision-free trajectories for several robots in a time dependent environment. For practical applicability the method is limited to polygonal objects and linear trajectories. It can, however, deal with situations involving even non-convex objects.     

A two-layer fuzzy pattern matching procedure for the evaluation of conditions involving vague quantifiers

In this note, we are interested in the evaluation of conditions of the form The value of attribute a for Q items of X is in F or more shortly Q items of X are F, where X is a set of items, Q denotes a possibly vague proportion (which may be linguistically expressed, e.g. most), F is a (possibly fuzzy) subset of the attribute domain of a. and where the available knowledge about the value a(x) of the attribute a for any item x may be imprecise or even vague. The evaluation is based on a fuzzy pattern matching procedure repeated two times. Such conditions may be encountered in queries addressed to an incomplete information data base or in the if-part of expert rules.     

Vector Space Semantics: A Model-Theoretic Analysis of Locative Prepositions

This paper introduces a compositional semantics of locativeprepositional phrases which is based on a vector space ontology.Model-theoretic properties of prepositions like monotonicity andconservativity are defined in this system in a straightforward way.These notions are shown to describe central inferences with spatialexpressions and to account for the grammaticality of prepositionmodification. Model-theoretic constraints on the set of possibleprepositions in natural language are specified, similar to the semanticuniversals of Generalized Quantifier Theory.     

Editorial

The Bezout-Inequality, an affine version (not including multiplicities) of the classical Bezout-Theorem is derived for applications in algebraic complexity theory. Upper bounds for the cardinality and number of sets definable by first order formulas over algebraically closed fields are given. This is used for fast quantifier elimination in algebraically closed fields.     

Impaired verbal comprehension of quantifiers in corticobasal syndrome.

Objective: Patients with Corticobasal Syndrome (CBS) have atrophy in posterior parietal cortex. This region of atrophy has been previously linked with quantifier comprehension difficulty, but previous studies employed visual stimuli, making it difficult to account for potentially confounding visuospatial deficits in CBS patients. The current study evaluated comprehension of generalized quantifiers using strictly verbal materials. Method: Non-aphasic CBS patients, a brain-damaged control group (consisting of patients with Alzheimer's disease and frontotemporal dementia), and age-matched healthy controls participated in this study. We assessed familiar temporal, spatial, and monetary domains of verbal knowledge comparatively. Judgment accuracy was only evaluated in statements for which patients demonstrated accurate factual knowledge about the target domain. Results: We found that patients with CBS are significantly impaired in their ability to evaluate quantifiers when compared to healthy seniors and a brain-damaged control group, even in this strictly verbal task. This impairment was seen in the vast majority of individual CBS patients. Conclusions: These findings offer additional evidence of quantifier impairment in CBS patients and emphasize that this impairment cannot be attributed to potential visuo spatial processing impairments in patients with parietal disease. (PsycINFO Database Record (c) 2011 APA, all rights reserved)     

Linguistic Applications of First Order Intuitionistic Linear Logic

In this paper we will discuss the first order multiplicative intuitionistic fragment of linear logic, MILL1, and its applications to linguistics. We give an embedding translation from formulas in the Lambek Calculus to formulas in MILL1 and show this translation is sound and complete. We then exploit the extra power of the first order fragment to give an account of a number of linguistic phenomena which have no satisfactory treatment in the Lambek Calculus. This revised version was published online in August 2006 with corrections to the Cover Date.     

Elliptical distribution-based weight-determining method for ordered weighted averaging operators

The ordered weighted averaging (OWA) operators play a crucial role in aggregating multiple criteria evaluations into an overall assessment supporting the decision makers’ choice. One key point steps is to determine the associated weights. In this paper, we first briefly review some main methods for determining the weights by using distribution functions. Then we propose a new approach for determining OWA weights by using the regular increasing monotone quantifier. Motivated by the idea of normal distribution-based method to determine the OWA weights, we develop a method based on elliptical distributions for determining the OWA weights, and some of its desirable properties have been investigated.     

一个约束逻辑的消解原理

为变量受约束理论约束的子句引入一种消解原理的约束逻辑方法。约束可看成量词限制,滤去那些约束理论的任何解释都可指定给带有这样的限定量词公式的变量值。本文提出了一种约束子句的消解原理,其中测试是否满足约束理论的约束取代了一致化。研究表明,如果约束子句集不满足约束理论当且仅当对约束理论的每一模型,能推出一约束空子句,而该空子句的约束在模型中是可满足的,那么约束消解是合理的和完备的