Referenzsemantik in der Partnermodellierung

How can we explain that an assertion on something perceived can be understood in the same manner by somebody who cannot perceive that scene? This problem bases the interest in computational linguistics in how listener modeling could possibly be harmonized with reference semantics. Mental images substituting real perception appear as a way out. The architecture of the listener model has to be adapted to the creation and use of such pictorial data structures. Furthermore, the relation between the latter and a verbal (i. e., propositional) representation must be understood. The resulting architecture of a listener model with reference semantics can be employed to solve communicational problems from three general classes in a better way, as is demonstrated by an example implementation.     

Construction and validation of the Gender Attitude Inventory,a structured inventory to assess multiple dimensions of gender attitudes

Three studies describe the development and initial validation of the Gender Attitude Inventory (GAI), a structured inventory that assesses attitudes toward the multiple objects that organize college students' thoughts and feelings about sex and gender. An intergroup relations perspective was used to specify the universe of gender-related targets and to construct a preliminary instrument. Factor analyses of the results of two sequential studies yielded a 109-item inventory with 14 content-specific attitude areas and three second-order factors. In Study 3 GAI scales were shown to have acceptable internal consistency and temporal stability, as well as convergent and discriminant validity. In terms of race/ethnicity, most respondents were white (ranging from 69% to 82% across the three studies).     

A simplification of a result by zellini on the maximal rank of symmetric three-way arrays

Zellini (1979, Theorem 3.1) has shown how to decompose an arbitrary symmetric matrix of ordern ×n as a linear combination of 1/2n(n+1) fixed rank one matrices, thus constructing an explicit tensor basis for the set of symmetricn ×n matrices. Zellini's decomposition is based on properties of persymmetric matrices. In the present paper, a simplified tensor basis is given, by showing that a symmetric matrix can also be decomposed in terms of 1/2n(n+1) fixed binary matrices of rank one. The decomposition implies that ann ×n ×p array consisting ofp symmetricn ×n slabs has maximal rank 1/2n(n+1). Likewise, an unconstrained INDSCAL (symmetric CANDECOMP/PARAFAC) decomposition of such an array will yield a perfect fit in 1/2n(n+1) dimensions. When the fitting only pertains to the off-diagonal elements of the symmetric matrices, as is the case in a version of PARAFAC where communalities are involved, the maximal number of dimensions can be further reduced to 1/2n(n–1). However, when the saliences in INDSCAL are constrained to be nonnegative, the tensor basis result does not apply. In fact, it is shown that in this case the number of dimensions needed can be as large asp, the number of matrices analyzed.     

Cut-free sequent and tableau systems for propositional Diodorean modal logics

We present sound, (weakly) complete and cut-free tableau systems for the propositional normal modal logicsS4.3, S4.3.1 andS4.14. When the modality is given a temporal interpretation, these logics respectively model time as a linear dense sequence of points; as a linear discrete sequence of points; and as a branching tree where each branch is a linear discrete sequence of points.Although cut-free, the last two systems do not possess the subformula property. But for any given finite set of formulaeX the superformulae involved are always bounded by a finite set of formulaeX* _L depending only onX and the logicL. Thus each system gives a nondeterministic decision procedure for the logic in question. The completeness proofs yield deterministic decision procedures for each logic because each proof is constructive.Each tableau system has a cut-free sequent analogue proving that Gentzen's cut-elimination theorem holds for these latter systems. The techniques are due to Hintikka and Rautenberg.Presented byDov M. Gabbay