LINGUIST List 2.30

Monday, 04 Feb 1991

FYI: Summer School in Language, Logic and Information

Editor for this issue: <>


Directory

  1. "3rd ESS in LLI", summerschool announcement

Message 1: summerschool announcement

Date: Tue, 29 Jan 91 11:16:16 +0100
From: "3rd ESS in LLI" <ESScoli.uni-sb.de>
Subject: summerschool announcement
The Third European Summer School
in Language, Logic and Information

Universitaet des Saarlandes
Saarbruecken
August 12-23, 1991

I. General Information 

The Third European Summer School in Language, Logic and Information 
will be held at the Universitaet des Saarlandes, Saarbruecken, from 
August 12 to 23. The school is organised by the European Foundation
for Logic, Language and Information. Financial support has been
granted by the Commission of the European Communities in the
framework of the ERASMUS Programme.Additional financial assistance
will be obtained through the University of Saarbruecken and several
national organisations and industrial sponsors.A meeting of the
European Foundation for Logic, Language and Information will be
held in conjunction with the Summer School. The first two Summer
Schools took place at the Rijksuniversiteit Groningen, the
Netherlands, in 1989 and at the Katholieke Universiteit Leuven,
Belgium, in1990. Both events were very successful.

The main focus of the Summer School is the interface between
linguistics, logic and computation, where this interface is the result
of research into the logical, computational and cognitive
foundations of natural language. This year's courses are divided into
four areas: Computational Linguistics, Linguistics and Cognition,
Logic and Computation, and Semantics. They cover a variety of topics
from fields of study such as theoretical and computational
linguistics, logic and philosophy of language.

The School will contain three closely related but distinct components. 
First, there is a fully integrated program of taught courses, at both 
introductory and advanced levels. Introductory courses are designed to
familiarise students with new fields and do not presuppose any
background knowledge, while advanced courses are designed to allow
students, staff and researchers to acquire more specialised expertise
in areas they are already familiar with. Second, there is a series of
workshops which provide a forum for in-depth discussion of topics
which are at the forefront of current research. And third, there will
be a series of invited lectures by well-known experts in the field. A
list of the courses and workshops offered can be found in the 
enclosed program.


II. Registration

1. Fees

Students: DM 185,-.
Visiting scholars: DM 350,-
Industrial participants: DM 750,-

(Students are kindly requested to enclose proof of their student
status together with the registration form.)

The fee covers your courses and includes a reception, a farewell
party, and the information brochure. It does not cover course
material, meals or accommodations.

2. Accommodation

We are able to provide a number of rooms in the University+s student 
halls. The price for a single room is DM 260,- for the whole period 
(August 11 to 24). A smaller number of better equipped rooms with two
beds will be available for the same price per person as single 
rooms. If you do not object to sharing a room, please check the 
appropriate box on the registration form. 

Since it is very difficult in Germany to reserve rooms in student
halls we cannot guarantee student accommodation for everyone, even if 
registered before April, 15th. We will do our best! However, first 
priority will be given to bona fide students. When you make your 
decision please take into account that local hotel rates are very 
reasonable. (DM 50.- and up per night for a single room.) 

If you wish to reserve a room in the student halls, please include in 
addition DM 100,- with your fee payment. This deposit will be applied 
to the room bill. We will contact you as soon as posible if there 
should be no capacity left and try to offer you an alternative (cheap 
hotel, youth hostel). 

If you wish to reserve a room in a hotel, please let us know on the 
registration form. In this case, we will send you a list of hotels 
together with the final programm.


3. Registration

To register, please complete the attached form and return it together 
with the appropriate registration fee (Eurocheque or receipt of bank 
transfer) to

