Subject: From: AIList Moderator Kenneth Laws <AIList-REQUEST@SRI-AI>

From: [email-masked]
Date: Tue, 4 Jun 85 23:44:57 edt

Received: from sri-ai.arpa by csnet-relay.arpa id a008095; 4 Jun 85 14:25 EDT
Date: Tue  4 Jun 1985 09:50-PDT
Reply-to: AIList@SRI-AI
US-Mail: SRI Int., 333 Ravenswood Ave., Menlo Park, CA  94025
Phone: (415) 859-6467
Subject: AIList Digest   V3 #72
To: AIList@SRI-AI
Received: from rand-relay by vpi; Tue, 4 Jun 85 23:33 EST

AIList Digest            Tuesday, 4 Jun 1985       Volume 3 : Issue 72

Today's Topics:
  Seminars - Expert System for Fault Diagnosis (SRI) &
    Temporal Logic (SU) &
    Assumption-Based Truth Maintenance (CSLI) &
    Spreadsheets in Logic Programming (MIT) &
    PCs as Vehicles for LISP (BBN),
  Conferences - Association for Computational Linguistics &
    Law and Technology

----------------------------------------------------------------------

Date: Sat 25 May 85 12:48:58-PDT
From: Michael Georgeff <[email-masked]>
Subject: Seminar - Expert System for Fault Diagnosis (SRI)

Time: Wednesday May 29 at 11:00 am
Location: EJ232

Speaker : Guy A. Boy (NASA-Ames & ONERA, France)

Topic : HORSES

   HORSES ( Human - [Orbital Refueling System] - Expert System ) is a
malfunction procedure-oriented diagnosis aid. It takes into account
two types of logic, the functioning logic of the system to be
controlled and the user logic. HORSES will be used to study a
theoretical framework of the situation recognition problem.

   As a strategy for research in the use of expert systems for fault
diagnosis this example focuses attention on three interrelated issues;
1) The characterization of the fault diagnosis process with the
current ORS implementation (shuttle orbital refueling system
simulator); 2) Improved understanding of how humans recognize,
diagnose, and respond to system failures; and, 3) A deeper analysis of
the fault diagnosis process concentration a better understanding of
the knowledge and inferences required.

------------------------------

Date: Fri 24 May 85 14:19:25-PDT
From: Andrei Broder <[email-masked]>
Subject: Seminar - Temporal Logic (SU)

5/30/85 - Daniel Lehmann (Hebrew U. visiting Brandeis U.)

            "The temporal logic of probabilistic programs"

In a joint work with S. Shelah, some extensions of the propositional
temporal logic of discrete time were advocated as useful for stating
and proving properties of probabilistic concurrent programs. Deductive
completeness theorems were proved. In a joint work with S. Kraus
corresponding decision procedures were investigated. Recently a system
for describing time and knowledge has been proposed. All those systems
can be characterized as two-dimensional modal logics, i.e. they
involve two essentially orthogonal modalities, one of them being time,
that satisfy some interchange law.  The techniques involved in
studying such systems and some open problems will be described.

***** Time and place: May 30, 12:30 pm in MJ352 (Bldg. 460) ******

------------------------------

Date: Wed 29 May 85 17:16:33-PDT
From: Emma Pease <[email-masked]>
Subject: Seminar - Assumption-Based Truth Maintenance (CSLI)

         [Excerpted from the CSLI Newsletter by Laws@SRI-AI.]

                  THURSDAY, June 6, 1985, 4:15 p.m.
               CSLI Colloquium, Redwood Hall, Room G-19

           ``An Assumption-Based Truth-Maintenance System''

         Johan De Kleer, Xerox PARC, Intelligent Systems Lab.

      This paper presents a new view of problem solving motivated by a
   new kind of truth maintenance system. Unlike previous truth
   maintenance systems which were based on manipulating justifications,
   this truth maintenance system is, in addition, based on manipulating
   assumption sets.  As a consequence it is possible to work effectively
   and efficiently with inconsistent information, context switching is
   free, and most backtracking (and all retraction) is avoided.  These
   capabilities motivate a different kind of problem-solving architecture
   in which multiple potential solutions are explored simultaneously.
   This architecture is particularly well-suited for tasks where a
   reasonable fraction of the potential solutions must be explored.
                                                --Johan De Kleer

------------------------------

