leon@alpha.ces.cwru.edu (Leon Sterling ) (06/22/89)
The 1989 North American Conference on Logic Programming Case Western Reserve University Cleveland, Ohio October 16-20, 1989 Preliminary Schedule and Registration Information General Chairman: Leon Sterling Program Co-Chairmen: Ewing L. Lusk and Ross Overbeek Program Committee Howard Blair, Syracuse University, Syracuse, USA Maurice Bruynooghe, Katholicke Universiteit, Leuven, Belgium Saumya Debray, University of Arizona, Tucson, USA Al Despain, Univ. of Southern California, Los Angeles, USA Doug DeGroot, Texas Instruments, Dallas, USA Ian Foster, Argonne National Laboratory, Argonne, USA Susan Gerhart, MCC, Austin, USA Joxan Jaffar, IBM Research, Yorktown Heights, USA Ken Kahn, Xerox PARC, Palo Alto, USA L.V. Kale, Univ. of Illinois, Urbana-Champaign, USA Paris Kanellakis, Brown Univ., Providence, USA Robert Kowalski, Imperial College, London, UK Vipin Kumar, Univ. of Texas, Austin, USA Ken Kunen, Univ. of Wisconsin, Madison, USA Catherine Lassez, IBM Research, Yorktown Heights, USA Ewing L. Lusk, Argonne National Laboratory, Argonne, USA Maurizio Martelli, CNUCE - C.N.R., Pisa, Italy Chris Mellish, Univ. of Edinburgh, Edinburgh, UK Richard O'Keefe,Quintus, Auckland, New Zealand Ross Overbeek, Argonne National Laboratory, Argonne, USA Raghu Ramakrishnan, Univ. of Wisconsin, Madison, USA Vijay Saraswat, Xerox PARC, Palo Alto, USA Leon Sterling, Case Western Reserve Univ., Cleveland, USA Peter Szeredi, Univ. of Bristol, Bristol, UK Hidehiko Tanaka, Univ. of Tokyo, Tokyo, Japan Akikazu Takeuchi, Mitsubishi, Amagasaki, Japan Rodney Topor, Univ. of Melbourne, Melbourne, Australia David S. Warren, SUNY Stony Brook, Stony Brook, USA Sunday, October 15, 1989 Registration: 4:00 - 7:00 pm - Tomlinson Hall Informal Locations: All conference events take place on the campus of Case Western Reserve University. Registration: Sunday, October 15, 1989 4:00-7:00 pm Tomlinson Hall Monday, October 16, 1989 all day starting at 8:00 am Baker Building - Ground Floor Tuesday, October 17, 1989 7:30-9:00 am Baker Building - Ground Floor Monday, October 16, 1989 Tutorials All Day 8:30 am - 10:30 am Logic for Logic Programmers Kenneth Kunen University of Wisconsin Madison, WI Abstract The goal of logic programming is that the program, or database, can be understood by logic alone, independently of any execution model. Attempts to realize this goal have made it clear that the logic involved must go beyond ordinary first-order logic. This tutorial will explore several topics of current interest in the logical meaning of logic programs, with particular attention paid to: (1) The meaning of negation; this still remains problematical, and is related to topics in AI such as non-monotonic reasoning and circumscription. (2) The meaning of recursions; these imply a least fixed-point computation, but Prolog and deductive database languages differ as to the nature of this fixed-point. (3) Incomplete data structures ; these are used to represent streams in concurrent prologs, and as a substitute for pointers in all prologs. STRAND Ian Foster Argonne National Laboratory Argonne, IL Abstract Strand is a concurrent logic programming language designed for efficient execution on parellel computers. It is the first parallel programming language to be available on a wide variety of multiprocessor architectures. The aim of this tutorial is to show how Strand is used to develop portable parellel applications. An introduction to the language will present basic concepts and fundamental programming techniques. A number of case studies will then be covered in depth. In each case, a problem will be described, a parellel algorithm developed, and the implementation of the algorithm on various classes of parellel computer considered. Introduction to Logic Programming and Prolog Bill Kornfeld Lyons Park Systems California Abstract This tutorial supplies a broad introduction to the field of logic programming. The emphasis is on practical application rather than theoretical issues. The goal of the tutorial is to supply answers to two questions: "What is exciting about the concept of logic programming and where might it fit in the world of to,orrow?" and "Can Prolog be useful to me in solving a particular problem today?" Monday, October 16, 1989 11 am - 1:00 pm Abstract Interpretation on Logic Programs Harald Sondergaard University of Melbourne Australia Abstract Abstract interpretation offers a conceptual model for dataflow analysis and a method for design and verification of specific analyses. The idea is to regard a dataflow as a non- standard, or approximate, semantics in which descriptions of data, rather than data objects themselves, are manipulated . The tutorial is aimed towards anybody interested in theoretical foundations for debuggers, compilers, and transformation tools for logic programming languages. General knowledge of logic programming is assumed, and some familiarity with semantic models for logic programs would be an advantage. A handout will be provided. Molecular Genetics Project - Applications of Logic Programming in Genome Sequencing Project Ross Overbeek Argonne National Lab Argonne, IL This tutorial will offer a brief introduction to the topic of genome sequencing projects, followed by a detailed description of prototypical problems that have been successfully addressed using logic programming techniques. For a number of reasons, the Human Genome Project offers an excellent potential application area for logic programmers. I will offer a tutorial overview of the basic concepts, discuss our experiences in attempting to support molecular biologists, and offer opinions on specific potential applications. Prolog for Expert Systems Fumio Mizoguchi Science University of Tokyo Japan Abstract A survey is given on the use of Prolog for building expert systems. The strengths and limitations of Prolog for expert systems will be discussed. Finally, an overview of expert systems activities in Japan will be given focussing on the Fifth Generation project. Logic Grammars for Natural Language and Compiling Harvey Abramson University of Bristol U.K. Abstract The primary intent of the tutorial is to show how logic programming is naturally suited to applications involving both natural and formal grammars. The tutorial begins with the earliest connections drawn between resolution on Horn clauses and grammatical processing and then proceeds to consider subsequent formalisms and applications to both natural language processing and to compilation of programming languages. We shall use the tutor's Definite Clauses Translation Grammars, a logical version of Attribute Grammars, to illustrate compilation from natural language to logical form, and from a simple programming language to machine code. These examples will be naive, but we shall point out developments in the areas of bottom up parsing, chart parsing, unification based parsing, deterministic grammar formalisms for compiler applications, applications of metaprogramming in linguistics applications and the possibility of using parallelism and concurrency in language processing. Monday, October 16 2:30 pm - 4:30 pm Logic Programming Schemes Keith L. Clark Imperial College of Science & Technology Abstract Incomplete survey of a succession of proposed logic programming language schemes all of which can be considered variants or descendants of the original Kowalski scheme. Semantics properties and implementation issues are discussed. Constraint Logic Programming for Options Trading Catherine Lassez Abstract OTAS is an experimental options analysis system that was developed at IBM T.J. Watson Research Center to illustrate how this The CLP scheme encapsulates the two paradigms of constraint solving and logic programming and defines a formal framework for a new class pf program OTAS is written in CLP(R), a CLP language over the domain R of real arithmetic. CLP(R) provides a unified framework to reason with and about arithmetic constraints. Because arithmetic constraints are basic terms of the language, they are treated declaratively and because logic programming is imbedded. This tutorial is organized as follows: in a first part, we will outline the motivations for the OTAS project and explain the concept of the constraint logic programming. Finally, we will describe OTAS, emphasizing its various functions, overall architecture and interactive capabilities to illustrate further the CLP concept. A 15 minute demonstration videotape of OTAS will complete the presentation. Partial Evaluation Jan Komorowski Professor of Computer Science Abo Akademi Finland Technical session schedule Opening Address: 9:00 a.m. Tues, Oct. 17 ABSYS: The First Logic programming Language - a Retrospective and Commentary, E.W. Elcock Session 1: Constraint Logic Programming 10:45am, Tues., Oct. 17 Extending Hierarchical Constraint Logic Programming: Nonmonotonicity and Inter-Hierarchy Comparison by Molly Wilson and Alan Borning Expanding Query Power in Constraint Logic Programming Languages by Michael J. Maher and Peter J. Stuckey Simplification and Elimination of Redundant Linear Arithmetic Constraints by J. L. Lassez, K. McAloon, and T. Huynh On Meta-Programming in CLP(R) by Nevin Heintze, Spiro Michaylov, Peter Stuckey, and Roland Yap Session 2: Proof Theory 10:45am, Tues., Oct. 17 Characterizing Termination of Logic Programs with Level Mappings by Marc Bezem A Syntactic Characterization of Minimal Entailment by Marek A. Suchenek Computing Answers to Logic Programs with Weak Model Elimination by Marco Antonio Casanova, Ramiro Affonso de Tadeu Guerreiro, and Andrea Silva Monadic Cases: Rediscovering Input Resolution by Toshiro Wakayama Session 3: Abstract Interpretation 2:00pm, Tues., Oct. 17 Path-Dependent Reachability Analysis for Multiple Specialization by Will Winsborough Accurate and Efficient Approximation of Variable Aliasing in Logic Programs by Dean Jacobs and Anno Langen Determination of Variable Dependence Information at Compile Time through Abstract Interpretation by K. Muthukumar and Manuel Hermenegildo Session 4: Applications 2:00pm, Tues., Oct. 17 Investigating the Linguistics of DNA with Definite Clause Grammars by David B. Searls An Expert System Which Intelligently Accesses an External Database by Xiaoping He, George W. Ernst, and Fred Discenzo Automatic Ordering of Subgoals - A Machine Learning Approach by Shaul Makovitch and Paul D. Scott Session 5: Nonmonotonic Logic Programming 4:00pm, Tues., Oct. 17 Stable Semantics for Logic Programs and Default Theories by W. Marek and M Truszczynski Convergence Issues and Fixed Points of Non-Monotone Maps by Aida Batarekh A Truth Maintenance System Based on Stable Models by Stephen G. Pimental and John L. Cuadrado Supported Circumscription and Its Relation to Logic Programming with Negation by Jia Huai You and Liwu Li Session 6: Parallel Implementations 4:00pm, Tues., Oct. 17 Compiled Execution of the REDUCE-OR Process Model on Multiprocessors by B. Ramkumar and L. V. Kale Combined And-Or Parallel Execution of Logic Programs on Shared Memory Multiprocessors by Gopal Gupta and Bharat Jayaraman Restricted And-Parallelism with Side-Effects by Si-En Chang and Y. Paul Chiang On the Correctness and Efficiency of Independent And-Parallelism in Logic Programs by Manuel Hermenegildo Obtaining First Solution Faster in AND and OR Parallel Execution of Logic Programs by Vikram Saletore and L. V. Kale Session 7: Software Engineering 9:00am, Wed., Oct. 18 Generalization and Program Schemata: A Step Towards Computer-Aided Construction of Logic Programs by Yves Deville and Jean Burnay Incorporating Programming Techniques into Prolog Programs by Arun Lakhotia Logic Programming in a Software Engineering Perspective by Paola Mello, Antonio Natali, and Cristina Ruggieri Session 8: Constructive Negation 9:00am, Wed., Oct. 18 On Constructive Negation in Logic Programming by Teodor C. Przymusinski Fail Substitutions for Negation as Failure by Jan Maluszynski and Torbjorn Naslund An Extension of Constructive Negation and its Application in Coroutining by David Chan Session 9: Concurrent Logic Programming 11:15am, Wed., Oct. 18 Strand: a Practical Parallel Programming Language by Ian Foster and Stephen Taylor Money as a Concurrent Logic Program by Kenneth M. Kahn and William A. Kornfeld Variable-Free Execution of Concurrent Logic Languages by Sven-Olof Nystrom Existential Constraints, Reactive Behaviors, and Fully Abstract Compositional Semantics of Concurrent Logic Programs by Haim Gaifman, Michael J. Maher, and Ehud Shapiro Session 10: Semantics 11:15am, Wed., Oct. 18 A Stratification Semantics for General Disjunctive Programs by Arcot Rajasekar and Jack Minker On the Generalized Predicate Completion of NonHorn Program by Phan Minh Dung and Kanchana Kanchanasut A Fixpoint Approach to Declarative Semantics of Logic Programs by Phan Minh Dung and Kanchana Kanchanasut A Kripke-like Model for Negation as Failure by James Harland Session 11: Program Transformation 2:30pm, Wed., Oct. 18 Partial Evaluation in Prolog: Some Improvements about Cuts and Control by M. Bugliesi and F. Russo Deriving an Efficient Production System by Partial Evaluation by Koichi Furukawa, Hiroshi Fujita, and Toramatsu Shintani Synthesis of Recursive Logic Procedures from First-order Logic Specifications by Structured Fold-unfold by K. K. Lau and S. D. Prestwich Session 12: Performance of Parallel Systems 2:30pm, Wed., Oct. 18 Expected Performance of the Randomized Parallel Backtracking Method by Zheng Lin Performance of Aurora on an Hierarchical Memory Multiprocessor by Shyam Mudambi Performance Analysis of the Aurora Or-Parallel Prolog System by Peter Szeredi Session 13: Logic Grammars 4:30pm, Wed., Oct. 18 Narrowing Grammar: A Comparison with Other Logic Grammars by H. Lewis Chau Discourse Understanding in Logic by Arendse Bernth Semantic Specification Using Logic Programs by Srinivas R. Sataluri and Arthur C. Fleck Invited talk: Thurs, Oct. 18, 9:00 a.m. The XWAM: A Machine that Integrates Prolog and Deductive Database Query Evaluation, David S. Warren Session 14: Database I 10:45am, Thurs., Oct. 19 Database Updates and Transactions in LDL by Ravi Krishnamurthy, Shamim Naqvi, and Carlo Zaniolo Processing Multiple Linear Recursions by Jiawei Han and Ling Liu Expressing Database Queries with Intuitionistic Logic by Anthony J. Bonner, Kumar Vadaparty, and L. Thorne McCarty Abductive Reasoning with Complex Structures by Weidong Chen and David Scott Warren Session 15: Implementation Topics 10:45am, Thurs., Oct. 19 Event Handling in Prolog by Micha Meier On the Adequacy of Direct Mapped Caches for Lisp and Prolog Data Reference Patterns by V.S. Madan, C.J. Peng, and G.S. Sohi Optimization Techniques Using the MRB and Their Evaluation on the Multi-PSI/V2 by Yu Inamura, Nobuyuki Ichiyoshi, Kazuaki Rokusawa, and Katsuto Nakajima The Garbage Collection System for Parallel Inference Engine PIE64 by Lu Xu, Hanpei Koike, and Hidehiko Tanaka Session 16: Database II 2:00pm, Thurs., Oct. 19 On the Detection and Elimination of Redundant Derivations During Bottom-up Execution by A. Richard Helm Deja Vu in Fixpoints of Logic Programs by Michael J. Maher and Raghu Ramakrishnan Propagating Constraints in Recursive Deductive Databases by David B. Kemp, Krishnamurthy Meenakshi, Kotagiri Ramamohanarao, and Isacc Balbin Session 17: WAM I 2:00pm, Thurs., Oct. 19 Indexing Prolog Clauses by Bart Demoen, Andre Marien, and Alain Callebaut WINTER: WAMS IN Tim Expression Reduction by Damir Jamsek, Kevin J. Greene, Shiu-Kai Chin, and Paul R. Humenn On the Management of E and B in WAM by Andre Marien and Bart Demoen Session 18: Extensions to Logic Programming 4:00pm, Thurs., Oct. 19 Programming with Equations, Subsets, and Relations by Bharat Jayaraman and David A. Plaisted On the Expressive Power of Annotation-Based Logic Programs by Michael Kifer and V. S. Subrahmanian HiLog: A First-Order Semantics for Higher-order Logic Programming Constructs by Weidong Chen, Michael Kifer, and Dvid S. Warren Inference of Polymorphic Types for Logic Programs by Changwoo Pyo and Uday S. Reddy Session 19: WAM II 4:00pm, Thurs., Oct. 19 Unification Parallelism: How Much Can We Exploit? by Ashok Singhai and Yale Patt An Intermediate Language to Support Prolog's Unification by Peter Van Roy Performance Evaluation of the Sequential Inference Machine CHI-II by Akihiko Konagaya, Shinichi Habata, Atsushi Atarashi, and Minoru Yokota Towards a WAM Model for Lambda-Prolog by Gopalan Nadathur and Bharat Jayaraman Additional Information Conference Desk: The conference desk is located on the ground floor of Crawford Hall. The telephone numbers for emergencies and messages are (216) 368-6197, 368-2800 and 368-5278. The mailing address is NACLP '89, Marcy Sanford - Conference Secretary, Case Western Reserve University, Department of Computer Engineering and Science, 10900 Euclid Avenue, Cleveland, Ohio 44106. Meals: A continental breakfast and informal lunch will be provided for all registrants at the conference. Travel arrangements: Domestic travelers can call USAir (code number ACW320J) or Delta Airlines (file number G16046) with 5% off all published discount fares or 40% off published round trip coach fares. Ticketing must be made 14 days in advance. Special arrangement have been made for your convenience. Registration: If you plan to attend the conference, please copy the registration form in this messgae and return it with the total registration fee as promptly as possible. Complete separate registration forms for each person attending (use photocopies if necessary). Remittances should be made by cash or check and money order in U.S. dollars (drawn on U.S. bank only), payable to the North American Conference on Logic Programming. Registration Fees (in US dollars only) Before August 30, 1989 After August 30, 1989 Member of ALP $225.00 $260.00 Non-Member $260.00 $295.00 Student $120.00 $150.00 Registration fees will cover the technical session of the conference, the opening reception, the entertainment provided, general processing fees, breakfast and lunch daily, banquet and one copy of the published proceedings per registrant. (The banquet is not covered for students). Participants are encouraged to register as early as possible. Registration Confirmation: A receipt will be sent to each registrant after the registration fee is paid in full. This receipt should be presented at the time of the conference in order to receive conference materials. Late registrants can pick up their receipts at the conference. Cancellations: To be eligible for a refund of the registration fees, written notification of cancellation must be received NO LATER than September 15, 1989. An administrative fee of $25.00 will be deducted from the refund. Cancellations requested after the deadline date will not be eligible for a refund. General Information Located approximately fifteen minutes east of downtown Cleveland, Case Western Reserve University is in the heart of the University Circle area. There are several downtown hotels. However, the closest to the conference site is the Clinic Center Hotel, less than a mile away. Regular shuttles have been arranged between the hotel and CWRU for the conference. NACLP-89 has a block reservation at the Clinic Hotel and Holiday Inn Lakeside (located downtown). The Organizing Committee recommends that conference attendees take advantage of the reduced rates and accessibility through NACLP-89. The block reservation is limited, please make your reservations as early as possible. Clinic Center Hotel One Person Two Persons Extra Person E. 96th & Carnegie $64.00 $78.00 $10.00 Cleveland, Ohio 44106 1-800-321-7100 within 10 minutes walking distance (the preferred choice) Holiday Inn Lakeside Single Double Triple Quad 1111 Lakeside Avenue $53.00 $58.00 $63.00 $68.00 Cleveland, Ohio 44114 (216) 241-5100 located downtown Cleveland, approximately 15 minute bus ride Al Cazar Dorm accommodation for students $45.00 single only 2450 Derbyshire Road Cleveland Hts., OH 44106 (216) 321-5400 20 minutes walking distance Visitors arriving at Cleveland Hopkins Airport can reach the University by public transportation. The Rapid Transit ($1, exact fare required) boards at the airport and stops at University Circle. From there a free shuttle bus brings visitors to the campus. Persons renting cars may reach the campus by taking I-71 north to I-90 to Carnegie or Chester Avenues. Proceed east to the University. Workshops: Workshops will be held on Friday, October 20, 1989 if there is sufficient interest. Catherine Lassez is co-ordinating the workshop proposals. Registration Form for North American Conference on Logic Programming 1989 ------------------------------------------------------------------------- Return this registration form to Marcy Sanford, Conference Secretary, NACLP-89, Department of Computer Engineering and Science, Case Western Reserve University, 10900 Euclid Avenue, Cleveland, Ohio 44106. Full remittance must accompany this form so that the registration can be processed. Please type or print legibly Last Name____________________________________________________ First Name___________________________________________________ Affiliation____________________________________________________ Mailing Address________________________________________________ Telephone/Telex_______________________________________________ E-mail Address_________________________________________________ Name(s) of accompanying person(s)_________________________________ Would you like to have special activities for an accompanying person?_______ Programming for accompanying persons is contingent on the number of positive responses. (Please circle) Registration Fees BEFORE August 30, 1989 AFTER August 30, 1989 Member of ALP $225.00 $260.00 Non-Member $260.00 $295.00 Student $120.00 $150.00 Tutorial Sessions 1 session 2 sessions 3 sessions Registrant w/conference $60.00 $80.00 $100.00 Registrant w/o conference $260.00 $280.00 $300.00 Student $30.00 $40.00 $50.00 Total Registration Fees $_____________ ____________________________________________________________ HOTEL REGISTRATION (optional - can be done with credit cards) Card type and number - expiration date______________________________ Arrival Date_____________ Departure Date____________ Hotel Desired (see above )________________________________________ Accommodation Desired single double triple quad Room Rate $_____________ TOTAL REMITTANCE (In US currency only) $____________ Remittance payable to: NACLP '89 Payment: Money Order Check Cash
leon@mozart.CES.CWRU.Edu (Leon Sterling ) (09/06/89)
The 1989 North American Conference on Logic Programming
Case Western Reserve University
Cleveland, Ohio
October 16-20, 1989
PROGRAM AND REGISTRATION FORMS:
General Chairman: Leon Sterling, Case Western Reserve University
Program Co-Chairmen: Ewing L. Lusk and Ross Overbeek, Argonne National Lab
Conference Secretary: Marcy Sanford
Program Committee:
Howard Blair, Syracuse University, Syracuse, USA
Maurice Bruynooghe, Katholicke Universiteit, Leuven, Belgium
Saumya Debray, University of Arizona, Tucson, USA
Al Despain, Univ. of Southern California, Los Angeles, USA
Doug DeGroot, Texas Instruments, Dallas, USA
Ian Foster, Argonne National Laboratory, Argonne, USA
Susan Gerhart, MCC, Austin, USA
Joxan Jaffar, IBM Research, Yorktown Heights, USA
Ken Kahn, Xerox PARC, Palo Alto, USA
L.V. Kale, Univ. of Illinois, Urbana-Champaign, USA
Paris Kanellakis, Brown Univ., Providence, USA
Robert Kowalski, Imperial College, London, UK
Vipin Kumar, Univ. of Texas, Austin, USA
Ken Kunen, Univ. of Wisconsin, Madison, USA
Catherine Lassez, IBM Research, Yorktown Heights, USA
Ewing L. Lusk, Argonne National Laboratory, Argonne, USA
Maurizio Martelli, CNUCE - C.N.R., Pisa, Italy
Chris Mellish, Univ. of Edinburgh, Edinburgh, UK
Richard O'Keefe,Quintus, Auckland, New Zealand
Ross Overbeek, Argonne National Laboratory, Argonne, USA
Raghu Ramakrishnan, Univ. of Wisconsin, Madison, USA
Vijay Saraswat, Xerox PARC, Palo Alto, USA
Leon Sterling, Case Western Reserve Univ., Cleveland, USA
Peter Szeredi, Univ. of Bristol, Bristol, UK
Hidehiko Tanaka, Univ. of Tokyo, Tokyo, Japan
Akikazu Takeuchi, Mitsubishi, Amagasaki, Japan
Rodney Topor, Univ. of Melbourne, Melbourne, Australia
David S. Warren, SUNY Stony Brook, Stony Brook, USA
INVITED SPEAKERS
E.W. Elcock, University of Western Ontario, London, Canada
D.S. Warren, SUNY Stony Brook, Stony Brook, USA
BANQUET SPEAKER
J. Minker, University of Maryland, College Park, USA
_______________________________________________________________________________
CONFERENCE OVERVIEW
Sunday, October 15
4:00-7:00 p.m. Registration, Baker Building and Clinic Center Hotel
Monday, October 16
8:00 a.m. - 6:00 p.m. Registration, Baker Building
8:30 a.m. - 4:30 p.m. Tutorials, Baker Building Classrooms
6:00 p.m. - 7:30 p.m. Opening Reception, Tomlinson Hall
Tuesday, October 17
8:00 a.m. - 2:30 p.m. Registration, Baker Building
9:00 a.m. - 6:30 p.m. Technical Sessions, Strosacker and Hatch Auditoriums
9:30 a.m. - 6:00 p.m. Exhibits, Crawford Hall Basement
Wednesday, October 18
8:00 a.m. - 4:30 p.m. Registration, Crawford Hall, Basement
9:00 a.m. - 6:00 p.m. Technical Sessions, Strosacker and Hatch Auditoriums
9:30 a.m. - 6:00 p.m. Exhibits, Crawford Hall Basement
7:00 p.m. Banquet, BP America Building, Downtown Cleveland
Thursday, October 19
8:00 a.m. - 4:30 p.m. Registration, Crawford Hall Basement
9:00 a.m. - 6:00 p.m. Technical Sessions, Strosacker and Hatch Auditoriums
9:30 a.m. - 6:00 p.m. Exhibits, Crawford Hall Basement
TUTORIAL DESCRIPTIONS and TIMES
T1 Logic for Logic Programmers, 8:30 am - 10:30 am
Kenneth Kunen University of Wisconsin Madison, WI
Abstract
The goal of logic programming is that the program, or
database, can be understood by logic alone, independently of
any execution model. Attempts to realize this goal have made
it clear that the logic involved must go beyond ordinary
first-order logic. This tutorial will explore several topics
of current interest in the logical meaning of logic programs,
with particular attention paid to: (1) The meaning of
negation; this still remains problematical, and is related to
topics in AI such as non-monotonic reasoning and
circumscription. (2) The meaning of recursions; these imply a
least fixed-point computation, but Prolog and deductive
database languages differ as to the nature of this
fixed-point. (3) Incomplete data structures ; these are used
to represent streams in concurrent prologs, and as a
substitute for pointers in all prologs.
T2 Parallel Programming in STRAND
Ian Foster Argonne National Laboratory Argonne, IL
Abstract
Strand is a concurrent logic programming language designed for
efficient execution on parellel computers. It is the first
parallel programming language to be available on a wide
variety of multiprocessor architectures. The aim of this
tutorial is to show how Strand is used to develop portable
parellel applications. An introduction to the language will
present basic concepts and fundamental programming techniques.
A number of case studies will then be covered in depth. In
each case, a problem will be described, a parellel algorithm
developed, and the implementation of the algorithm on various
classes of parellel computer considered.
T3 Introduction to Logic Programming and Prolog
Bill Kornfeld Lyons Park Systems California
Abstract
This tutorial supplies a broad introduction to the field of
logic programming. The emphasis is on practical application
rather than theoretical issues. The goal of the tutorial is
to supply answers to two questions: "What is exciting about
the concept of logic programming and where might it fit in the
world of to,orrow?" and "Can Prolog be useful to me in solving
a particular problem today?"
Monday, October 16, 1989 11 am - 1:00 pm
T4 Abstract Interpretation on Logic Programs
Harald Sondergaard University of Melbourne Australia
Kim Marriott IBM Watson Research Center, New York
Abstract
Abstract interpretation offers a conceptual model for dataflow
analysis and a method for design and verification of specific
analyses. The idea is to regard a dataflow as a non-
standard, or approximate, semantics in which descriptions of
data, rather than data objects themselves, are manipulated .
The tutorial is aimed towards anybody interested in
theoretical foundations for debuggers, compilers, and
transformation tools for logic programming languages. General
knowledge of logic programming is assumed, and some
familiarity with semantic models for logic programs would be
an advantage. A handout will be provided.
T5 Molecular Genetics Project - Applications of Logic Programming
in Genome Sequencing Project
Ross Overbeek Argonne National Lab Argonne, IL
This tutorial will offer a brief introduction to the topic of
genome sequencing projects, followed by a detailed description
of prototypical problems that have been successfully addressed
using logic programming techniques. For a number of reasons,
the Human Genome Project offers an excellent potential
application area for logic programmers. I will offer a
tutorial overview of the basic concepts, discuss our
experiences in attempting to support molecular biologists, and
offer opinions on specific potential applications.
T6 Prolog for Expert Systems
Fumio Mizoguchi Science University of Tokyo Japan
Koichi Furukawa ICOT Japan
Abstract
A survey is given on the use of Prolog for building expert
systems. The strengths and limitations of Prolog for expert
systems will be discussed. Finally, an overview of expert
systems activities in Japan will be given focussing on the
Fifth Generation project.
T7 Logic Grammars for Natural Language and Compiling
Harvey Abramson University of Bristol U.K.
Abstract
The primary intent of the tutorial is to show how logic
programming is naturally suited to applications involving both
natural and formal grammars. The tutorial begins with the
earliest connections drawn between resolution on Horn clauses
and grammatical processing and then proceeds to consider
subsequent formalisms and applications to both natural
language processing and to compilation of programming
languages. We shall use the tutor's Definite Clauses
Translation Grammars, a logical version of Attribute Grammars,
to illustrate compilation from natural language to logical
form, and from a simple programming language to machine code.
These examples will be naive, but we shall point out
developments in the areas of bottom up parsing, chart parsing,
unification based parsing, deterministic grammar formalisms
for compiler applications, applications of metaprogramming in
linguistics applications and the possibility of using
parallelism and concurrency in language processing.
Monday, October 16 2:30 pm - 4:30 pm
T8 Logic Programming Schemes
Keith L. Clark Imperial College of Science & Technology
Abstract
Incomplete survey of a succession of proposed logic
programming language schemes all of which can be considered
variants or descendants of the original Kowalski scheme.
Semantics properties and implementation issues are discussed.
T9 Constraint Logic Programming for Options Trading
Catherine Lassez IBM Watson Research Center, New York
Abstract
OTAS is an experimental options analysis system that was
developed at IBM T.J. Watson Research Center to illustrate how
the CLP scheme encapsulates the two paradigms of
constraint solving and logic programming. OTAS is written in
CLP(R), a CLP language over the domain R of real arithmetic.
CLP(R) provides a unified framework to reason with and about
arithmetic constraints. Because arithmetic constraints are
basic terms of the language, they are treated declaratively.
This tutorial is organized as follows: in a first part, we will
outline the motivations for the OTAS project and explain the
concept of constraint logic programming. Finally, we will describe
OTAS, emphasizing its various functions, overall architecture
and interactive capabilities to illustrate further the CLP
concept. A 15 minute demonstration videotape of OTAS will
complete the presentation.
T10 Partial Evaluation
Jan Komorowski Prof. of Computer Science Abo Akademi, Finland
Partial deductions (a generalization of the concept of partial
evaluation in logic programming) is a universal apradigm for
transformation of deductive systems. Its applications range from
powerful program transformation like automatic generation of compilers
from meta-interpreters, to machine learning, to optimization of
knowledge-bases and inference engines. In the tutorial we will provide
the theoretical foundations for aprtial deduction in logic programming
and illustrate the principles with a number of examples performed in a
Macintosh-based environment for partial deductions. Tutorial
participants will have the opportunity for hands-on experience with
the environment.
________________________________________________________________________
TECHNICAL SESSION SCHEDULE:
Opening Remarks: 9:00 a.m. Tues, Oct. 17 Leon Sterling, Ewing Lusk
Invited talk: 9:15 a.m. ABSYS: The First Logic programming Language - a Retrospective
and Commentary, E.W. Elcock
Session 1: Constraint Logic Programming 10:45am - 12:45am, Tues., Oct. 17
Extending Hierarchical Constraint Logic Programming: Nonmonotonicity
and Inter-Hierarchy Comparison
by Molly Wilson and Alan Borning, University of Washington
Expanding Query Power in Constraint Logic Programming Languages
by Michael J. Maher and Peter J. Stuckey, IBM Research Center
Simplification and Elimination of Redundant Linear Arithmetic
Constraints
by J. L. Lassez, K. McAloon, and T. Huynh, IBM Research Center
On Meta-Programming in CLP(R)
by Nevin Heintze, Spiro Michaylov, Peter Stuckey, and Roland Yap,
Carnegie Mellon University and IBM Research Center
Session 2: Proof Theory 10:45am- 12:45am, Tues., Oct. 17
Characterizing Termination of Logic Programs with Level Mappings
by Marc Bezem, Center for Math. & Computer Science, Netherlands
A Syntactic Characterization of Minimal Entailment
by Marek A. Suchenek, Wichita State University
Computing Answers to Logic Programs with Weak Model Elimination
by Marco Antonio Casanova, Ramiro Affonso de Tadeu Guerreiro, and Andrea Silva,
IBM Scientific Center, Brazil
Monadic Cases: Rediscovering Input Resolution
by Toshiro Wakayama, Syracuse University
Session 3: Abstract Interpretation 2:00pm-3:30pm, Tues., Oct. 17
Path-Dependent Reachability Analysis for Multiple Specialization
by Will Winsborough, Argonne National Lab
Accurate and Efficient Approximation of Variable Aliasing in Logic Programs
by Dean Jacobs and Anno Langen, University of Southern California
Determination of Variable Dependence Information at Compile Time
through Abstract Interpretation, by K. Muthukumar and Manuel Hermenegildo, MCC
Session 4: Applications 2:00pm-3:30pm, Tues., Oct. 17
Investigating the Linguistics of DNA with Definite Clause Grammars
by David B. Searls, Unisys
An Expert System Which Intelligently Accesses an External Database
by Xiaoping He, George W. Ernst, and Fred Discenzo, Case Western Reserve University
and Reliance Electric
Automatic Ordering of Subgoals - A Machine Learning Approach
by Shaul Markovitch and Paul D. Scott, University of Michigan
Session 5: Nonmonotonic Logic Programming 4:00pm-6:00pm, Tues., Oct. 17
Stable Semantics for Logic Programs and Default Theories
by W. Marek and M Truszczynski, University of Kentucky
Convergence Issues and Fixed Points of Non-Monotone Maps
by Aida Batarekh, Syracuse University
A Truth Maintenance System Based on Stable Models
by Stephen G. Pimental and John L. Cuadrado, Institute for Defense Analyses
Supported Circumscription and Its Relation to Logic Programming with
Negation, by Jia Huai You and Liwu Li, University of Alberta
Session 6: Parallel Implementations 4:00pm-6:30pm, Tues., Oct. 17
Compiled Execution of the REDUCE-OR Process Model on Multiprocessors
by B. Ramkumar and L. V. Kale, University of Illinois at Urbana-Champaign
Combined And-Or Parallel Execution of Logic Programs on Shared Memory
Multiprocessors, by Gopal Gupta and Bharat Jayaraman, University of North Carolina
at Chapel Hill
Restricted And-Parallelism with Side-Effects
by Si-En Chang and Y. Paul Chiang, Washington State University
On the Correctness and Efficiency of Independent And-Parallelism in
Logic Programs, by Manuel Hermenegildo and F. Rossi, MCC
Obtaining First Solution Faster in AND and OR Parallel Execution of
Logic Programs
by Vikram Saletore and L. V. Kale, University of Illinois at Urbana-Champaign
Session 7: Software Engineering 9:00am-10:30am, Wed., Oct. 18
Generalization and Program Schemata: A Step Towards Computer-Aided
Construction of Logic Programs
by Yves Deville and Jean Burnay, University of Namur, Belgium
Incorporating Programming Techniques into Prolog Programs
by Arun Lakhotia, Case Western Reserve University
Logic Programming in a Software Engineering Perspective
by Paola Mello, Antonio Natali, and Cristina Ruggieri, Universita di Bologna, Italy
Session 8: Constructive Negation 9:00am-10:30am, Wed., Oct. 18
On Constructive Negation in Logic Programming
by Teodor C. Przymusinski, University of Texas at El Paso
Fail Substitutions for Negation as Failure
by Jan Maluszynski and Torbjorn Naslund, Linkoping University, Sweden
An Extension of Constructive Negation and its Application in
Coroutining
by David Chan, Hewlett Packard, UK
Session 9: Concurrent Logic Programming 11:15am-1:15pm, Wed., Oct. 18
Strand: a Practical Parallel Programming Language
by Ian Foster and Stephen Taylor, Argonne and Cal Tech
Money as a Concurrent Logic Program
by Kenneth M. Kahn and William A. Kornfeld, Xerox PARC and Lyon Park Systems
Variable-Free Execution of Concurrent Logic Languages
by Sven-Olof Nystrom, Uppsala University, Sweden
Existential Constraints, Reactive Behaviors, and Fully Abstract
Compositional Semantics of Concurrent Logic Programs
by Haim Gaifman, Michael J. Maher, and Ehud Shapiro, Weizamnn Institute, Israel
Session 10: Semantics 11:15am-1:15pm, Wed., Oct. 18
A Stratification Semantics for General Disjunctive Programs
by Arcot Rajasekar and Jack Minker, University of Maryland at College Park
On the Generalized Predicate Completion of NonHorn Program
by Phan Minh Dung and Kanchana Kanchanasut, Asian Institute of Technology, Thailand
A Fixpoint Approach to Declarative Semantics of Logic Programs
by Phan Minh Dung and Kanchana Kanchanasut, Asian Institute of Technology, Thailand
A Kripke-like Model for Negation as Failure
by James Harland, University of Edinburgh, UK
Session 11: Program Transformation 2:30pm-4:30pm, Wed., Oct. 18
Partial Evaluation in Prolog: Some Improvements about Cuts and Control
by M. Bugliesi and F. Russo, Enidata, Italy
Deriving an Efficient Production System by Partial Evaluation
by Koichi Furukawa, Hiroshi Fujita, and Toramatsu Shintani, ICOT, Japan
Synthesis of Recursive Logic Procedures from First-order Logic
Specifications by Structured Fold-Unfold
by K. K. Lau and S. D. Prestwich, University of Manchester, UK
Session 12: Performance of Parallel Systems 2:30pm-4:30pm, Wed., Oct. 18
Expected Performance of the Randomized Parallel Backtracking Method
by Zheng Lin, University of Maryland at College Park
Performance of Aurora on an Hierarchical Memory Multiprocessor
by Shyam Mudambi, Brandeis University
Performance Analysis of the Aurora Or-Parallel Prolog System
by Peter Szeredi, University of Bristol, UK
Session 13: Logic Grammars 4:30pm-6:00 pm, Wed., Oct. 18
Narrowing Grammar: A Comparison with Other Logic Grammars
by H. Lewis Chau, UCLA
Discourse Understanding in Logic
by Arendse Bernth, IBM Research Center
Semantic Specification Using Logic Programs
by Srinivas R. Sataluri and Arthur C. Fleck, Bell Labs at Holmdel
7:00 pm Banquet
Invited talk: Thurs, Oct. 18, 9:00am-10am
The XWAM: A Machine that Integrates Prolog and Deductive Database
Query Evaluation, David S. Warren, SUNY Stony Brook
Session 14: Database I 10:45am-12:45pm, Thurs., Oct. 19
Database Updates and Transactions in LDL
by Ravi Krishnamurthy, Shamim Naqvi, and Carlo Zaniolo, MCC
Processing Multiple Linear Recursions
by Jiawei Han and Ling Liu, Simon Fraser University
Expressing Database Queries with Intuitionistic Logic
by Anthony J. Bonner, Kumar Vadaparty, and L. Thorne McCarty, Rutgers University
Abductive Reasoning with Complex Structures
by Weidong Chen and David Scott Warren, SUNY Stony Brook
Session 15: Implementation Topics 10:45am-12:45pm, Thurs., Oct. 19
Event Handling in Prolog
by Micha Meier, ECRC, West Germany
On the Adequacy of Direct Mapped Caches for Lisp and Prolog Data
Reference Patterns
by V.S. Madan, C.J. Peng, and G.S. Sohi, University of Wisconsin at Madison
Optimization Techniques Using the MRB and Their Evaluation on the
Multi-PSI/V2
by Yu Inamura, Nobuyuki Ichiyoshi, Kazuaki Rokusawa, and Katsuto Nakajima,
ICOT, Japan
The Garbage Collection System for Parallel Inference Engine PIE64
by Lu Xu, Hanpei Koike, and Hidehiko Tanaka, University of Tokyo, Japan
Session 16: Database II 2:00pm-3:30pm, Thurs., Oct. 19
On the Detection and Elimination of Redundant Derivations During
Bottom-up Execution
by A. Richard Helm, IBM Research Center
Deja Vu in Fixpoints of Logic Programs
by Michael J. Maher and Raghu Ramakrishnan, IBM Research Center and
Univeristy of Wisconsin
Propagating Constraints in Recursive Deductive Databases
by David B. Kemp, Krishnamurthy Meenakshi, Kotagiri Ramamohanarao, and Isacc Balbin
University of Melbourne and RMIT, Australia
Session 17: WAM I 2:00pm-3:30pm, Thurs., Oct. 19
Indexing Prolog Clauses
by Bart Demoen, Andre Marien, and Alain Callebaut, University of Leuven and BIM,
Belgium
WINTER: WAMS IN Tim Expression Reduction
by Damir Jamsek, Kevin J. Greene, Shiu-Kai Chin, and Paul R. Humenn,
Syracuse University
On the Management of E and B in WAM
by Andre Marien and Bart Demoen, University of Leuven and BIM, Belgium
Session 18: Extensions to Logic Programming 4:00pm-6:00pm, Thurs., Oct. 19
Programming with Equations, Subsets, and Relations
by Bharat Jayaraman and David A. Plaisted, University of North Carolina at Chapel Hill
On the Expressive Power of Annotation-Based Logic Programs
by Michael Kifer and V. S. Subrahmanian, SUNY Stony Brook and University of Maryland
HiLog: A First-Order Semantics for Higher-order Logic Programming
Constructs
by Weidong Chen, Michael Kifer, and David S. Warren, SUNY Stony Brook
Inference of Polymorphic Types for Logic Programs
by Changwoo Pyo and Uday S. Reddy, University of Illinois at Urbana-Chanpaign
Session 19: WAM II 4:00pm-6:00pm, Thurs., Oct. 19
Unification Parallelism: How Much Can We Exploit?
by Ashok Singhai and Yale Patt, University of California at Berkeley
An Intermediate Language to Support Prolog's Unification
by Peter Van Roy, University of California at Berkeley
Performance Evaluation of the Sequential Inference Machine CHI-II
by Akihiko Konagaya, Shinichi Habata, Atsushi Atarashi, and Minoru Yokota,
NEC, Japan
Towards a WAM Model for Lambda-Prolog
by Gopalan Nadathur and Bharat Jayaraman, Duke Univeristy and
University of North Carolina
__________________________________________________________________________
GENERAL INFORMATION:
LOCATION: All conference events take place on the campus of
Case Western Reserve University. The conference desk
will be located on the ground floor of Crawford Hall.
CORRESPONDENCE: The mailing address is
NACLP '89, Marcy Sanford - Conference Secretary,
Case Western Reserve University,
Department of Computer Engineering and Science,
10900 Euclid Avenue, Cleveland, Ohio 44106.
The email address is sanford@alpha.ces.cwru.edu
The telephone numbers for emergencies and messages are
(216) 368-6197, 368-2800 and 368-5278.
TRANSPORTATION
Domestic Air: Domestic travelers can call USAir (code number ACW320J)
or Delta Airlines (file number G16046) with 5% off all published
discount fares or 40% off published round trip coach fares. Ticketing
must be made 14 days in advance.
Public Transport from Airport: Visitors arriving at Cleveland Hopkins
Airport can reach the University by public transportation. The Rapid
Transit (train, cost $1) boards at the airport and stops at University
Circle after about 35 minutes. From there you can take a free
University Circle to Baker building for registration.
Taxis: A taxi the the Clinic Center Hotel should cost around $20.
By car: Persons renting cars may reach the campus by taking I-71 north
to I-90 to Carnegie or Chester Avenues. Proceed east to the
University.
SOCIAL EVENTS
Monday, October 16, 6:00-7:00 pm - Opening Reception
Held in Tomlinson Hall, this complimentary reception offers an
opportunity to mingle with the other attendees after the first day of
tutorials.
Wednesday, October 18, 7:00 pm. - Conference Banquet
Held in the Atrium of the new BP America (Sohio) headquarters in
downtown Cleveland.
Friday, October 20 - Optional excursion to Niagara Falls
An excursion to Niagara Falls, a four hour bus trip away, can be
planned if there is enough interest. The cost will be between $20-$50
depending on the number of travelers. Please indicate if you are
interested when returning your registration form.
EXHIBITS
For the three days of technical sessions, there will be a room of
exhibits in Crawford Hall, next to the coffee and lunch area. The
exhibitors will include Prolog vendors and book publishers.
WORKSHOPS
Workshops will be held on Friday, October 20, 1989. Suggested topics
include Types in Logic Programming, Future Directions in Parallel
Logic , Logic Programming architectures, and Prolog Programming
Environments. For details, watch comp.lang.prolog.
AREA ATTRACTIONS
Case Western Reserve University is located in University Circle, the
cultural hub of Cleveland, featuring a world-class art museum,
excellent natural history museum, Crawford Auto-Aviation Museum,
Western Reserve Historical Society and the Garden Center of Greater
Cleveland, all within walking distance of the conference. Information
will be available on tours around Cleveland for accompanying persons.
------------------------------------------------------------------------
ACCOMMODATIONS
Case Western Reserve University is located in University Circle,
approximately fifteen minutes east of downtown Cleveland by car.
There are several downtown hotels. However, the closest to the
conference site is the Clinic Center Hotel, less than a mile away.
NACLP-89 has a block reservation at the Clinic Center Hotel from which
regular bus shuttles have beenarranged to teh conference. Another
block reservation has been made at the Holiday Inn Lakeside, located
downtown. The Organizing Committee recommends that conference
attendees take advantage of the reduced rates and accessibility
through NACLP-89. The block reservation is limited, please make your
reservations as early as possible.
Clinic Center Hotel One Person Two Persons Extra Person
E. 96th & Carnegie $64.00 $78.00 $10.00
Cleveland, Ohio 44106
1-800-321-7100 within 10 minutes walking distance
(the preferred choice)
Holiday Inn Lakeside Single Double Triple Quad
1111 Lakeside Avenue $53.00 $58.00 $63.00 $68.00
Cleveland, Ohio 44114
(216) 241-5100 located downtown Cleveland, approximately 15 minute bus ride
Alcazar Dorm accommodation for students $45.00 single only
2450 Derbyshire Road Cleveland Hts., OH 44106 (216) 321-5400
20 minutes walking distance
HOTEL REGISTRATION
Hotel Desired ________________________________________
Arrival Date_____________ Departure Date____________
Accommodation Desired single double triple quad
Room Rate $_____________
Name ___________________________________________________
Card type and number - expiration date______________________________
Payment: All checks to be made to the hotels. In U.S. currency only,
drawn on U.S. banks
REGISTRATION FORM FOR NORTH AMERICAN CONFERENCE ON LOGIC PROGRAMMING 1989
-------------------------------------------------------------------------
REGISTRATION FEES: (in $US)
Before August 30, 1989 After August 30, 1989
Member of ALP $225.00 $260.00
Non-Member $260.00 $295.00
Student $120.00 $150.00
Registration fees will cover the technical session of the conference,
the opening reception, the entertainment provided, general processing
fees, breakfast and lunch daily, banquet and one copy of the published
proceedings per registrant. (The banquet is not covered for students).
Participants are encouraged to register as early as possible.
Tutorial Sessions
1 session 2 sessions 3 sessions
Registrant w/conference $60.00 $80.00 $100.00
Registrant w/o conference $260.00 $280.00 $300.00
Student $30.00 $40.00 $50.00
Registration times and locations
Sunday, October 15, 1989 4:00-7:00 pm.
Baker Building and Clinic Center Hotel
Monday, October 16, 1989 all day starting at 8:00 am,
Baker Building - Ground Floor
Tuesday, October 17, 1989 8:15-10:00 am Baker Building - Ground Floor
Thereafter, Registration desk, Crawford Hall
REGISTRATION CONFIRMATION: A receipt will be sent to each registrant
after the registration fee is paid in full. This receipt
should be presented at the time of the conference in order to
receive conference materials. Late registrants can pick up
their receipts at the conference.
CANCELLATIONS: To be eligible for a refund of the registration fees,
written notification of cancellation must be received NO LATER
than September 15, 1989. An administrative fee of $25.00 will
be deducted from the refund. Cancellations requested after
the deadline date will not be eligible for a refund.
Return this registration form to Marcy Sanford, Conference Secretary,
NACLP-89, Department of Computer Engineering and Science, Case Western
Reserve University, 10900 Euclid Avenue, Cleveland, Ohio 44106. Full
remittance must accompany this form so that the registration can be
processed.
----------------------------------------------------------------------------------
Name____________________________________________________
Title_____________________________________________________
Affiliation____________________________________________________
Mailing Address________________________________________________
_________________________________________________________________
Telephone/Telex_______________________________________________
E-mail Address_________________________________________________
Number of accompanying person(s)_________________________________
Would you like to have special activities for an accompanying person?_______
I am/am not interested in a bus trip to Niagara Falls on Friday,
October 20.
(Please circle)
Registration Fees (****)BEFORE August 30, 1989 AFTER August 30, 1989(****)
Member of ALP $225.00 $260.00
Non-Member $260.00 $295.00
Student $120.00 $150.00
Tutorial Sessions
1 session 2 sessions 3 sessions
Registrant w/conference $60.00 $80.00 $100.00
Registrant w/o conference $260.00 $280.00 $300.00
Student $30.00 $40.00 $50.00
Tutorials you wish to attend (please use numbers, e.g. T1)
1._______ 2._________ 3.__________
Total Registration Fees $_____________
____________________________________________________________
TOTAL REMITTANCE (In US currency only) $____________
(****) The deadline for early registration can be extended for people
who did not receive a version of the conference program and registration
information. Please send E-mail to sanford@alpha.ces.cwru.edu or call
(216)-368-6197 as soon as possible.