Universitaet des Saarlandes
Computerlinguistik
(Summer School in LLI '91)
W-6600 Saarbruecken 11
Germany

Account for bank transfers:

Saar Bank, Saarbruecken, Germany 
Acct.-No.: 0108-2222, 
routing code: 591 900 00
purpose: summer school. 

Upon receipt of your payment and registration form we will send you a 
brochure with more detailed information about the courses and 
workshops, a time table, and a form on which you may specify the 
courses and workshops you would like to attend.

For further details please contact:

Hans Uszkoreit / Maike Paritong
Universitaet des Saarlandes
Computerlinguistik
(Summer School in LLI '91)
W-6600 Saarbruecken 11
Germany

E-mail: esscoli.uni-sb.de
Telefax: +49(681) 302-4351 
Phone: +49(681) 302-3714/4115 


III. Programme survey 

INTRODUCTORY COURSES

Introduction to lambda calculus
Erik Barendsen
Department of Computer Science, University of Nijmegen
Brief introduction to untyped and typed lambda calculus.

Languages and logics, pure and applied
Patrick Blackburn
Centre for Cognitive Science, Edinburgh University 
At the formal level, this course is an introduction to three
fundamental types of language which recur in both the formal study of
the semantics of natural languages, and as knowledge representation 
formalisms in Artificial Intelligence: propositional languages, first
order languages, and second order languages. 

Introduction to domains
Bob Carpenter
Dept. of Philosophy, Carnegie Mellon University, Pittsburgh
Domains are used in computer science for specifying denotational
(model theoretic) semantics for programming languages. Starting from
partial orders, this course will focus on the mathematical theory of
domains. 

Situation semantics
Robin Cooper
Center for Cognitive Science, Edinburgh University
Situation Theoretic Grammar
This course is an introduction to a situation theortic approach to grammar, 
a theory which is oriented towards giving an account of how we process
partial information and comprehending all aspects of linguistic activity 
(including syntax and semantics) in a single general theory of situations.
The theory is illustrated by grammar fragments which are also developed
in Prolog.

Robert Dale, Judy Delin
Centre for Cognitive Science, Edinburgh University
This course looks at theories of how discourse structure might be
approached.

Quantification in natural language
Jan van Eijck 
Centre for Mathematics and Computer Science, Amsterdam
(1) The theory of binary quantifiers; (2) Quantifiers of higher types;
(3) Quantifiers in partial settings; (4) Dynamic interpretation of
descriptions and quantifiers, (5) Quantifier scope and Natural
Language syntax.

Belief revision
Andre Fuhrmann
FG Philosophie, Universitaet Konstanz
Hans Rott
FG Philosophie, Universitaet Konstanz
This course offers both a gentle introduction and a guide to current
research in the logical aspects of belief change (belief revision,
theory change).

Computational phonology
Dafydd Gibbon
Fakulaet fuer Linguistik und Literaturwissenschaft, Universitaet
Bielefeld 
Following on an overview of currently central problems in phonology
and speech technology, a selection of directions in computational
phonology will be given. The final section of the course will be 
implementation oriented.

Auto-segmental phonology
Harry van der Hulst
Department of General Linguistics, University of Leiden
This course will present a particular approach toward the
representation of phonological structure, focussing on segmental
structure and processes. 

Computational morphology
Lauri Karttunen
Xerox Palo Alto Research Center, Stanford and Stanford University
The course reviews the relationship between old-fashioned rewrite
rules, constraints, transducers, and the linguistic phenomena they
describe. 

Introduction to Prolog for linguistics
Martin Kay
Xerox Palo Alto Research Center, Stanford and Stanford University
An introduction to programming in Prolog with special attention to its
use in computational linguistics. Example problems will be taken from
phonology and orthography, morphology, syntax, and translation.

Knowledge representation for natural language processing
Bernhard Nebel
Deutsches Forschungszentrum fuer Kuenstliche Intelligenz, Saarbruecken
Semantic Networks & Frames, Terminological Logics and Feature Logics,
Nonmonotonic Reasoning and Belief Revision, Time & Action.

Inexact reasoning
J.B. Paris
Dept. Mathematics, Manchester University
The course will outline some of the assumptions underlying currently
popular modes of inexact reasoning, their justifications and
consequences.

Discourse Representation Theory: nominal anaphora and tenses
Uwe Reyle
Institut fuer maschinelle Sprachverarbeitung, Universitaet Stuttgart
Introduction to the treatment of nominal and temporal anaphora in
Discourse Representation Theory.

The pinciples and parameters approach to grammar
Henk van Riemsdijk
Dept. of Language and Literature, Tilburg University
The main focus will be on why it is interesting to conceive of the
grammar as a set of interacting modules each consisting of a few
simple and universal principles which may be parametrized for 
language specific properties. The importance of understanding and,
hopefully, explaining linguistic phenomena will take precedence over
formal aspects of the theory.

Proof theoretical semantics: philosophical aspects of 
constructive type theory
Goeran Sundholm
Faculty of Philosophy, University of Leiden
Application of the philosophy behind Martin-Loef's Type Theory to
traditional problems from the Philosophy of Logic and Language.


ADVANCED COURSES

Morphology by itself
Mark Aronoff
Dept. of Linguistics, University at Stony Brook, New York
The properties of the mapping from morphosyntax to morphophonology,
insofar as they are known, will be discussed on the basis of analyses
of parts of the inflectional and derivational systems of diverse
languages.

Executing temporal logic
Howard Barringer
Dept. of Computer Science, University of Manchester
D. M. Gabbay
Dept. of Computing, Imperial College, London
An executable view of temporal logic will be developed.

Concept formation and polysemy
Renate Bartsch
University of Amsterdam

Constraints on movement and scope
Josef Bayer
Max-Planck-Institute for Psycholinguistics, Nijmegen
The goal of this course is to show to what extent the syntax of scope
overlaps with the syntax of overt movement. 

Thematic information in lexicon and syntax
Manfred Bierwisch
Max-Planck-Institute for Psycholinguistics, Nijmegen, und Akademie der
Wissenschaften, Berlin 
Hubert Haider
Institut fuer Linguistik, Stuttgart

Nonmonotonic logic in linguistic description
Joe Calder
Department for Cognitive Science, University of Edinburgh
Michael Morreau
Institut fuer maschinelle Sprachverarbeitung, Universitaet Stuttgart
Theory of nonmonotonic reasoning and its linguistic applications in
the description of phonological, morphological, pragmatic, semantic
and lexical phenomena.

Proof theoretical analysis of algorithms
E. Adam Cichon
Dept. of Computer Science, Royal Holloway and Bedford New College
Lincoln A. Wallen 
Computing Laboratory, University of Oxford
Function hierarchies over (standard) representation of ordinals,
fast-growing vs. slow-growing hierarchies, termination orderings, the
provably recursive functions of a theory, provably terminating 
algorithms of subsystems of arithmetic (eg. Sigma(0,1)-Induction and
Pi(0,2)-Induction). 

>From unification grammars to constraint logic grammars
Luis Damas
Universidade do Porto
Giovanni B. Varile
Commission of the European Communities, Directorate General for
Telecommunications, Information, Industries and Innovation 
After an introduction to the basic concepts of CLP, different
computational linguistic approaches to complex constraint resolution
will be presented with an emphasis on the degree of conformity to 
classical first order interpretation and computational tractability.

Modality in substructural logics
Kosta Dosen
Mathematical Institute, University of Belgrade
The course will be about the proof theory of modal extensions of
logics obtained by rejecting some structural rules from classical or
intuitionistic logic, such as the Lambek calculus, linear logic or
relevant logic.

Temporal relations in discourse
Frank van Eynde
Departement Linguistiek, Katholieke Universiteit Leuven 
Co Vet
Faculteit der Letteren, Rijksuniversiteit Groningen
The course will concentrate on recent developments in the
understanding of temporal discourse phenomena, such as the temporal
relations between subsequent clauses, anaphoric time adverbials, 
temporal connectives and "consecutio temporum".

Labelled deductive systems
D. M. Gabbay
Dept. of Computing, Imperial College, London
A discipline for proof theory involving labelled formula is presented.
It is shown that this framework can unify many existing monotonic and
non- monotonic systems.

Context-dependency and context change
Ulrike Haas-Spohn
Universitaet Muenchen
Thomas Ede Zimmermann
Institut fuer maschinelle Sprachverarbeitung, Universitaet Stuttgart
This is an introduction to the theoretical (as opposed to descriptive)
aspects of the theory of direct reference. 

Computational approaches to intonation and discourse
Julia Hirschberg
2D-450 AT&T Bell Laboratories, Murray Hill
This course will discuss current approaches to intonational analysis,
description and representation; descriptive and empirical studies of
the 'meaning' of intonational features and relating intonational 
features to syntactic,semantic, and discourse/pragmatic features; as
well as computational applications of the results of such research to
speech synthesis and speech recognition.

Definitions
Wilfrid Hodges
School of Mathematical Sciences, University of London
The different kinds of definiton (explicit, implicit, recursive etc.),
analysed in terms of models, with examples from logic programming and
software development. 

Propositional attitudes and propositional attitudes contexts
Hans Kamp
Institut fuer maschinelle Sprachverarbeitung, Universitaet Stuttgart
We will investigate a theory of propositional attitudes and
propositional attitudes reports which emphasize their
interpretational and procedural aspects. The guiding framework will be
that of Discourse Representation Theory.

Algebraic semantics for aspectual phenomena
Manfred Krifka
Dept. of Linguistics, University of Texas at Austin
There are many grammatical phenomena that depend on aspectual
distinctions. After a survey of relevant phenomena and a discussion
of some existing theories, we will develop a treatment in a semantic
framework that assumes different sorts of individuals (objects,
events, times, locations) that are endowed with a lattice structure
to model the part relation between individuals.

Recursion theory
Antonin Kucera
Dept. of Computer Science, Charles University, Prague
The course will be devoted mainly to recursive trees and 901 classes
of sets, diagonalization and self- referential principles in recursion
theory, algorithmic randomness.

Algebraic semantics I: plurals and mass terms
Godehard Link
Seminar fuer Philosophie, Logik und Wissenschaftstheorie, Universitaet Muenchen
Jan Tore L?nning
Universitetet I Oslo
(1) Plural: The linguistic data, in particular collective vs
distributive predication; (2) Plural: The algebraic model; (3) Mass
Terms: Data and model; (4) Plural anaphora; (5) The logic of plurality.

Logic programming with higher-order types
Dale Miller
LFCS, Dept. of Computer Science, University of Edinburgh
We shall briefly consider the logical foundations of extensions to the
usual logic programming paradigm and how the lambda Prolog
programming language incorporates them. We shall then proceed to
present several examples of programming in the resulting language.
Examples will be drawn from theorem proving, natural language
parsing, and program transformation.

Semantics of logic programs
Luis Monteiro
Departamento de Informatica, Universidade Nova de Lisboa
The course will present the traditional procedural, declarative and
fixed-point semantics of logic programs, showing their equivalence.
Negation will be discussed next, with an emphasis on recent work on
three-valued models of logic programs. Finally, it will be shown how
these techniques of semantic definition can be generalized to more
complex logic languages enriched with constructs for modularity and
inheritance.

Automated proof search in categorial logics
Michael Moortgat
OTS, Research Institute for Language and Speech, Rijksuniversiteit
Utrecht
This course studies the parsing problem for categorial type logics,
from the 'parsing as deduction' perspective. Topics to be dealt will
include: sequent proof search and natural deduction, lambda semantics
for categorial deductions, proof nets, combinator-based proof systems,
spurious ambiguity and normalisation, incremental proof search.

Foundations of situation theory
Lawrence Moss
Mathematics Department, Indiana University
This course will survey work on the foundations of situation theory. I
hope to explain what is interesting about this type of foundational
work, and what makes it problematic. I want to introduce several of
the papers in this area, especially those using the non-standard set
theories developed by Aczel.

Dynamic interpretation in high-order logic
Reinhard Muskens
Werkverband Taal en Informatica, Katholieke Universiteit Brabant,
Tilburg 
The classical Theory of Types can be interpreted as a dynamic
logic if some axioms are added to it. In this course I'll show how
this dynamic character of ordinary higher order logic can be used to
treat dynamic phenomena in natural language without having to resort
to the adoption of an extra level of representation (as in DRT) or to
special, rather complicated nonclassical logics (as in DMG). 

The structure of the lexicon in NL systems
John Nerbonne, Klaus Netter
Deutsches Forschungszentrum fuer Kuenstliche Intelligenz, Saarbruecken
The course will be concerned with the hierarchical lexicon (as
explicated in DATR or PATR-templates), the redundancy-free
specification of lexical relations, word formation rules and other
lexical rules.

Human sentence processing
Janet Nicol
Cognitive Science Program, University of Arizona
This course will review recent psycholinguistic research in sentence
processing. Topics to be covered include: the connection between
parsers and grammars; modularity in sentence processing; coreference
processing.

Anaphora in situation semantics
Stanley Peters
Dept. of Linguistics and CSLI, Stanford University
The course focusses on three questions: 
(1) How do anaphoric utterances of pronouns contribute to semantic
content? (2) What facts about an utterance determine that the pronoun
makes this contribution? (3) What limitations does a language impose
on an anaphoric pronoun's ability to contribute in a particular way?

Logical frameworks and logic programming 
Frank Pfenning
School of Computer Science, Carnegie Mellon University, Pittsburgh
Introduction to the LF Logical Framework. Operational interpretation
of LF in analogy to the operational interpretation for Horn clauses.

Topics in constraint-based syntactic theory
Carl Pollard
Department of Linguistics, Ohio State University
This course examines recent developments within head-driven phrase
structure grammar (HPSG), with attention to both formal architecture
of the theory and analysis of key phenomena (control, unbounded
dependencies, and anaphoric binding).

Contextual reasoning in Natural Language Processing
Steve Pulman
SRI International Cambridge, Computer Laboratory, University Cambridge
This course will present some theoretically grounded,but implementable
approaches to the contextual reasoning problem, using ideas from
theorem proving and constraint logic programming.

Anaphora and ellipsis
Mats Rooth
Bell Labs, Philadelphia

Computational and logical foundations of constraint grammars
Gert Smolka
Deutsches Forschungszentrum fuer Kuenstliche Intelligenz, Saarbruecken, und
Universitaet Saarbruecken 
Constraint Grammars (e.g., PATR-II, LFG, HPSG), Feature Logic,
Constraint Solving Algorithms, Feature Terms and Unification,
Constraint Logic Programming.

Logical Form - syntax and semantic interpretation
Arnim von Stechow
Fachgruppe Sprachwissenschaft, Universitaet Konstanz
Semantic interpretation of indices in Logical Form (LF) of the
so-called GB-Theory.

Combinatory grammars and natural language understanding
Mark Steedman
Computer and Information Science, University of Pennsylvania 
The course will discuss a generalisation of Categorial Grammar based
on the incorporation of a few syntactic operations related to
"combinatora" such as functional composition.

Unbounded dependencies and algebraic semantics
Anna Szabolcsi
Hungarian Academy of Sciences, Budapest
Frans Zwarts
Centre for Behavioural, Cognitive and Neuro-sciences (BCN), University
of Groningen
We will argue that a number of restrictions on so-called unbounded
dependencies can and must be explained by reference to the semantical
properties of the expressions involved. 

Property theory
Ray Turner
Dept Computer Science, University of Essex
The course will involve an overview of the more recent theories of
properties including those of Aczel, Feferman and Turner. 

Self-reflexivity and theories of truth
Matthias Varga von Kibed
Seminar fuer Philosophie, Logik und Wissenschaftstheorie, Universitaet
Muenchen
(1) Comparison of different theories of paradoxes since Kripke's
theory of truth (2) Quotational logic (From Kaplan's 'Bob & Carol &
Ted & Alice' to Blau's LQ) (3) On the use of self-reflexive
token-systems (4) LR, the logic of reflection, embedded into
Smullyan's self-referential languages (5) Self-reflexivity and
theories of truth 

Small proofs
Albert Visser
Dept. of Philosophy, Utrecht University
Efficiency of finitistic arithmetical statements F01 will be studied.

Instructions as discourse
Bonnie Lynn Webber
Dept. of Computer & Information Science, University of Pennsylvania
We will consider, among other topics: (1) where instructions fit into
approaches to knowledge, plans and behavior proposed in Artificial
Intelligence; (2) how much (or how little) of an action description
an agent understands when s/he understands instructions; and (3)
interesting features of referring expressions used in instructions. 

Topics in generalized quantifiers
Dag Westersthl
Dept. of Philosophy, University of Stockholm
(1) Formal languages with generalized quantifiers and their logical
properties; (2) Possible natural language quantifiers, examples and
properties; (3) Model theory: issues of expressive power (unary vs.
n-ary quantifiers, monadic vs. polyadic quantifiers, etc.); (4) Cont.
of 3., plus some Proof theory (a Natural Logic for quantification?);
(5) Quantifiers in 'dynamic' frameworks such as DRT, DPL and 
Situation Semantics. 

WORKSHOPS

Attribute-value logics, inheritance and types
Bob Carpenter
Dept. of Philosophy, Carnegie Mellon University, Pittsburgh
This workshop will be focused on the presentation of current research
that integrates attribute-value logics with inheritance-based
reasoning. 

Type theory
Thierry Coquand
CTH, Computer Science Department, Chalmers University, Goteborg

Mechanisms for word order
Elisabet Engdahl
Centre for Cognitive Science, Edinburgh University
The purpose of this workshop is to bring together researchers who have
actively worked on the grammatical characterisation of word order or
on implementation issues, or on both, for exchange and discussion
relating to the mechanisms used to handle word order variation. 

Machine translation
Johann Haller
Dept. of Applied Linguistics and Translation, Universitaet des Saarlandes
Theoretical and practical presentation of various MT systems by
representatives of industrial and academic research groups.
Exploration of various approaches with respect to usability,
linguistic background and future prospects.

Deductive principle-based parsing
Mark Johnson
Brain & Cognitive Science, Brown University
Manfred Pinkal
Dept. of Computational Linguistics, Saarbruecken University
The workshop will focus on current research and basic problems in the
field of parsing within the linguistic principle-and-parameters
framework. Recent work in this area will be presented and discussed,
with special attention to deductive approaches.

Semantics and syntax of focus
Manfred Krifka
Dept. of Linguistics, University of Texas at Austin
Arnim von Stechow
Fachgruppe Sprachwissenschaft, Universitaet Konstanz
Discussion of recent semantic and syntactic proposals for the
description of focus constructions.

Defeasible reasoning in semantics and pragmatics
Alex Lascarides, Jon Oberlander
Centre for Cognitive Science, Edinburgh University
The workshop will assess whether and when it's appropriate to use
default rules in the interpretation and generation of natural
language semantics and pragmatics. We will investigate which
intuitively compelling patterns of defeasible inference underly
semantic and pragmatic phenomena, and evaluate the suitability of
existing default logics.

Representation and reference
Paul Schweizer
Centre for Cognitive Science, Edinburgh University
The purpose of the workshop is to explore some issues in the
philosophy of mind/language having to do with the nature and role of
intentional states. In particular, the workshop will focus on
intentionality as manifested in the areas of linguistic reference and
mental representation. 


REGISTRATION FORM 
for the 3rd European Summer School
in Language, Logic and Information
Saarbruecken, August 12-23
Deadline for registration: April 15th, 1991

I. Personal Data

Name:
University / Company:
Address:

Country:
E-mail address:
Telephone:

 O Student O Visiting scholar O Industrial participant 
(if you are a student please enclose a proof of your student status)

II. Accommodation

Do you wish to reserve a room in the University's student halls?
O no O yes 
If yes, would you possibly share a double room? 
O no O yes (are you O male O female)

Would you like to receive a list of hotels? O yes 

Date of arrival O August, 11 O other: 
Date of departure O August, 23 O August, 24 O other: 

III. Fees
Specify the amount paid. Please notice that your application is only 
valid if the fee is paid.
Registration fee: 
O DM 185,- (Student) O DM 350,- (Visiting scholar) 
O DM 750,- (Industrial participant)
Deposit for accommodation: O DM 100,- O no reservation
Find enclosed 
O a Eurocheque 
O a receipt showing evidence of a bank transfer

Account for bank transfer:
Saar Bank, 
Saarbruecken, Germany
Acct.-No.: 0108-2222, 
routing code: 591 900 00
purpose: summer school.

Send your registration form and a receipt of your payment to
Universitaet des Saarlandes
Computerlinguistik
W-6600 Saarbruecken 11
Germany

For further details please contact
Hans Uszkoreit / Maike Paritong 
E-mail: esscoli.uni-sb.de
Telefax: +49(681) 302-4351 
Phone: +49(681) 302-3714/4115
Mail to author|Respond to list|Read more issues|LINGUIST home page|Top of issue