Copy Link
Add to Bookmark
Report
NL-KR Digest Volume 07 No. 20
NL-KR Digest (Thu Oct 25 13:40:07 1990) Volume 7 No. 20
Today's Topics:
AI Seminar Announcement
Information about new book on planning
Looking for References
Avignon 91
Abstract for Syntax Workshop, 9 October, 7:30 p.m.
Prague Summer School on Formal & Computational Models of Meaning
Submissions: nl-kr@cs.rpi.edu
Requests, policy: nl-kr-request@cs.rpi.edu
Back issues are available from host archive.cs.rpi.edu [128.213.5.17] in
the files nl-kr/Vxx/Nyy (ie nl-kr/V01/N01 for V1#1), mail requests will
not be promptly satisfied. If you can't reach `cs.rpi.edu' you may want
to use `turing.cs.rpi.edu' instead.
BITNET subscribers: we now have a LISTSERVer for nl-kr.
You may send submissions to NL-KR@RPIECS
and any listserv-style administrative requests to LISTSERV@RPIECS.
-----------------------------------------------------------------
To: nl-kr@cs.rpi.edu
From: Marie Meteer <mmeteer@BBN.COM>
Subject: AI Seminar Announcement
Date: Tue, 23 Oct 90 10:33:40 EDT
Mail-System-Version: <MacEMail_1.2.3@BBN.COM>
BBN Science Development Program
AI Seminar Series Lecture
THE FUTURE OF KNOWLEDGE TECHNOLOGY
WILLIAM A. WOODS
Harvard University
woods@harvard.harvard.edu
BBN, 2nd floor large conference room
10 Moulton St, Cambridge MA, 02138
Tuesday, October 30, 1990, 2:00 PM
Advances in computers have created new opportunities for the
accumulation and dissemination of knowledge. Many new knowledge-related
products are entering the marketplace, and many new kinds of products
are foreseeable for the future. However, in many cases, the hardware
technology and interface technology have outstripped our abilities to
make use of them. There is a gap in our understanding of the
fundamental structure of knowledge that limits our abilities to record
knowledge in computers and make it available for human use. For
example, current data base technology is good for storing specific
factual information but offers little support for storing and using
generic information. On line data bases suffer from rigid hierarchical
menus that stand between the user and the information sought. Hypertext
systems are notoriously difficult to author and usually fall short of
their promised flexibility. Machine reasoning continues to flounder in
combinatoric complexity. There are serious gaps in our ability to
organize and use conceptual information to support human activities.
This talk will describe some of the things that are happening, discuss
some of the difficulties encountered, extrapolate some predictions for
the future, and outline some research problems that need to be solved to
make knowledge technology a useful reality. Some recent results will be
described that may change the way we approach some of these problems.
*******************************************************
Suggestions for AI Seminar speakers are always
welcome. Please e-mail suggestions to
Marie Meteer (mmeteer@bbn.com) or
Dan Cerys (cerys@bbn.com).
*******************************************************
------------------------------
To: nl-kr@cs.rpi.edu
From: morgan@unix.sri.com (Morgan Kaufmann)
Newsgroups: comp.ai.nlang-know-rep
Subject: Information about new book on planning
Keywords: planning, book
Date: 21 Oct 90 19:20:27 GMT
Morgan Kaufmann announces a new title in its READINGS series:
READINGS IN PLANNING
edited by
James Allen (University of Rochester)
James Hendler (University of Maryland)
Austin Tate (University of Edinburgh)
ISBN 1-55860-130-9
754 pages, softbound
$38.95 (ordering information below)
Although numerous review articles on planning have appeared over
the years, no systematic attempt has been made to collect the major
papers in this field into one volume. The goal of this book is to
remedy this situation by bringing together in one place a set of
readings that can be used to develop a familiarity with the
planning literature, with the major AI theory underlying planning,
and with the exciting directions of current research.
The first section of the book introduces the techniques and
terminology of the AI planning community. The second section
collects papers describing planning systems developed over the past
30 years. A third section presents research in the area of formal
models of planning. Finally, a fourth section collects recent work
representative of the field's current direction. The editors,
three accomplished researchers, provide introductory material
surveying the field of planning as well as introductions to groups
of papers placing the work in perspective.
Useful as a text for a planning course, a supplement to a more
general AI course, and as a reference for AI system developers and
researchers, this book is certain to be among the most popular of
the Morgan Kaufmann Readings.
Table of Contents
Preface v
Foreword by Nils J. Nilssonxi
Part I Introduction to Planning 1
Chapter 1 Introduction 3
Planning 5
Michael P. Georgeff
A Review of AI Planning Techniques 26
Austin Tate, James Hendler, Mark Drummond
Formal Models of Planning 50
James Allen
Part II Planning Systems 55
Chapter 2 Beginnings 57
GPS, A Program that Simulates Human Thought 59
Allen Newell, H. A. Simon
Application of Theorem Proving to Problem Solving 67
Cordell Green
STRIPS: A New Approach to the Application of Theorem
Proving to Problem Solving 88
Richard E. Fikes, Nils J. Nilsson
Planning in a Hierarchy of Abstraction Spaces 98
Earl D. Sacerdoti
Chapter 3 Interactions and Dependencies 109
The Virtuous Nature of Bugs 111
Gerald Jay Sussman
Achieving Several Goals Simultaneously 118
Richard Waldinger
Extract for APIC Studies in Data Processing 140
D. H. D. Warren
A Representation for Robot Plans 154
Philip J. Hayes
The Nonlinear Nature of Plans 162
Earl D. Sacerdoti
Planning with Constraints (MOLGEN: Part I) 171
Mark Stefik
Chapter 4 Planning and Acting 187
Learning and Executing Generalized Robot Plans 189
Richard E. Fikes, Peter E. Hart, Nils J. Nilsson
Decision Theory and AI II: The Hungry Monkey 207
Jerome A. Feldman and Robert F. Sproull
Planning and Acting 225
Drew McDermott
A Cognitive Model of Planning 245
Barbara Hayes-Roth and Frederick Hayes-Roth
A Model For Planning in Complex Situations 263
Robert Wilensky
Integrating Marker-Passing and Problem Solving 275
James A. Hendler
Chapter 5 Integrated Planning Systems 289
Generating Project Networks 291
Austin Tate
Planning in Time: Windows and Durations for Activities andGoals 297
Steven A. Vere
Domain-independent Planning: Representation and Plan Generation 319
David E. Wilkins
ISIS - A Knowledge-based System for Factory Scheduling 336
Mark S. Fox, Stephen F. Smith
O-Plan - Control in the Open Planning Architecture 361
Ken Currie and Austin Tate
Hierarchical Planning Involving Deadlines, Travel Time,
and Resources 369
Thomas Dean, R. James Firby and David Miller
Part III Foundations of Planning 389
Chapter 6 Formal Models Of Action 391
Some Philosophical Problems from the Standpoint of Artificial
Intelligence 393
John McCarthy and Patrick Hayes
A Temporal Logic For Reasoning About Processes
and Plans 436
Drew McDermott
Towards a General Theory of Action and Time 464
James F. Allen
A Formal Theory of Knowledge and Action 480
Robert C. Moore
Chapter 7 Formal Models of Planning Systems 521
On the Semantics of STRIPS 523
Vladimir Lifschitz
Plan Synthesis: A Logical Perspective 532
Stanley J. Rosenchein
Planning for Conjunctive Goals 537
David Chapman
Planning Using a Temporal World Model 559
James F. Allen and Johannes A. Koomen
Planning as Search: A Quantitative Approach 566
Richard E. Korf
Chapter 8 Time and The Frame Problem 579
Problems in Formal Temporal Reasoning 581
Yoav Shoham and Drew McDermott
The Frame Problem and Related Problems in Artificial
Intelligence 588
Patrick J. Hayes
Temporal Data Base Management 596
Thomas Dean and Drew McDermott
Nonmonotonic Logic and Temporal Projection 624
Steve Hanks and Drew McDermott
Why Things Go Wrong: A Formal Theory of Causal
Reasoning 641
Leora Morgenstern and Lynn Andrea Stein
Part IV New Directions in Planning Systems 647
Chapter 9 Learning and Reuse 649
Selectively Generalizing Plans for Problem-Solving 651
Steven Minton
CHEF: A Model of Case-based Planning 655
Kristian J. Hammond
An Adaptive Planner 660
Richard Alterman
Chapter 10 Extending the Classical Framework 655
Refining and Extending the Procedural Net 667
Mark E. Drummond
Localized Representation and Planning 670
Amy L. Lansky
Formulating Multiagent, Dynamic-World Problems in the Classical
Planning Framework 675
Edwin P. D. Pednault
Chapter 11 Planning and Execution 771
An Architecture for Intelligent Reactive Systems 713
Leslie Pack Kaelbling
Reactive Reasoning and Planning 729
Michael P. Georgeff and Amy L. Lansky
Integrating Planning, Execution, and Monitoring 735
Jose A. Ambros-Ingerson and Sam Steel
Author Affiliations
Credits
Index
_________________________________________________________________
Ordering Information:
Please add $3.50 for the first book and $2.50 for each additional for
surface shipping to the U.S. and Canada; $6.50 for the first book
and $3.50 for each additional for shipping to all other areas.
California residents please add sales tax appropriate to your county.
Master Card, Visa and personal checks drawn on US banks
accepted.
Morgan Kaufmann Publishers
Department 58
2929 Campus Drive, Suite 260
San Mateo, CA 94403
USA
Phone: (415) 578-9928, (800)745-READ
Fax: (415) 578-0672
Email: morgan@unix.sri.com
------------------------------
To: nl-kr@cs.rpi.edu
From: cho@sybil.cs.buffalo.edu (Sung-Hye Cho)
Newsgroups: comp.ai,comp.ai.nlang-know-rep
Subject: Looking for References
Date: 18 Oct 90 04:14:09 GMT
Followup-To: comp.ai
Nntp-Posting-Host: sybil.cs.buffalo.edu
Originator: cho@sybil.cs.Buffalo.EDU
I am a graduate student at SUNY at Buffalo who is
working on the representation of and reasoning about
sets/collections/plural entities/plural noun phrases.
I am looking for previous literature.
Please send me an e-mail(cho@cs.buffalo.edu) if you know of any work.
Thank you,
Sung-Hye
------------------------------
To: nl-kr@cs.rpi.edu
Date: Sat, 20 Oct 90 17:54 EDT
From: IDE%vassar.bitnet@pucc.PRINCETON.EDU
Subject: Avignon 91
Reply-To: IDE%vassar.bitnet@pucc.PRINCETON.EDU
X-Envelope-To: vision-list@ads.arpa, weischedel@bbn.com,
nl-kr@cs.rochester.edu, fineart@ecs.umass.edu, wiley!ai-chi@lll-lcc.arpa,
nnsc@nnsc.nsf.net, waltz@think.com, mcvax!swivax!otten@uunet.uu.net,
sigart@vaxa.isi.edu, obi-announce@world.std.com, obi@world.std.com,
bobrow@xerox.com
AVIGNON '91: Expert Systems & their Applications
Eleventh International Workshop
Avignon - France, May 27 - 31, 1991
Conference on Second Generation Expert Systems
======================
Call for Papers
======================
For the third consecutive year, one of the AVIGNON conferences will be
devoted to the study of Second Generation Expert Systems.
The term "second generation" expert systems is used to characterize
knowledge-based systems able to solve problems by combining different types
of reasoning. Such systems often use multiple representations of the
problem to develop different problem-solving strategies.
The first generation expert systems were largely based on heuristic,
associational rules. To overcome their limitations, a new line of
research was begun into the use of deeper knowledge, often referred
to as "model-based", "causal" or "qualitative" reasoning.
Since model-based and heuristic approaches appear to be largely
complementary, recent work has begun to combine these two reasoning
processes into a single problem-solver.
Another thread of research has been aimed at making the problem solving
methods used much more explicit and elaborating "task-specific architectures".
Research has then been conducted into designing particular problem-solvers by
combining multiple generic or primitive task-specific architectures.
Second Generation Expert Systems are intended to have those two approches
converge. Building systems that make explicit the tasks to be realized,
the problem solving methods to be implemented and the associated domain models
would appear to be the basic objective of this new field.
And because a non-trivial problem can only be solved by bringing a number
of different resolution methods and domain models into play, the cooperation
and integration of these methods and models is one of the key problems to be
met in the building of such systems.
Topics
- -----
The Program Committee is seeking papers on the following themes (list non
exhaustive):
+ combining different reasoning types
+ architectures integrating heuristic and model-based reasoning;
+ reasoning with multiple models;
+ multi-expert, multi-agent cooperation;
+ cooperation of distributed problem-solvers;
+ task-specific architectures;
+ knowledge acquisition, explanation, validation, in second generation
expert systems;
+ the use of qualitative, model-based, causal or temporal reasoning to
supplement heuristic reasoning;
+ integrating qualitative and quantitative reasoning;
+ applications of these techniques to real-world problems
(e.g. diagnosis, design, scheduling).
Papers describing applications should outline the strengths as well as
the weaknesses of the implemented systems. In particular, examples and
analysis of failures will be appreciated in order to delineate the
applicability of the methods.
Theoretical papers should be clearly related to previous work and should
enlighten the advantages and originality of the proposed approach.
Submission
- ---------
Authors should submit 6 copies of their papers before January 7, 1991
to AVIGNON '91 general chairman:
Jean-Claude Rault
EC2
269-287, rue de la Garenne ; 92000 Nanterre ; France
tel: 33 - 1 - 47.80.70.00 ; fax: 33 - 1 - 47.80.66.29
Paper should be a minimum of 2000 words to a maximum of 5000 words
(about 10 pages single-spaced). Each submission should contain the
following information: title of paper; full name of all authors;
complete address of first author (including telephone, fax number
and e-mail address if available); abstract of 100-200 words; list of key-words.
Each submission will be reviewed by at least three referees.
Notifications of acceptance or rejection will be mailed from March 1, 1991.
Program Committee
- ----------------
Jean-Marc David (chairman)
Renault ; Service Systemes Experts
860, Quai Stalingrad; Bt J4-D14;
92109 Boulogne Billancourt; France.
e-mail: david@renault.uucp ;
tel : 33 - 1 - 46.94.54.86
fax : 33 - 1 - 46.94.50.23
Alice Agogino (University of California; Berkeley, USA);
Bert Bredeweg (University of Amsterdam; The Netherlands);
B. Chandrasekaran (Ohio State University; Columbus, USA);
Marie-Odile Cordier (Universite de Rennes; France);
Jean-Luc Dormoy (Etudes et Recherches EDF; Clamart, France);
Jacques Ferber (Universite Paris 6; France);
Massimo Gallanti (CISE; Segrate, Italy);
Jean-Paul Krivine (Etudes et Recherches EDF; Clamart, France);
Benjamin Kuipers (University of Texas; Austin, USA);
Roy Leitch (Heriot-Watt University; Edinburgh, UK);
Robert Milne (Intelligent Applications; Livingston, UK);
Richard Pelavin (Philips Laboratories; Briarcliff Manor, USA);
Olivier Raiman (XEROX Palo Alto Research Centre, USA);
Reid Simmons (Carnegie Mellon University; Pittsburgh, USA);
Luc Steels (Vrije Universiteit; Brussels, Belgium);
Jon Sticklen (Michigan State University; East-Lansing, USA);
Pietro Torasso (Universita di Torino; Italy);
Louise Trave-Massuyes (LAAS - CNRS; Toulouse, France);
Walter van de Velde (Centre of Advanced Studies; Blanes, Spain).
------------------------------
To: nl-kr@cs.rpi.edu
Date: Thu, 4 Oct 90 08:47:37 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Subject: Abstract for Syntax Workshop, 9 October, 7:30 p.m.
[ note this has already happened - CW ]
SYNTAX WORKSHOP
Complex Predicates in LFG
Miriam Butt, Michio Isoda, Peter Sells
(mutt@csli.stanford.edu, isoda@csli.stanford.edu,
sells@csli.stanford.edu)
Tuesday, 9 October, 7:30 p.m.
Cordura 100
This is a report on work conducted at CSLI over the summer by a group
of people, including the authors. We will primarily talk about the
relation in LFG between f-structure and a(rgument)-structure, which we
have tried to formalize, by looking at certain complex predicates in
Urdu. The standard account of complex predicates (e.g., Ishikawa
(1985) for Japanese) is that they are monoclausal in c-structure but
biclausal in f-structure and a-structure. Urdu presents some complex
predicates of just this type. However, there are others that seem to
require monoclausal c- and f-structures but biclausal a-structures;
these are the ones we will focus on.
------------------------------
To: nl-kr@cs.rpi.edu
Date: Thu, 18 Oct 90 17:44:43 -0400
From: walker@flash.bellcore.com (Don Walker)
Subject: Prague Summer School on Formal & Computational Models of Meaning
SUMMER SCHOOL IN COMPUTATIONAL LINGUISTICS
FORMAL AND COMPUTATIONAL MODELS OF MEANING
Charles University
Prague, Czechoslovakia
July 8 - 21, 1991
The 1991 Summer School in Computational Linguistics is organized by the Faculty
of Mathematics and Physics, Charles University in close collaboration with the
re-established Department of Theoretical and Computational Linguistics at the
Faculty of Philosophy, Charles University, Prague (Head: Petr Sgall). The main
focus of the School is the interdisciplinary domain of formal and computational
models of meaning. The program will be organized in four 2-hour nonoverlapping
blocks per day, workshop and guest lectures.
FEES
Industrial participants 900 USD
Academic community 700 USD
The fees cover the costs of all courses, a welcome reception, a guided tour of
Prague, accommodation in double rooms in the University students hostel for the
whole period of the School (13 nights) and 3 meals per day in the students
canteen (12 days). The organizers cannot assume responsibility for hotel
accommodation.
PREREGISTRATION
To preregister, please fill in the attached form. Only those who send in the
preregistration form will receive the final information and registration forms.
The deadline for preregistration is NOVEMBER 30, 1990
For further details contact: Dr. Eva Hajicova
MFF UK - Linguistics
Malostranske n. 25
CS - 118 00 Prague 1
CZECHOSLOVAKIA
COURSES
The types of lexical information for a dictionary in an integrated linguistic
description
Juri D. Apresjan, Academy of Sciences, Moscow, USSR
Computational lexicography
B.T.S. Atkins, Oxford University Press, UK
Meaning and understanding in MT
Christian Boitet, G.E.T.A., Grenoble, France
Computational semantics
Jens Erik Fenstad, University of Oslo, Norway
Semantic interpretation and construction grammar
Charles J. Fillmore, University of California, Berkeley, USA
A functional approach to the meaning of the sentence and to intersentential
links
Eva Hajicova and Petr Sgall, Charles University, Prague, Czechoslovakia
Contextual influences on meaning
Martha E. Pollack, SRI International, USA
New developments in grammar formalisms
Hans Uszkoreit, University of Saarbruecken, FRG
Discourse and user models
Wolfgang Wahlster, University of Saarbruecken, FGR
Intensional semantics
Mats Rooth, University of Texas, USA
Computational lexical semantics
James Pustejovsky, Brandeis University, USA
Cognitive linguistics
George Lakoff, University of California, Berkeley, USA
PRE-REGISTRATION FORM
Deadline for pre-registration: November 30, 1990
NAME:
AFFILIATION (university or company):
ADDRESS for correspondence:
TELEPHONE:
Please, mark the appropriate box: industrial participant
academic institution
student
Previous schooling and experience in computational linguistics:
Fill in the form and return it to: MFF UK - Linguistics
c/o Anna Kotesovcova
Malostranske n.25
CS-118 00 Prague 1
CZECHOSLOVAKIA
------------------------------
End of NL-KR Digest
*******************