Date: Mon, 3 Jun 85 13:10:37 EDT
From: [email-masked] (Jan Komorowski)
Subject: Seminar - Spreadsheets in Logic Programming (MIT)

           [Forwarded from the MIT bboard by SASW@MIT-MC.]

                           Harvard University
              Center for Research in Computing Technology

                               COLLOQUIUM

             Spreadsheets as a Subset of Logic Programming

                           Maarten van Emden
                         University of Waterloo

                         Tuesday, June 4, 1985
                                4:00 PM
                         Aiken Lecture Hall 101
                    (Tea in Pierce Hall 213 at 3:30)

                               ABSTRACT:

     We believe that currently marketed programs leave unexploited  much
of  the potential of the spreadsheet interface.  The purpose of our work
is to obtain suggestions for wider  application  of  this  interface  by
showing  how  to  obtain its main features as a subset of logic program-
ming.

     Our  work  is  based  on  two  observations.   The  first  is  that
spreadsheets  would  already  be  a  useful  enhancement  to interactive
languages such as APL and BASIC.  Although Prolog is also an interactive
language,  this  interface cannot be used in the same direct way.  Hence
our second observation: the usual query mechanism  of  Prolog  does  not
provide  the  kind of interaction this application requires.  But it can
be provided by the incremental query, a new query mechanism for Prolog.

     The two observations together yield the spreadsheet as a display of
the state of the substitution of an incremental query in Prolog.  Recal-
culation of dependent cells is achieved by automatic modification of the
query  in  response  to  a  new  increment that would make it unsolvable
without the modification.

Host:  Professor Henryk Jan Komorowski

------------------------------

Date: 3 Jun 85   10:20-EDT
From: Peter Mager   <[email-masked]>
Subject: Seminar - PCs as Vehicles for LISP (BBN)

                           ACM GREATER BOSTON CHAPTER SICPLAN

                                Thursday, June 13, 1985
                                         8 P.M.

                       Bolt Beranek and Newman, Newman auditorium
                               70 Fawcett St., Cambridge

                      The Personal Computer as a Delivery Vehicle

                                   Gerald R. Barber
                                  Gold Hill Computers
                                     Cambridge, MA

             The growing interest in artificial intelligence technologies is
           stimulating interest in how  the  benefits  of these technologies
           can be delivered on a low cost and low  risk  basis.   This  talk
           focuses on the elements of a  personal  computer  based  delivery
           vehicle for artificial intelligence applications.

             The combination of a growing market for artificial intelligence
           applications and dropping  development  costs have created a need
           for an inexpensive, PC  based  delivery  vehicle.  Some desirable
           characteristics  of  a  PC  delivery  vehicle  will be  discussed
           including   characteristics   of   the   Golden    Common    Lisp
           implementation, performance, networking, memory needs, and use of
           backend  machines.   A   strategy   for   the  implementation  of
           artificial  intelligence  technology  in  a  cost  effective  and
           incremental fashion will also be discussed.

                           ACM GREATER BOSTON CHAPTER SICPLAN

           Dear Colleague,

             Our June speaker, Gerry  Barber,  is  president  of  Gold  Hill
           Computers  and  the prime mover behind  their  implementation  of
           Common Lisp for the IBM/PC.  Their  product  Golden  Common  Lisp
           originated when  Gerry  spent  a post-doc year in France at INRIA
           and found himself without adequate  access  to  Lisp  processors;
           hence a Lisp implementation for the IBM/PC.  Prior  to that Gerry
           studied under Carl Hewitt at MIT's AI  Lab, receiving a Ph.D.  in
           1982.  The  talk  should  give a good  perspective  on  where  AI
           application languages are going and how well they are penetrating
           into the everyday world of low cost environments.

             Our  group  customarily meets informally for  dinner  at  Joyce
           Chen's restaurant, 390 Rindge Ave., Cambridge at 6:00 P.M.  (just
           before the  meeting).   If  you wish to come, please call Carolyn
           Elson at 661-1840 before the day of the talk - early please.

                                             Peter Mager
                                             chairperson, Boston SICPLAN

------------------------------

Date: 28 May 1985 13:53:18 PDT
From: Bill Mann <[email-masked]>
Subject: ACL program information: papers July 9-12th

                Association for Computational Linguistics
                        Annual Conference
                        University of Chicago

                        Presentations of Papers
                        July 9 - 12, 1985

TUESDAY - 9 July

