* * * * * * * * * * * * * * * * * * * * * * * *
LINGUIST List logo Eastern Michigan University Wayne State University *
* People & Organizations * Jobs * Calls & Conferences * Publications * Language Resources * Text & Computer Tools * Teaching & Learning * Mailing Lists * Search *
* *
LINGUIST List 20.496

Tue Feb 17 2009

Confs: Semantics, Cognitive Science, Computational Ling/Netherlands

Editor for this issue: Stephanie Morse <morselinguistlist.org>


LINGUIST is pleased to announce the launch of an exciting new feature: Easy Abstracts! Easy Abs is a free abstract submission and review facility designed to help conference organizers and reviewers accept and process abstracts online. Just go to: http://www.linguistlist.org/confcustom, and begin your conference customization process today! With Easy Abstracts, submission and review will be as easy as 1-2-3!
Directory
        1.    Jakub Szymanik, Formal Semantics Meets Computation and Cognition


Message 1: Formal Semantics Meets Computation and Cognition
Date: 15-Feb-2009
From: Jakub Szymanik <j.szymanikuva.nl>
Subject: Formal Semantics Meets Computation and Cognition
E-mail this message to a friend

Formal Semantics Meets Computation and Cognition
Short Title: GLLC16

Date: 05-Mar-2009 - 06-Mar-2009
Location: Amsterdam, Netherlands
Contact: Jakub Szymanik
Contact Email: j.szymanikuva.nl
Meeting URL: http://staff.science.uva.nl/~szymanik/GLLC

Linguistic Field(s): Cognitive Science; Computational Linguistics;
Psycholinguistics; Semantics; Syntax

Meeting Description:

The workshop will help lay a groundwork for extending generalized quantifier
theory with computational and cognitive aspects. One major focus will be
computational complexity and its interplay with 'difficulty' as experienced by
subjects in cognitive science. To achieve this the workshop will combine
classical generalized quantifier theory (linguistics and mathematics) with newer
generalized quantifier theory (computation and cognition).

Quantifier expressions occur whenever we describe the world, and communicate
about it. Generalized quantifier theory is therefore one of the basic tools of
linguistics today, studying the possible meanings and the inferential power of
quantifier expressions by logical means. The classical version was developed in
the 1980s, at the interface of linguistics, mathematics and philosophy. Until
now, advances in ''classical'' generalized quantifier theory mainly focused on
definability questions and their applications to linguistics. This misses out on
computation, the third pillar of language use and logical activity. The workshop
will help lay a groundwork for extending generalized quantifier theory with
computational and cognitive aspects. One major focus will be computational
complexity and its interplay with ''difficulty'' as experienced by subjects in
cognitive science. To achieve this the workshop will combine classical
generalized quantifier theory (linguistics and mathematics) with newer
generalized quantifier theory (computation and cognition).

This 16th Game, Logic, Language and Computation (GLLC) Workshop will gather
logicians, computer scientists, linguists and cognitive scientists working on
quantifiers. They will share their expertise and try to find unifying themes and
methods. The workshop will be hosted by the Institute for Logic, Language and
Computation (ILLC) of the Universiteit van Amsterdam (UvA), on the occasion of
the PhD defense of Jakub Szymanik. It will be the 16th event in the workshop
series GLLC whose previous editions were very successful. The workshop is
sponsored by The Netherlands Organisation for Scientific Research and GLoRiClass.

The Workshop is organized by Johan van Benthem and Jakub Szymanik.

Speakers and titles:

Johan van Benthem ''Semantic Automata Revisited''
Robin Clark ''Collectivity, Distributivity and the Neuroscience of Linguistic
Decisions''
Paul Dekker ''Conceptual Complexity''
Jan van Eijck ''An Inference Engine with a Natural Language Interface''
Bart Geurts ''Scalar Quantifiers: Semantics, Acquisition, and Processing''
Marcin Mostowski ''Truth Definitions in Finite Models, Examples and Applications''
Jakub Szymanik ''Most of the NPs aren't NP''
Jouko Väänänen ''TBA''
Dag Westerståhl ''On Possessive Quantifiers''
Read more issues|LINGUIST home page|Top of issue




Please report any bad links or misclassified data

LINGUIST Homepage | Read LINGUIST | Contact us

NSF Logo

While the LINGUIST List makes every effort to ensure the linguistic relevance of sites listed
on its pages, it cannot vouch for their contents.