Copy Link
Add to Bookmark
Report
NL-KR Digest Volume 14 No. 19
NL-KR Digest Fri Mar 24 22:39:42 PST 1995 Volume 14 No. 19
Today's Topics:
Program: ICCS'95 Intl. Conf. Conceptual Structures, Aug 95, Santa Cruz
* * *
Subcriptions: listserv-style administrative requests to
nl-kr-request@ai.sunnyside.com.
Submissions, policy, questions: nl-kr@ai.sunnyside.com
To speed up processing of your submission write to
listserv@ai.sunnyside.com with the message:
GET nl-kr style
Back issues:
FTP: ai.sunnyside.com:/pub/nl-kr/Vxx/Nyyy
/pub/nl-kr/Vxx/INDEX
Gopher: ai.sunnyside.com, Port 70, in directory /pub/nl-kr
Email: write to LISTSERV@AI.SUNNYSIDE.COM, omit subject, mail command:
GET nl-kr nl-kr_file_list
Web: http://ai.sunnyside.com/pub/nl-kr
Editors:
Al Whaley (al@ai.sunnyside.com) and
Chris Welty (weltyc@cs.vassar.edu).
-----------------------------------------------------------------------
From: Gerard Ellis <ged@cs.rmit.edu.au>
Subject: Program: ICCS'95 Intl. Conf. Conceptual Structures, Aug 95, Santa Cruz
To: kaw@swi.psy.uva.nl, AG-EXP-L@VM1.NoDak.EDU, LINGUIST@TAMVM1.TAMU.EDU,
Date: Thu, 23 Mar 1995 09:28:23 +1100 (EST)
Please find below the Programme and Registration form for ICCS'95. A postscript
version can be ftp'ed
ftp.cs.rmit.edu.au
/pub/rmit/ICCS95/ICCS95.ps.Z
Also the programme and registration form can be accessed from the
ICCS'95 home page on the World Wide Web
http://www.cs.rmit.edu.au/ICCS95/
Regards, Gerard
--
Gerard Ellis ged@cs.rmit.edu.au ph:61-3-660-5090 FAX:61-3-662-1617 Rm:10.9.11
WWW: http://www.cs.rmit.edu.au/~ged Computer Science Dept, Royal Melbourne
Institute of Technology, GPO Box 2476V, Melbourne, Victoria, 3001, AUSTRALIA
___________________________<cut here>___________________________________
ADVANCE PROGRAMME
3rd International Conference on Conceptual Structures
August 14-18, 1995
University of California, Santa Cruz
Sponsored by:
IBM, Santa Teresa Laboratory, San Jose.
University of California at Santa Cruz.
Royal Melbourne University of Technology, Australia.
THEME
Conceptual structures are a modern treatment of Charles Sanders
Peirce's Existential Graphs which are a graphic notation for classical
logic with higher order extensions developed in 1896. Peirce viewed
existential graphs as ``his luckiest discovery'' and ``a logic of the
future''.
John Sowa showed that conceptual graphs can be mapped to classical
predicate calculus or order sorted logic, and are thus seen as a
(graphic) notation for logic. However, it is the topological nature of
formulas (topology was a field Peirce helped develop) which conceptual
graphs make clear, and which can be exploited in reasoning and
processing. Conceptual graphs are intuitive because they allow humans
to exploit their powerful pattern matching abilities to a larger extent
than does the classical notation. Conceptual graphs can be viewed as
an attempt to build a unified modelling language and reasoning tool.
Conceptual graphs can model data, functional and dynamic aspects of
systems. They form a unified diagrammatic tool which can integrate
Entity-Relationship diagrams, Finite State Machines, Petri Nets, and
Dataflow diagrams.
ORGANISATION
Program Chair Local Arrangements Chair
Gerard Ellis Robert Levinson
Royal Melbourne Univ of Technology Univ of California, Santa Cruz
Australia USA
ged@cs.rmit.edu.au levinson@cis.ucsc.edu
Finance Chair Honorary Chair
Bill Rich John Sowa
IBM San Jose, California State University of New York
USA USA
billrich@vnet.ibm.com sowa@turing.pacss.binghamton.edu
PROGRAM COMMITTEE
Hassan Ait-Kaci (Canada) Dickson Lukose (Australia)
Harmen van den Berg (Netherlands) Craig McDonald (Australia)
Duane Boning (USA) Guy Mineau (Canada)
Boris Carbonneill (France) Jens-Uwe Moeller (Germany)
Michel Chein (France) Bernard Moulin (Canada)
Key Sun Choi (Korea) Marie Laure Mugnier (France)
Peter Creasy (Australia) Jonathan Oh (USA)
Walling Cyre (USA) Heike Petermann (Germany)
Harry Delugach (USA) Heather Pfeiffer (USA)
Judy Dick (USA) James Slagle (USA)
Peter Eklund (Australia) Bill Tepfenhart (USA)
Bruno Emond (Canada) Eileen Way (USA)
Norman Foo (Australia) Michel Wermelinger (Portugal)
Brian Gaines (Canada) Mark Willems (Netherlands)
Adil Kabbaj (Canada) Walter Wilson (USA)
Fritz Lehmann (USA) Vilas Wuwongse (Thailand)
Auxillary Reviewers
Alex Bejan (Australia) Tao Lin (Australia)
Phil Kime (UK) Maurice Pagnucco (Australia)
INVITED TALKS
Development and Implications of the CG Standards
John F. Sowa
SUNY Binghamton
A proposed standard for conceptual graphs is being developed by ANSI
Technical Committee X3T2. The standard is based on the common CG core
that has been used and implemented in various projects since 1984.
Some purists have insisted on perserving a minimal core that is simpler
than the 1984 version and closer in spirit to C. S. Peirce's original
existential graphs. Others have been trying to increase the expressive
power of CGs to match the generalized quantifiers and referents of
natural languages, but the various modifications and extensions have
introduced incompatibilities. To accommodate both groups, the proposed
CG standard will be based on a minimal core that has a simple mapping
to predicate calculus and KIF. It will also have an extensibility
mechanism for defining generalized quantifiers and referents in a
controlled and systematic way. As far as possible, the 1984 syntax and
features will be accommodated either by the core or by the
extensibility mechanisms. But the extensions will also support some
new representations that can be useful for NL semantics,
object-oriented systems, and optimized computations.
Graphical Logic
Hassan Ait-Kaci
Simon Fraser University
This talk will discuss the graphical nature of structures used in
knowledge representation and logic programming. It will draw from my
work on the foundations of the LIFE programming language and will
emphasize the graph-theoretic underpinnings of the notions of
subsumption, approximation, and interpretation.
Ontology Revision
Norman Foo
University of Sydney
Knowledge systems are usually static in their ontlogical assumptions.
To make them dynamic, there are several levels of theory change that
can be considered. Change without the introduction of new concepts is
subsumed under existing theories of belief revision. If new concepts
have to be introduced, we are in the domain of ontology revision about
which very little is known. This talk will briefly outline a widely
accepted belief revision meta-logic, then move on to circumstances in
which it can be shown that ontology revision is necessary. Connections
will be made to classical results in recursion theory and the problem
of theoretical terms. Type hierarchies will be used to illustrate some
of the main points.
Complex Dynamics in Computational Systems: Artificial Worlds at the
Santa Fe Institute
Roger Burkhart
Deere & Company
>From Dyadic to Triadic Concept Analysis
Rudolf Wille
Technische Hochschule Darmstadt (Germany)
Formal Concept Analysis, as it has been developed during the last
fifteen years, is based on a dyadic understanding of a concept
constituted by its extension and its intension. It starts with the
primitive notion of a formal (or dyadic) context which combines a set
of (formal) objects, a set of (formal) attributes and a binary relation
between those sets indicating when an object has a certain attribute. A
formal concept of such a dyadic context is constituted by its extension
formed by objects of that context and by its intension formed by
attributes of that context. The formal concepts of a given formal
context always form, with respect to the subconcept-
superconcept-relation, a complete lattice which is called the concept
lattice of the context. In more than 100 projects of application in
numerous areas of interest, concept lattices have been activated for
analysing and exploring data and knowledge. Recently, those experiences
(but also philosophical considerations based on Peirce's pragmatic
philosophy) have suggested a triadic approach to formal concept
analysis. It starts with the notion of a triadic context combining
(formal) objects, attributes and conditions under which objects may
have certain attributes. By the Basic Theorem of Triadic Concept
Analysis, it has been clarified what kind of structures are formed by
the triadic concepts of triadic contexts. The representation of those
structures by triadic diagrams has also been studied. Examples of the
conceptual analysis of triadic data sets may demonstrate the usefulness
of the new approach.
Tutorial: Introduction to Conceptual Graphs
Gerard Ellis, RMIT
In this tutorial we will introduce conceptual graphs as a graphic
notation for first order logic. We will illustrate how to define
concepts and relationships, and construct concept and relation
hierarchies. We will introduce the generalization hierarchy over
conceptual graphs and the canonical formation rules which are the
foundation of conceptual graph theory. We will examine advanced uses of
conceptual graphs for object modelling and object systems. We will show
how Peirce's inference rules can be used for reasoning in conceptual
graphs.
CONFERENCE OVERVIEW
Sunday, August 13
Evening
5:30 - 7:30 Free Tutorial: Introduction to Conceptual Graphs
Gerard Ellis (Australia)
Monday, August 14
8:00 - 9:00 Registration
9:00 - 9:30 Welcome Address
9:30 - 10:30 Invited Talk - Roger Burkhart
11:00 - 12:00 Session 1: Applications
12:00 - 1:30 Lunch (Provided)
1:30 - 2:30 Session 2: Natural Language
3:00 - 4:30 Session 3: Natural Language
4:30 - 5:30 Panel Discussion - Natural Language and CGs
5:30 Reception
Tuesday, August 15
8:00 - 9:00 Registration
9:00 - 10:15 Session 4: Natural Language /
Programming in Conceptual Graphs
11:00 - 12:00 Invited Talk - Hassan Ait-Kaci
12:00 - 1:30 Lunch (Provided)
1:30 - 2:30 Session 5: Programming in Conceptual Graphs
3:00 - 4:45 Session 6: Machine Learning / Knowledge Acquisition
4:45 - 5:30 Panel Discussion - Role of Graph Theory in CGs
Wednesday, August 16
8:00 - 9:00 Registration
9:00 - 10:30 Session 7: Hardware and Implementation
11:00 - 12:00 Invited Talk - Norman Foo
12:00 - 1:30 Lunch (Provided)
1:30 - 2:30 Session 8: Logic, Existential Graphs and Peirce
3:00 - 5:00 Session 9: Graph Operations
Thursday, August 17
8:00 - 9:00 Registration/Officers Meeting
9:00 - 10:30 Session 10: Graph Matching / Knowledge Acquisition
11:00 - 12:00 Invited Talk - Rudolf Wille
12:00 - 1:30 Lunch (Provided)
1:30 - 3:00 Session 11: Ontologies and Theory
3:30 - 4:30 Invited Talk - John Sowa
4:30 - 5:00 General Meeting
5:30 Buffet Reception
Friday, August 18
8:00 - 9:00 Registration
9:00 - 5:00 Workshop: Third PEIRCE Workshop:
A Conceptual Graph Workbench
CONFERENCE PROGRAM
MONDAY August 14
8:00 - 9:00 Registration
9:00 - 9:30 Welcome Address and Conference Opening
9:30 - 10:30 Invited Talk - Roger Burkhart
10:30 - 11:00 Coffee Break
Session 1: Applications
11:00 - 11:30 "Automatic Integration of Digital System Requirements
using Schemata"
R. Y. Kamath and W. R. Cyre, Virginia Tech (USA)
11:30 - 12:00 "Service Trading Using Conceptual Structures"
A. Puder, S. Markwitz and F. Gudermann, University of
Frankfurt (Germany)
12:00 - 12:15 "Automated Message Analysis Using the Conceptual Programming
Environment, CP"
Heather D. Pfeiffer (New Mexico State University, USA) and
Bruce J. Waltar (Pacific Northwest Laboratory, Ft. Lewis, USA)
12:15 - 12:30 "Implementation of Multi Agent Systems using Conceptual
Graphs for Knowledge and Message Representation:
the CoGITo Platform"
Ollivier Haemmerle, LIRMM (France)
12:00 - 1:30 Lunch (Provided)
Session 2: Natural Language
1:30 - 2:00 "Sentence Generation from Conceptual Graphs"
Nicolas Nicolov, Chris Mellish and Graeme Ritchie,
University of Edinburgh (United Kingdom)
2:00 - 2:30 "A Pragmatic Representational Approach of Context and
Reference in Discourses"
Bernard Moulin, Laval University (Canada)
2:30 - 3:00 Coffee Break
Session 3: Natural Language
3:00 - 3:30 "Using the Conceptual Graphs Operations for Natural
Language Generation in Medicine"
J. C. Wagner, R.H. Baud and J.-R. Scherrer,
Hopital Cantonal Universitaire de Geneve (Switzerland)
3:30 - 4:00 "Table 10 left without paying the bill ! a good reason to
treat metonymy with conceptual graphs"
Tassadit Amghar, Francoise Gayral and Bernard Levrat,
Universite de Paris-Nord (France)
4:00 - 4:15 "An Incremental Semantic Parser for Conceptual Graphs"
J. T. Sykes, V. Konstantinou and P. L. R. Morse,
The University of Westminster (United Kingdom)
4:15 - 4:30 "Modeling cognition with conceptual graphs: Exploring
alternative cognitive architectures and modeling natural
language processing"
Bruno Emond, Universite du Quebec a Hull (Canada)
4:30 - 5:30 Panel Discussion: Conceptual Graphs in Natural Language
5:30 Reception
TUESDAY August 15
8:00 - 9:00 Registration
Session 4: Natural Language / Programming in Conceptual
Graphs
9:00 - 9:30 "Discourse Spaces: A Pragmatic Interpretation of Contexts"
Bernard Moulin, Laval University (Canada)
9:30 - 9:45 "A General Model of Behavior for Conceptual Graph Theory"
Adil Kabbaj, Universite de Montreal (Canada)
9:45 - 10:00 "PhiLog: An Implementation of Formula Translator in a
Sorted Logic Programming Language"
Sait Dogru and James R. Slagle, University of Minnesota (USA)
10:00 - 10:15 "Operational KADS Conceptual Model using Conceptual Graphs
and Executable Conceptual Structures"
D. Lukose, T. Cross, C. Munday and F. Sobora,
The University of New England (Australia)
10:15 - 11:00 Coffee Break
11:00 - 12:00 Invited Talk - Hassan Ait-Kaci
12:00 - 1:30 Lunch (Provided)
Session 5: Programming in Conceptual Graphs
1:30 - 2:00 "Object Oriented Conceptual Graphs"
Gerard Ellis, RMIT (Australia)
2:00 - 2:30 "A Direct Proof Procedure for Definite Conceptual Graph
Programs"
Bikash Chandra Ghosh and Vilas Wuwongse,
Asian Institute of Technology (Thailand)
2:30 - 3:00 Coffee Break
Session 6: Machine Learning / Knowledge Acquisition
3:00 - 3:30 "Conceptual Clustering of Complex Objects: A Generalization
Space based Approach"
Isabelle Bournaud and Jean-Gabriel Ganascia,
Universite Paris 6 (France)
3:30 - 3:45 "Gabels: A Learning System Based on a Hypergraph Model"
Olivier Brissac and Michel Liquiere,
Universite La Reunion (France)
3:45 - 4:00 "Distributive Concept Exploration: A Knowledge Acquisition
Tool in Formal Concept Analysis"
Gerd Stumme, Technische Hochschule Darmstadt (Germany)
4:00 - 4:15 "Links between Electronic Documents and a Knowledge Base of
Conceptual Graphs"
Philippe Martin, INRIA (France)
4:15 - 4:45 "Using empirical subsumption to reduce the search space in
learning"
Marc Champesme,
Laboratoire d'Informatique de Paris-Nord (France)
4:45 - 5:30 Panel Discussion - Role of Graph Theory in Conceptual Graphs
WEDNESDAY August 16
8:00 - 9:00 Registration/Officers Meeting
Session 7: Hardware and Implementation
9:00 - 9:30 "A New Parallelization of Subgraph Isomorphism Refinement
for Classification and Retrieval of Conceptual Structures"
James D. Roberts,
University of California, Santa Cruz (USA)
9:30 - 10:00 "Transputer Network Implementation of a Parallel Projection
Algorithm for Conceptual Graphs"
Alfred Chan and P. Kocura, Loughborough (United Kingdom)
10:00 - 10:30 "Spanning Tree Representations of Graphs and Orders in
Conceptual Structures"
Andrew Fall, Simon Fraser University (Canada)
10:30 - 11:00 Coffee Break
11:00 - 12:00 Invited Talk - Norman Foo
12:00 - 1:30 Lunch (Provided)
Session 8: Logic, Existential Graphs and Peirce
1:30 - 2:00 "Existential Graphs and Dynamic Predicate Logic"
Harmen van den Berg, University of Twente (The Netherlands)
2:00 - 2:30 "Existential Graphs and Discourse Representation"
Tim Fernando, Universitat Stuttgart (Germany)
2:30 - 2:45 "Conceptual Graphs and Peirce Logic"
John E. Heaton and Pavel Kocura,
Loughborough University of Technology (United Kingdom)
2:45 - 3:00 "The Philosophical Context of Peirce's Existential Graphs"
Mary Keeler, Seattle (USA)
3:00 - 3:30 Coffee Break
Session 9: Graph Operations / Other Representations
3:30 - 4:00 "On Implementing Contexts and Negation in Conceptual Graphs"
John Esch, Unisys Government Systems Group (USA) and
Robert A. Levinson, University of California, Santa Cruz (USA)
4:00 - 4:15 "Visual Structure Representation Language for Conceptual
Structures"
Andrew L. Burrow and Peter W. Eklund,
University of Adelaide (Australia)
4:15 - 4:45 "A Linear Descriptor for Conceptual Graphs and a Class
for Polynomial Isomorphism Test"
Olivier Cogis and Olivier Guinaldo, LIRMM (France)
4:45 - 5:00 "Representing and Querying Complex Conceptual Structures in
the Framework of NKRL, the ``Narrative Knowledge Representation
Language''
Gian Piero Zarri,
Centre National de la Recherche Scientifique (France)
THURSDAY August 17
Session 10: Graph Matching / Knowledge Acquisition
9:00 - 9:30 "Projection and Unification for Conceptual Graphs"
Mark Willems, Vrije Universiteit Amsterdam (The Netherlands)
9:30 - 10:00 "A Novel Algorithm for Matching Conceptual and Related Graphs"
Jonathan Poole and J.A.Campbell,
University College London (United Kingdom)
10:00 - 10:30 Limitations of Conceptual Structures and the
Requirements of the Knowledge Modelling Community
D. Lukose (Australia) and G.Mineau (Canada)
10:30 - 11:00 Coffee Break
11:00 - 12:00 Invited Talk - Rudolf Wille
12:00 - 1:30 Lunch (Provided)
Session 11: Ontologies and Theory
1:30 - 2:00 "On the Ontology of Conceptual Graphs"
C. Hoede, University of Twente (The Netherlands)
2:00 - 2:15 "From Machine Readable Dictionaries to a Lexical Knowledge
Base of Conceptual Graphs"
Caroline Barriere, Simon Fraser University (Canada)
2:15 - 2:30 "An Algebraic Definition of Conceptual Graphs"
Guy W. Mineau, Denis Gauvreau (Universite Laval (Canada))
Rokia Missaoui (Universite du Quebex a Montreal (Canada))
2:30 - 3:00 "Conceptual Graphs and First-Order Logic"
Michel Wermelinger, University Nova de Lisboa (Portugal)
3:00 - 3:15 "Types, Type Hierarchies, and Canonical Graphs"
Clark A. Sexton, Kansas State University (USA)
3:15 - 3:45 Coffee Break
3:45 - 4:45 Invited Talk - John Sowa
4:45 - 5:15 General Meeting
5:30 Buffet Reception
FRIDAY August 18
8:00 - 9:00 Registration
9:00 - 5:00 Fourth PEIRCE Workshop: A Conceptual Graph Workbench
Chair: Peter Eklund (Australia)
PEIRCE is an international project, the purpose of which is to
integrate conceptual graph tool and application development. We shall
discuss implementation techniques for conceptual graphs, including
databases, programs, language standards, workbench programming
standards, dictionaries, and graphical user interfaces. Applications
and requirements for natural language processing, information systems
engineering, software engineering, and machine learning will be
included as well.
CONFERENCE LOCATION
Santa Cruz is located on scenic Highway 1 at the North tip of beautiful
Monterey Bay. San Francisco International Airport (75 min., 65 miles),
San Jose International Airport (45 min., 33 miles) and Monterey
Peninsula Airport (40 min., 35 miles) are all easy drives to Santa
Cruz.
ACCOMMODATIONS
The conference facility is on the University of California Santa Cruz
Campus. Family style apartments near the conference site will be
available for participants. To make an apartment reservation please
use the registration form on the next page. Additional "economy" rooms
in Residence Halls are available through Campus Guest Housing
(408)459-2611.
Since major conference activities will be in the unique campus setting
we highly recommend you arrange to stay on campus. However, local
hotels (such as Holiday Inn: 426-7100, $82 and Babbling Brook Bed and
Breakfast : 427-2437 $85-165 and others) are within 10-15 minutes of
the campus center. Reservations at these or other alternative
facilities should be made directly.
* * * * * * * * * * * * * * * **
AIRPORT TRANSPORTATION
Alpha Cab: 408-295-8001
Santa Cruz Airporter: (a shuttle) 408-423-1234
Auto Rental: Auto World: 408-423-9830 725 Soquel Ave. Santa Cruz.
Budget Rent-A-Car: 408-425-1808 919 Ocean Street - Santa Cruz
DIRECTIONS:
1. From San Francisco: Take 101 South to Highway 880 South which turns
into Highway 17 at San Jose. You'll drive over the scenic Santa Cruz
mountains on Highway 17 right into Santa Cruz. Exit
onto Hiway 1 to Half Moon Bay - follow UCSC signs.
2. From San Jose. Take Highway 17 over the Santa Cruz Mountains into
the heart of Santa Cruz. Exit onto Hiway 1 to Half Moon Bay - follow
UCSC signs.
3. From Monterey. Take Highway 1 North through the fertile agricultural
area of the Pajaro Valley to Santa Cruz.
Follow UCSC signs after entering Santa Cruz.
* * * * * * * * * * * * * * * **
ICCS'95 REGISTRATION FORM
Name: ___________________________________________________
Affiliation: ________________________________________________
Address: _________________________________________________
_________________________________________________________
Telephone: ___________________________
Fax: ________________________________
e-mail: ______________________________
Please indicate which event(s) for which you are registering.
Workshop registrants need not register for the Conference unless
they wish to do so.
___ $250 Conference fee (excl. workshop) before 7/15/94
___ $350 Conference fee (excl. workshop) after 7/15/94
___ $100 Student fee (excl. workshop) before 7/15/94
___ $150 Student fee (excl. workshop) after 7/15/94
___ $50 PEIRCE Workshop
___ $40 PEIRCE Workshop, student
___ FREE Conceptual Graphs Tutorial
Commuter Options:
If not registering for UCSC housing (see below)
you may register for:
parking: all week ($10)?
lunch: ($6/day) Specify days: 14? 15? 16? 17? 18?
3 meals: ($18/day) Specify days: 14? 15? 16? 17? 18?
Amount Enclosed: $________________
MAKE CHECKS PAYABLE TO "UC REGENTS"
Conference fee includes proceedings and receptions.
Payment must accompany the registration form. Checks must be in US
dollars only and payable to "UC REGENTS"
Please do not send cash. CREDIT CARDS WILL NOT BE ACCEPTED. Students
must provide a copy of a student I.D. card or a letter from an advisor
for proof of student status.
RETURN BY JULY 15, 1995 TO:
ICCS95-registration
Prof. Robert Levinson
225 Applied Sciences Building
Department of Computer and Information Sciences.
University of California at Santa Cruz
Santa Cruz, CA 95060
408-459-2087
FAX: 408-459-4829
e-mail: levinson@cse.ucsc.edu
* * * * * * * * * * * * * * * *
APARTMENT RESERVATION FORM
ICCS'95
August 14-18, 1995
University of California Santa Cruz Apartments
Please reserve the following accommodations:
[Base rates are per person/per room/per night.]
___ $70.25 Single Occupancy - basic $84.25 -deluxe
(send $281.00) (send $337.00)
___ $58.25 Double Occupancy - basic $71.50 - deluxe
(send $233.00) (send $286.00)
Basic includes fresh towels and linens but no housekeeping.
Deluxe includes full daily house-keeping.
Housing includes 3 meals per day in dining hall.
Arrival Date: ____________
Departure Date: ____________
___ Smoking ___ Non-smoking
Desired Roomate ____________ (if doubling).
[Roommate will be assigned if not specified.]
___ Deposit check enclosed in the amount of $ ____________
(send amount indicated above.)
Name: ___________________________________________
Affiliation: _________________________________________
Address: __________________________________________
__________________________________________________
Telephone: _________________________________________
Fax: ______________________________________________
All reservations must be accompanied by a deposit of four nights
room rate: August 14,15,16,17
SEND BY JULY 15, 1994 TO:
Housing Reservations
Prof. Robert Levinson
225 Applied Sciences Building
Department of Computer and Information Sciences.
University of California at Santa Cruz
Santa Cruz, CA 95060
408-459-2087
FAX: 408-459-4829
End of NL-KR Digest
*******************