morning
-------

 Carole D. Hafner
 Semantics of Temporal Queries and Temporal Data

 Klaus Obermeier
 Temporal Inferences in Medical Texts

 Kenneth Man-kam Yip
 Tense, Aspect and the Cognitive Representation of Time

 Shozo Naito, Akira Shimazu & Hirosato Nomura
 Classification of Modality Function & its Application to Japanese
       Language Analysis

 John C. Mallery
 Universality and Individuality: The Interaction of Noun Phrase
       Determiners in Copular Clauses

 William J. Rapaport
 Meinongian Semantics for Propositional Semantic Networks

afternoon
---------

INVITED SPEAKER
Fernando Pereira
A Survey of Natural Language Research at Japan's Institute for New
Generation Computing Technology

 Philip Cohen and Hector Levesque
 Speech Acts and Rationality

 Jerry Hobbs
 Ontological Promiscuity

 Sam Pilato & Robert Berwick
 Reversible Automata & Induction of the English Auxilary System

 G. Edward Barton, Jr.
 The Computation Difficulty of ID/LP Parsing

 Aravind Joshi & K. Vijayshankar
 Some Computational Properties of Tree Adjoining Grammars

 David McDonald & James Pustejovsky
 TAGs as a Grammatical Formalism for Generation

WEDNESDAY - 10 July

morning
-------

 Michael McCord
 Modular Logic Grammars

 Robert Berwick & Sandiway Fong
 New Approaches to Parsing Conjunctions Using Prolog

 Mark Johnson
 Generalizing the Early algorithm

Lauri Karttunen and Martin Kay
Structure Sharing with Binary Trees

 Fernando Pereira
 A Structure-Sharing Representation for Unification-Based
       Grammar Formalisms

 Stuart M. Shieber
 Using Restriction to Extend Parsing Algorithms for
       Complex-Feature-Based Formalisms

afternoon
---------

INVITED SPEAKER
William Woods
Knowledge and Language: A New Frontier

 Philip Hayes
 Semantic Case Frame Parsing & Syntactic Generality

 Mark Jones & Alan Driscoll
 Movement in Active Production Networks

 Derek Proudian and Carl Pollard
 Parsing Head-driven Phrase Structure Grammar

 Carl Pollard & Lewis Creary
 A Computational Semantics for Natural Language

 Leonardo Lesmo & Pietro Torasso
 Analysis of Conjunctions in a Rule-based Parser

THURSDAY - 11 July

morning
-------

INVITED SPEAKER
Barbara Grosz
The Structures of Discourse Structures

 Remko Scha
 The Dynamic Discourse Model: A Formal Approach to Discourse
       Segmentation

 Sandra Carberry
 A Pragmatics-Based Approach to Understanding Intersentential Ellipsis

 Douglas Appelt
 Some Pragmatic Issues in the Planning of Definite & Indefinite
       Noun Phrases

 Brad Goodman
 Repairing Reference Identificaiton Failures by Relaxation

afternoon
---------

INVITED SPEAKER
Bonnie Webber

 Raymonde Guindon & Burton Wagner
 Focusing in Anaphora Resolution: Allocation of Short-term Memory

 Karen Kukich
 Explanation Structures in XSEL

 Cecile L. Paris
 Description strategies for naive & expert users

 Kenneth Church
 Stress Assignment in Letter to Sound Rules for Speech Synthesis

 Brian Phillips, Michael Freiling, James Alexander, Steven Messick,
        Steve Rehfuss & Sheldon Nicholl
 An Eclectic Approach to Building Natural Language Interfaces

FRIDAY - 12 July

morning
-------

 Daniel Flickinger, Carl Pollard & Thomas Wasow
 Structure-Sharing in Lexical Representation

 Thomas Ahlswede
 A Tool Kit for Lexicon Building

 Roy Byrd & Martin Chodorow
 Using an On-line Dictionary to Find Rhyming Words and
       Pronunciations for Unknown Words

 Uri Zernik & Michael G. Dyer
 Towards a Self-Extending Phrasal Lexicon

 Andrew D. Beale
 Grammatical Analysis by Computer of the Lancaster-Oslo/Bergen
       Corpus of British English Texts

 Martin Chodorow, Roy Byrd & George Heidorn
 Extracting Semantic Hierarchies from a Large On-Line Dictionary

afternoon
---------

INVITED SPEAKER
George Miller
Dictionaries of the Mind

 Nan Decker
 The Use of Syntactic Clues in Discourse Understanding

 Helen M. Gigley
 Grammar Viewed as a Functioning Part of a Cognitive System

(The tutorial program on July 8 was described in a previous AILIST message.)

------------------------------

Date: Sat, 01 Jun 85 08:19:05 cet
From: [email-masked]
Subject: Conference Program - Law & Technology

