Copy Link
Add to Bookmark
Report
AIList Digest Volume 4 Issue 150
AIList Digest Monday, 16 Jun 1986 Volume 4 : Issue 150
Today's Topics:
Seminars - Modular Construction of Logics for Specification (CMU) &
Dependent Types (MIT) &
Programming Languages & Temporal Knowledge (Edinburgh),
Conference - APS Workshop at AAAI-86 &
Temporal Aspects in Information Systems &
Symposium on Connectionism
----------------------------------------------------------------------
Date: 10 June 1986 1542-EDT
From: Theona Stefanis@A.CS.CMU.EDU
Subject: Seminar - Modular Construction of Logics for Specification (CMU)
PS SEMINAR
Date: Friday, 20 June
Time: 10:00
Place: WeH 4605
Modular Construction of Logics for Specification
Martin Sadler
Imperial College, London
mrs@@doc.ic.ac.uk
A typical informal presentation of a logic for reasoning
about some aspect of computing is:
Nice logic = First-order logic + Temporal bit
We can ask two questions about this equation. Firstly, what
is going on with the '+' and other similar combinators?
Secondly, how do we guarantee that such equations are well
behaved - in the sense that the logics we build will support
the ideas of specification and stepwise refinement?
To answer these questions one needs to have a formal
framework for talking about logics. Our preference is for a
proof theoretic framework. Crudely:
Logic "=" presentation of a consequence relation
Combinator "=" function of type: logic* -> logic
Modularity principle "=" interchange principle
between combinators
One important kind of combinator that has not received
the attention it deserves is a 'talksabout' combinator that
gives one a meta-level mechanism with respect to the logic
it is applied to. Together with the observation that canon-
ical "arrow" logics can be built on the collections of vari-
ous kinds of preserving maps between logics, we can start
talking about logics as solutions to "logic-equations":
LOGIC = talksabout(logic)
+ talksabout(nice_logic)
+ talksabout(nice_logic
-> implementation_logic)
The seminar will attempt to show how such a framework
can be used, as part of an interactive environment, to sup-
port software engineers in setting up logics for specifica-
tion and verification.
------------------------------
Date: Tue 10 Jun 86 14:45:38-EDT
From: Lisa F. Melcher <LISA@XX.LCS.MIT.EDU>
Subject: Seminar - Dependent Types (MIT)
Date: Thursday, June 19, 1986
Time: 2:45 p.m......Refreshments
3:00 p.m......Lecture
Place: NE43 - 512A
"DEPENDENT TYPES -- FIFTEEN YEARS LATER"
J.Y.GIRARD
University of Paris VII
Our system F of polymorphic lambda calculus (developed independently by
Reynolds) is attracting increasing interest because of its relation to
polymorphic types in programming, although our original motivation for
studying the system was quite different. In this talk we summarize the basic
theoretical properties of the type system and compare the computer
scientists' and logicians' views of it.
Sponsored by TOC, Laboratory for Computer Science
Albert Meyer, Host
------------------------------
Date: Fri, 6 Jun 86 18:00:06 -0100
From: Gideon Sahar <gideon%edai.edinburgh.ac.uk@Cs.Ucl.AC.UK>
Subject: Seminars - Programming Languages & Temporal Knowledge (Edinburgh)
EDINBURGH AI SEMINARS
Date: Wednesday 28th May l986
Place: Department of Artificial Intelligence
Seminar Room
Forrest Hill
EDINBURGH.
Dr. M. Steedman, Centre for Cognitive Sciences and Department of Artificial
Intelligence will give a seminar entitled - "Combinators, Universals and
Natural Language Processing".
Combinators are primitive elements in terms of which we can define the notion
of defining a function, as with the lambda operator of LISP, without the use
of the bound variables which are associated with that operator, and which are
so expensive for interpreters of LISP and related functional programming
languages. For some time, my colleagues and I have been arguing that the
syntax and semantics of certain problematic "unbounded dependencies" and
"reduced" constituents in natural language constructions such as English
relative clauses and coordinate constructions can be elegantly captured by
extending Categorial Grammars (discussed by Ewan Klein here a couple of months
ago) with operations corresponding to certain simple combinators. Such
grammars hold out the promise of a theory according to which natural language
syntax is a very direct reflection of a computational efficient applicative
semantics which minimises the use of bound variables. The paper concerns
some implications for processing and the prediction of certain contrasts
between the grammars of Spanish and English.
Date: Wednesday, 4th June l986
Time: 2.00 p.m.
Place: Department of Artificial Intelligence,
Seminar Room,
Forrest Hill,
EDINBURGH.
Professor Colin Bell, University of Iowa will give a seminar entitled -
``A Point-Based Representation of Temporal Knowledge in Automated
Project Planning".
A point-based temporal reasoning system is presented as an alternative
to existing interval-based temporal logics. It appears to be
especially applicable in nonlinear hierarchical planning where such
temporal quantities as activity durations and scheduling delays are
uncertain. Temporal constraints representable in this system fall into
a very restricted class. However, it is argued that representing more
general constraints results in computational intractability. Details
of implementation are discussed.
Date: Wednesday, 11th June l986
Time: 2.00 p.m.
Place: Department of Artificial Intelligence,
Seminar Room F10,
80 South Bridge,
EDINBURGH.
Mr. Peter Jackson, Department of Artificial Intelligence, University of
Edinburgh will give a seminar entitled - ``Towards a Methodology for
Designing Problem Solving Architectures in the Object-Oriented Style".
Although current object-oriented systems provide the programmer with both
software modules (such as production rule interpreters and theorem provers)
and software tools (such as browsers and debuggers), they fail to provide a
set of guidelines as to how to select and combine modules to create a
particular architecture. Too often, one is given some combination of
Flavors, OPS and Prolog (or their look-alikes), and then left to get on with
it. A further criticism is that the modules provided do not lend themselves
to adaptation by specialization in the spirit of the object-oriented
environment in which they are embedded.
A methodology for creating 'abstract architectures', which can be
instantiated via a process of specialization, is described in the context of
a new object-oriented programming language called SLOOP. A detailed example
is given of how to create a generic production rule architecture whose
behaviour is easy to modify incrementally, together with a sample problem
solving program. It is suggested that certain features of SLOOP, namely
its transparency and the fact that it is mostly implemented in itself, make
it particularly useful as a vehicle for tasks of this kind, while some of
the facilities offered, such as pattern-matched parameter-passing and the
ability to compile SLOOP into Lisp and thence into native code, encourage a
functional style of programming without extracting too high a price in terms
of efficiency.
------------------------------
Date: Thu, 12 Jun 86 15:17:26 edt
From: als@mitre-bedford.ARPA (Alice L. Schafer)
Subject: Conference - APS Workshop at AAAI-86
---> The cutoff date for receiving a request for participation in the
Workshop on Automatic Programming at the AAAI-86 was accidentally omitted
from the notice. While the original date was June 15, we will extend
it to June 30 to give people sufficient time to respond.
...
The workshop will be held on Thursday August 14th, and will last
approximately three hours. The current plan is that one and a half hours will
be occupied by brief (seven minutes) presentations of current work, followed
by a panel discussion with active audience participation, moderated by
Tom Cheatham of Harvard. Due to the size of the available rooms, we
may have to limit the audience to researchers who have experience with
some aspect of the APS problem.
If you wish to present your current work or be on the panel you should
send us a 200-800 word abstract. The decision on who will participate will
be based on these abstracts. If you wish to participate as a member of the
audience instead, send us a short note containing a description of your work
or references to pertinent papers you have written. If we need to limit the
audience we will base our decisions on these responses, which should be sent
by June 30.
Please post a printed copy of this notice at your workplace.
Organized by:
Alice Schafer Richard Brown Richard Piazza
(617) 271-2363 (617) 271-7559 (617) 271-2363
als@mitre-bedford.arpa rhb@mitre-bedford.arpa rlp@mitre-bedford.arpa
of the Knowledge-Based Automatic Programming Project (ISFI)
The MITRE Corporation
Mail Stop A-045
Burlington Road
Bedford, MA 01730
------------------------------
Date: Mon, 9 Jun 86 12:06:07 PDT
From: Lougie Anderson <lougiea%crl.tek.csnet@CSNET-RELAY.ARPA>
Reply-to: Lougie Anderson <lougiea%tekcrl.uucp@CSNET-RELAY.ARPA>
Subject: Conference - Temporal Aspects in Information Systems
Conference Announcement
TEMPORAL ASPECTS IN INFORMATION SYSTEMS
Sophia-Antopolis, France
May 13-15, 1987
Temporal Aspects in Information Systems: A working confer-
ence by IFIP Technical Committee TC 8 "Information Systems"
in cooperation with AFCET, the French Computer Science and
Information Society.
MOTIVATION
Recent developments in the area of information systems
emphasize the role played by time. Research in information
systems design has pointed to the need for a realistic world
model which includes representations not only for snapshot
descriptions of the real world, but also for histories, on
the evolution of such descriptions over time. These
developments still suffer from a lack of concepts, languages
and theoretical foundations dealing with the design of tem-
poral and behavioral aspects of informations systems. More-
over, temporal correctness criteria and analysis are neces-
sary. In addition the management of computerized informa-
tion systems requires new mechanisms to allow the implemen-
tation and the handling of these elements. Papers can be
submitted on the following items.
TOPICS
Theoretical and Modeling Aspects of the Time Dimension of
Information: Time theory, temporal logic, causality theory,
linguistic and philosophic approaches of time. Time model-
ing, behavioral modeling, languages for specification and
query, temporal/causal dependencies and constraints, tem-
poral consistency checking.
Time and Behavior Implementation and Handling: Temporal
dimension of databases, historical databases implementation,
user interface for historical databases, snapshots, time and
behavior handling in computerized systems, time and event
mechanisms, management of multiple versions, data time
versus transaction time, concurrency and synchronization
problems.
Applications with a Temporal Dimension: Time in decision
support systems for prediction and planning achievement,
time dimension in CAD and CAM systems, in large statistical
data bases, in large socio-economic data bases, in medical
systems, and real-time systems.
GENERAL CONFERENCE CHAIRMAN
Francois Bodart
Institute Notre-Dame de la Paix
21, rue Grangagnage
500 Namur, Belgium
PROGRAMME COMMITTEE CHAIRMAN
Colette Rolland
Universite Paris I
12, place du Pantheon
75231 Paris Cedex, France
ORGANIZING COMMITTEE CHAIRMAN
Michel Leonard
Centre Universitaire d'Informatique
Universite de Geneve
24, rue du General-Dufour
1211 Geneve 4, Switzerland
PROGRAMME COMMITTEE
M. Adiba, IMAG, France
J. Allen, University of Rochester, USA
L. Anderson, Tektronix, USA
V. de Antonellis, University of Milano, Italy
G. Ariav, Tel Aviv University, Israel
F. Bodart, Institut Notre-Dame de la Paix, Belgium
J. Bubenko, University of Stockholm, Sweden
J. Clifford, New York University, USA
A. Furtado, University of Rio de Janeiro, Brazil
M. Jarke, University of Frankfurt, Germany
M. Leonard, University of Geneva, Switzerland
S. Navathe, University of Florida, USA
P. Nobecourt, University Paris I, France
A. Olive, University of Barcelona, Spain
B. Pernici, Milano Polytechnic School, Italy
U. Schiel, Federal University of Paraiba, Brazil
A. Sernadas, University of Lisbon, Portugal
HOW TO SUBMIT
Original papers in English of up to 5,000 words are sought
on topics included in, but not limited to, the proposed
list. Papers should be recieved before October 1st, 1986.
Authors should submit four copies of the full paper to:
AFCET
TAIS, Conference
156, boulevard Pereire
75017 Paris, France
IMPORTANT DATES
Papers due: October 1, 1986
Acceptance notification: December 15, 1986
Final copy due: February 15, 1987
Conference: May 13-15, 1987
------------------------------
Date: 13 JUN 86 11:38-N
From: SCHNEIDER%CGEUGE51.BITNET@WISCVM.WISC.EDU
Subject: Conference - Symposium on Connectionism
Symposium and Workshop on
CONNECTIONISM :
MULTIPLE AGENTS, PARALLELISM AND LEARNING
=================================================================
Symposium 9th of September 1986
Workshop 10th - 12th of September 1986
LOCATION Geneva University, UNI II, Switzerland
The symposium and workshop are sponsored by the Swiss Group for
Artificial Intelligence and Cognitive Science (SGAICO), the Jean
Piaget Foundation and the Faculty of Psychology and Education
Science of the University of Geneva.
Symposium Programme : SYMPOSIUM DAY : 9TH OF SEPTEMBER
At the 9th of September a one day symposium will be held on
"CONNECTIONISM : Multiple Agents , Parallelism and Learning"
where the main ideas of this paradigm in Artificial Intelligence
and Cognitive Science will be presented. The symposium is open to
the public. The goal of this symposium is to give an introduction
and survey of the problems of Connectionism.
09.00 - 10.30 THE SOCIETY THEORY OF MIND:
Marvin Minsky, MIT
10.45 - 12.00 THE LOCALIST POSITION IN CONNECTIONISM:
ON REPRESENTATION AND LEARNING
Jerome Feldman, University of Rochester
14.00 - 15.15 THE DISTRIBUTIONIST POSITION IN CONNECTIONISM:
ON REPRESENTATION AND LEARNING
Terry Sejnowski, John Hopkins University
15.30 - 16.45 LEARNING PARADIGMS IN CONNECTIONISM:
David Rumelhart, University of California
16.45 - 18.00 BUILDING WORKING CONNECTIONIST MODELS
David Waltz, Intelligent Thinking Machines, USA
Entry fees for the SYMPOSIUM: STUDENTS: SFRS 40,- ;
UNIVERSITY MEMBERS: SFRS 100,- ; INDUSTRY: SFRS 250,-
The following persons get a entry-price reduction of 20 Percent:
- Members and Students of the Faculty of Psychology and Education
Science of the University of Geneva
- Members of the Swiss Informatitions Society (SI)
- Members of the Swiss Group for Artificial Intelligence and
Cognitive Science (SGAICO)
For further information and registration apply to the SYMPOSIUM
SECRETARY Mrs. Manuela Mounir
WORKSHOP PROGRAMME
After the Symposium a two and a half day workshop will take place
at the Geneva University. The workshop is limited to 20 invited
attendees, whose research interests are in different aspects of
multiple agents, parallelism and learning. The goal of the
workshop is to discuss and elucidate different approaches and
their interrelations and to further conceptualise the present
problems and future promising research directions in
Connectionism. The workshop will be videotaped and later made
accessible to a wider audience.
Participants are:
Guenter Albers Genetic A.I. and Epistemics Lab. Geneva Uni.
Andre Boder MIT and Geneva University
Heiner Brand University of Bielefeld, Germany
Guy Cellerier Genetic A.I. and Epistemics Lab. Geneva Uni.
Stefano Cerri Mario Negri Institute, Milan
Jean-Jaques Ducret Genetic A.I. and Epistemics Lab. Geneva Uni.
Jerome Feldman University of Rochester, Rochester
Ken Haase Artificial Intelligence Lab., MIT
John Holland University of Michigan, Ann Arbor
Marvin Minsky Artificial Intelligence Lab., MIT
Rolf Pfeifer Institute for Informatics,Zuerich University
Mike Rosner ISSCO, Geneva University
Thomas Rothenfluh Conflict Research Center, Zuerich University
David Rumelhart University of California, San Diego
Terrence Sejnowski John Hopkins University, Baltimore
Zoltan Schreter Genetic A.I. and Epistemics Lab. Geneva Uni.
Luc Steels A.I. Lab, Free University, Brussels
John Sutton GTE Labs, Walton, USA
David Waltz Intelligent Thinking Machines, Cambridge USA
ORGANISATION: Guenter Albers
GENETIC ARTIFICIAL INTELLIGENCE AND EPISTEMICS LABORATORY
University of Geneva, Switzerland
TEL.: (0041) 22 20 93 33 EXT.2623 (Switzerland)
REGISTRATION and SYMPOSIUM SECRETARY: Mrs. Manuela Mounir
FACULTY OF PSYCHOLOGY AND EDUCATION SCIENCE, UNIVERSITY OF GENEVA
CH-1211 Geneva 4, Switzerland
TEL.: (0041) 22 20 93 33 EXT.2657 (Switzerland)
Telex: 423801 UNI CH Geneve
For further (non-organisation-related) information send mail to
Guenter Albers or reply by email to Daniel Schneider:
to VMS/BITNET: to UNIX/EAN: (preferable)
BITNET: SCHNEIDER@CGEUGE51 shneider%cui.unige.chunet@CERNVAX
ARPA: SCHNEIDER%CGEUGE51.BITNET@WISCVM shneider%cui.unige.chunet@ubc.csnet
uucp: mcvax!cernvax!cui!shneider
X.400/ean: shneider@cui.unige.chunet
------------------------------
End of AIList Digest
********************