Final Program of Second Annual Conference on Law and Technology
Legal Language, Computational Linguistics and Artificial Intelligence
June 24-30, 1985
Conrad N. Hilton Hotel
  Campus of the University of Houston
  University Park
Tutorials:
   June 24 a.m. Understanding Legal Language
         Layman Allen, Jeff Roberts, Peter Linzer
      Discussion:
         Jon Bing, Donald Berman, Hector Castaneda, Grayfred Gray,
         Jay Hook, and Peter Seipel

   June 24 p.m. Programming the Law in PROLOG
         Marek Sergot, Elizabeth MacRae
      Discussion:
         Michael Heather, Sidney Lamb, Duncan MacRae, and Charles
         Walter

   June 25 a.m. Natural Language Processing
         George Heidorn, Martin Kay
      Discussion:
         Jean-Claude Gardin, David Hays, Michael Hoey, Sidney Lamb,
         and Peter Reich

   June 25 p.m. Artificial Intelligence and Expert Systems
         L. Thorne McCarty and Donald Waterman
      Discussion:
         Cary deBessonet, Michael Dyer, Carole Hafner, Michael Heather,
         and Michael Lebowitz
 Research Presentations:  June 26-June 28
   Legal Language Processing
   Representing Open-Textured Legal Concepts
   Cognitive Processes
   Non-von Neumann Architectures
   Computer-Lawyer Inteface
 Workshops:    June 28-30
   Conference faculty workshop topics will be determined by the
   participants.  Microcomputuers and micro-PROLOG will be available.
 Conference Participants:
   Layman Allen (Law, Michigan)
   Donald Berman (Law, Northeastern)
   Jon Bing (Informatics, U of Oslo)
   Hector Castaneda (Philosophy, Indiana)
   George Cross (Computer Science, Louisiana State)
   Cary deBessonet (Law, Southern U)
   Bethany Dumas (Linguistics and Law, Tennessee)
   Michael Dyer (Computer Science, UCLA)
   Margot Flowers (Computer Science, UCLA)
   M. Jean-Claude Gardin (Linguistics, Ecole Pratique de Haut Etudes)
   Grayfard Gray (Law, Tennessee)
   Carole Hafner (Computer Science, Northeastern)
   David Hays (Computational Linguistics, New York)
   Michael Heather (Law and Computer Science, Newcastle-upon-Tyne Poly)
   George Heidorn (Linguistics and Computer Science, IBM)
   Michael Hoey (Linguistics, U of Birmingham, England)
   Jay Hook (Law and Psychology, U of Houston)
   Martin Kay (Linguistics, Xerox)
   Sidney Lamb (Linguistics, Rice)
   Michael Lebowitz (Computer Science, Columbia)
   Peter Linzer (Law, U of Houston)
   Duncan MacRae (Artificial Intelligence, Washington, D.C.)
   Elizabeth MacRae (PROLOG and AI, Washington, D.C.)
   L. Thorne McCarty (Law and Computer Science, Rutgers)
   Jose Carlos Neves (Legal Informatics, U of Minho)
   Michael Parks (Information Science, Houston)
   Peter Reich (Linguistics and Psychology, Toronto)
   Jeff Roberts (Roberts, Markel & Folger, Houston)
   Charles Saxon (Computer Science, Easter Michigan U)
   Marek Sergot (Law and PROLOG, London)
   Peter Seipel (Legal Informatics, Stockholm)
   B. Vauquouis (Linguistics, Grenoble)
   Charles Walter (Law and Computer Science, Houston)
   Donald Waterman (AI and Linguistics, RAND)

Tutorials:
_ $250/4 Tutorials (before 6/7/85) (Includes lunch 6/24 & 6/25)
_ $75/Tutorial (before 6/7/85)
_ $350/4 Tutorials (after 6/7/85)
_ $100/Tutorial (after 6/7/85)
Research Presentations:
_ $300/five sessions (before 6/7/85) (Includes lunch 6/26 & 6/27)
_ $75/session (before 6/7/85)
_ $400/five sessions (after 6/7/85)
_ $100/session (after 6/7/85)
Mail to:
  Charles Walter
  Director, Program on Law and Technology
  University of Houston Law Center
  4800 Calhoun
  Houston, Texas 77004
Phone:   (Not on network mail)
  713-749-4935
  713-749-4196

Accommodations:
  Call University of Houston Hilton Hotel (713-741-2447) for
  reservations.  Additional rooms may be available at University Park
  Inn, (713-224-5971).

------------------------------

End of AIList Digest
********************