Copy Link
Add to Bookmark
Report
NL-KR Digest Volume 06 No. 36
NL-KR Digest (Mon Sep 11 13:33:39 1989) Volume 6 No. 36
Today's Topics:
belief representation
Planning and Scheduling Reference Requested
Re: Planning and Scheduling Reference Requested
BELIEFS
Connectionist NLP
locating a paper
Morphological analyzers; Hebrew; English?
ACL 1990 Call for Papers: 6-9 June 1990, Pittsburgh
International workshop on Inheritance in NLP
CFP: 6th IEEE Conference on AI Applications
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.1.10] 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.
-----------------------------------------------------------------
To: nl-kr@cs.rpi.edu
From: mcvax!irst.it!basso@uunet.UU.NET ( Basso Andrea)
Newsgroups: comp.ai,comp.ai.nlang-know-rep
Subject: belief representation
Date: 8 Sep 89 13:39:37 GMT
I am working on the development of a system for belief representation and
manipulation. I would be interested in communicating with other researcheres
working in this area.
I would appreciate any response.
-Andrea
ANDREA BASSO
IRST (Istituto per la Ricerca Scientifica e Tecnologica)
38050 Povo di Trento
TRENTO (ITALY)
e-mail adresses:
basso@irst.it
basso@irst.uucp
..!mcvax!i2unix!irst!basso
basso%irst@uunet.uu.net (from ARPA)
------------------------------
To: nl-kr@cs.rpi.edu
From: deale@aurora.laic.uucp (Michael Deale)
Newsgroups: comp.ai
Subject: Planning and Scheduling Reference Requested
Keywords: Planning, Scheduling
Date: 25 Aug 89 20:27:46 GMT
I have a article titled:
AI Planning: A Tutorial and Review
it is by
Mark Drummond, and Austin Tate.
Austin Tate is referenced in the bibliography as working on a
system named O-PLAN... There are a number of such references
to this system, and I am looking for more information on his
work... Unfortunately most of the published papers are European,
and difficult to find in the local libraries... I have tried Stanford's
library, and only found one of the references.
Does anyone know how to get in touch with the folks working on O-PLAN,
or where to get thier papers in the San Francisco Bay Area.
Thanks for any help you can provide.
MJD
------------------------------
To: nl-kr@cs.rpi.edu
From: roberto@aiai.uucp (Roberto Desimone)
Newsgroups: comp.ai
Subject: Re: Planning and Scheduling Reference Requested
Keywords: Planning, Scheduling
Date: 31 Aug 89 10:41:47 GMT
Reply-To: roberto@aiai.uucp (Roberto Desimone)
In article <689@laic.UUCP> deale@aurora.laic.uucp (Michael Deale) writes:
>
>Does anyone know how to get in touch with the folks working on O-PLAN,
>or where to get thier papers in the San Francisco Bay Area.
We have since been in touch with Michael Deale concerning our work on
the O-Plan project. Most of the previous publications on O-Plan
describe earlier versions of the system. However, there are more recent
papers, including a more definitive paper about O-Plan, which is
currently being reveiwed for publication. This is available from AIAI:
O-Plan: the Open Planning Architecture
Currie, K.W. and Tate, A.
Submitted for publication. Also available as AIAI-TR-67.
Another paper, on search space pruning within O-Plan using a technique
called 'Temporal Coherence' was presented at IJCAI-89, jointly
authored by Mark Drummond (ex-AIAI), now of NASA Ames, AI Research Center,
and Ken Currie of AIAI.
O-Plan is being further developed as part of a 3 year research contract
funded by the USAF, co-ordinated by RADC, on "Spacecraft Command and
Control using AI Planning techniques" which began in July 1989. The
research, in particular, addresses the issue of closing the loop between
plan generation and executing monitoring in the face of simple plan
failures.
This project is includes the doctoral work done by Brian Drabble, now
at AIAI, on EXCALIBUR. This integrates qualitative reasoning techniques
with existing non-linear planning research to tackle the tasks of plan
execution monitoring and repair. See AIAI-TR-56.
For more details about O-Plan and our other planning and scheduling
research work, please get in touch with us at the following address:
AI Applications Institute (AIAI)
University of Edinburgh
80 South Bridge
Edinburgh EH1 1HN
Tel: +44 31 225-4464
Fax: +44 31 226-2730
or e-mail one of the following
Ken Currie k.currie%uk.ac.ed@nsfnet-relay.ac.uk
Roberto Desimone r.desimone%uk.ac.ed@nsfnet-relay.ac.uk
Brian Drabble b.drabble%uk.ac.ed@nsfnet-relay.ac.uk
Roberto Desimone
Knowledge-Based Planning Group (KBPG) at AIAI
------------------------------
To: nl-kr@cs.rpi.edu
From: mcvax!irst.it!basso@uunet.UU.NET ( Basso Andrea)
Newsgroups: comp.ai,comp.ai.nlang-know-rep
Subject: BELIEFS
Date: 8 Sep 89 20:15:18 GMT
I am working on the development of a system for belief representation and
manipulation.I would be interested in communicating with other researcheres
working in this area.
I would appreciate any response.
-Andrea
ANDREA BASSO
IRST (Istituto per la Ricerca Scientifica e Tecnologica)
38050 Povo di Trento
TRENTO (ITALY)
e-mail adresses:
basso@irst.it
basso@irst.uucp
..!mcvax!i2unix!irst!basso
basso%irst@uunet.uu.net (from ARPA)
------------------------------
To: nl-kr@cs.rpi.edu
From: munnari!ait.trl.OZ.AU!jacob@uunet.UU.NET (Jacob Cybulski)
Newsgroups: comp.ai.nlang-know-rep
Subject: Connectionist NLP
Date: 28 Aug 89 01:03:44 GMT
> I would like to know a little more about what the group around
> George Lakoff is doing w.r.t. the link between cognitive linguistics
> and connectionism.
Does anybody have any recent references on the connectionist approach
to natural language understanding? It does not have to be related to
George Lakoff work afterall! Any information would be appreciated.
Thank you Jacob o | o
\_/
------------------------------
To: nl-kr@cs.rpi.edu
From: sutton@comp.lancs.ac.uk (Steve Sutton)
Newsgroups: comp.ai,sci.lang
Subject: locating a paper
Date: 25 Aug 89 16:15:31 GMT
Reply-To: sutton@dcl-cs.UUCP (Steve Sutton)
I am trying to locate the following paper :-
'Some effects of syntactic context upon lexical access.'
Prather, P and Swinney, D.
1977.
[Presented at a meeting of the American Psychological Association.]
Can anyone send me a copy or offer more information on locating it?
Thanks in advance,
- -
JANET: sutton@uk.ac.lancs.comp | POST: University of Lancaster,
UUCP: ...!mcvax!ukc!dcl-cs!sutton | Department of Computing,
ARPA: sutton@comp.lancs.ac.uk | Bailrigg,
PHONE: +44 524 65201 Ext. 3796 | Lancaster, LA1 4YR
FAX: +44 524 381707 | UNITED KINGDOM
------------------------------
To: nl-kr@cs.rpi.edu
Date: Thu, 31 Aug 89 12:37:14 -0400
From: choueka@thunder.bellcore.com (Yaacov Choueka)
Subject: Morphological analyzers; Hebrew; English?
Following is an abstract of a talk to be given soon at a meeting
on Computational Linguistics in Haifa, Israel.
I would be grateful for any information on the questions
raised at the end of this abstract.
Yaacov Choueka, Bar-Ilan University, Ramat-Gan, Israel.
choueka@bimacs.bitnet
Now visiting Bellcore, NJ, till 09/14, choueka@thunder.bellcore.com
================================================================
"MILIM" (WORDS)
A complete and accurate morphological
analyzer for modern Hebrew for a PC environment
Yaacov Choueka (1,2) Yoni Neeman (2)
1) Bar-Ilan University, Ramat-Gan, Israel.
2) Center for Educational Technology, Ramat Aviv, Tel-Aviv.
=============================
As a typical semitic language, Hebrew has a rather complex
morphology. A verb can be conjugated in several modes, tenses,
persons and genders; causative pronouns can be suffixed and
combinations of prepositions can be prefixed to the conjugated form,
bringing the total number of morphological variants of one verb to a
few thousand variants. Similar considerations apply also to nominal
forms. No adequate natural language processing systems (such as
spelling checkers, full-text retrieval systems, mechanical
translation software, etc.) can be therefore developed for
Hebrew without a morphological analyzer operating in the background.
"MILIM" is a portable morphological analyzer for modern
Hebrew developed for the PC environment. It accepts as input any
string of characters and produces as output a complete and
linguistically accurate analysis of that string, giving the
lemma (=basic form, standard dictionary entry), the root and all
relevant morphological attributes, such as (for verbs): mode, tense,
person and gender, attached pronouns and prepositions, etc. If the
given word has several possible analyses, it will list them all.
Based on a carefully coded dictionary and a computerized version of
the Hebrew morphology, MILIM will correctly recognize and
analyze any linguistically legitimate entity, including "exceptions"
and "irregular" cases.
MILIM processes non-pointed Hebrew, and can recognize both
grammatical spelling ("ktiv hasser") as well as "plene" one
("ktiv male"). It also recognizes common non-linguistic textual
entities such as abbreviations, acronyms, proper names of places
and people, etc. Its response time is immediate, and it requires
less than 2 MB of internal and disk memory.
A VAX/VMS version is also available.
========================================================================h
Questions:
Is there such a package for English, that can be attached
to any natural language processing system running on a
PC or a VAX?
I am not interested in suffix-stripping routines, stemming
algorithms, approximate solutions, and the like. I am asking
about the availability of a package that can be called
from some specified operating system environment (much as "spell" is
used in Unix), and given a string, will output its
linguistically correct analyses, and specially a pointer to
its dictionary entry (so that all of the information attached
to this entry in any computerized dictionary - including
word senses, quotations, collocations, etc.,- can then be made
available), as in the following examples:
saw--- 1. past of (to) see, transitive verb,...
2. noun, singular, ...
3. tr. verb ...
4. in. verb...
.
.
saws-- 1. plural of saw, noun,...
Obviously such a tool will be closely tied to a given
dictionary and will be no more comprehensive or "correct"
than its dictionary base, but that's OK.
A good extra bonus can be some marking of the dictionary
entries that will enable their grouping together into
morphologically and semantically related "families" or
"roots". The following different dictionary entries will
be labeled for example as belonging to the same "family":
computer, computation, computational, (to) compute,
(to) computerize, etc... Note that this notion is
not related in any way to synonymity: "calculation" will not
be in the family just mentioned.
I am also not interested in such products if they
are proprietary or not available for purchase at
a "reasonable" fee, or if they are strongly attached to
one specific application.
Is such a tool available now (or will be very soon)?
Thanks!
------------------------------
To: nl-kr@cs.rpi.edu
Date: Tue, 5 Sep 89 11:48:57 EDT
From: walker@flash.bellcore.com (Donald E Walker)
Subject: ACL 1990 Call for Papers: 6-9 June 1990, Pittsburgh
CALL FOR PAPERS
28th Annual Meeting of the Association for Computational Linguistics
6-9 June 1990
University of Pittsburgh
Pittsburgh, Pennsylvania
TOPICS OF INTEREST: Papers are invited on substantial, original,
and unpublished research on all aspects of computational linguistics,
including, but not limited to, pragmatics, discourse, semantics,
syntax, and the lexicon; phonetics, phonology, and morphology;
interpreting and generating spoken and written language; linguistic,
mathematical, and psychological models of language; machine
translation and translation aids; natural language interfaces;
message understanding systems; and theoretical and applications
papers of every kind.
REQUIREMENTS: Papers should describe unique work; they should
emphasize completed work rather than intended work; and they should
indicate clearly the state of completion of the reported results.
A paper accepted for presentation at the ACL Meeting cannot be
presented at another conference.
FORMAT FOR SUBMISSION: Authors should submit twelve copies of
preliminary versions of their papers, not to exceed 3200 words
(exclusive of references). The title page should include the title,
the name(s) of the author(s), complete addresses, a short (5 line)
summary, and a specification of the topic area. Submissions that
do not conform to this format will not be reviewed. Send to:
Robert C. Berwick
ACL-90 Program Chair
MIT AI Laboratory, Room 838
545 Technology Square
Cambridge, MA 02139 USA
(+1 617)253-8918
berwick@wheaties.ai.mit.edu
SCHEDULE: Final papers are due by 16 December 1989. Authors
will be notified of acceptance by 3 February 1990. Camera-ready
copies of final papers prepared in a double-column format, preferably
on laser-printer output must be received by 7 April 1990, along
with a signed copyright release statement.
OTHER ACTIVITIES: The meeting will include a program of tutorials
organized by Dan Flickinger, Hewlett-Packard Research Laboratories,
1501 Page Mill Road, Palo Alto, CA 94304, USA; (+1 415)857-8789;
flickinger@hp.com. Anyone wishing to arrange an exhibit or present
a demonstration should send a brief description together with a
specification of physical requirements (space, power, telephone
connections, tables, etc.) to Rich Thomason at the address below.
CONFERENCE INFORMATION: Local arrangements are being handled by
Rich Thomason, Intelligent Systems Program, Cathedral of Learning
1004, University of Pittsburgh, Pittsburgh, PA 15260, USA; (+1
412)624-5791; thomason@cad.cs.cmu.edu. For other information on
the conference and on the ACL more generally, contact Don Walker
(ACL), Bellcore, MRE 2A379, 445 South Street, Box 1910, Morristown,
NJ 07960-1910, USA; (+1 201)829-4312; walker@flash.bellcore.com or
bellcore!walker.
PROGRAM COMMITTEE: Robert Berwick, David Israel, Karen Jensen,
Aravind Joshi, Richard Larson, Paul Martin, Kathy McKeown, Martha
Pollack, James Pustejovsky, Edward Stabler, Hans Uszkoreit, David
Weir.
------------------------------
To: nl-kr@cs.rpi.edu
X-Delivery-Notice: SMTP MAIL FROM does not correspond to sender.
Date: Fri, 8 Sep 89 11:38:49 +0200
From: walter%KUB.NL@CUNYVM.CUNY.EDU
Subject: International workshop on Inheritance in NLP
FIRST CALL FOR PARTICIPATION
INTERNATIONAL WORKSHOP ON INHERITANCE IN NATURAL LANGUAGE PROCESSING
Institute for Language Technology and AI
Tilburg University
The Netherlands
Thursday 16 - Saturday 18 August, 1990 (Between ECAI and COLING)
Organized by
Walter Daelemans (Institute for Language Technology and AI,
Tilburg University)
Gerald Gazdar (School of Cognitive & Computing Sciences,
University of Sussex)
Program Committee:
Jo Calder, University of Edinburgh
Walter Daelemans, Tilburg University
Koenraad De Smedt, University of Nijmegen
Roger Evans, University of Sussex
Gerald Gazdar, University of Sussex
Keynote Speaker:
Richmond H. Thomason, University of Pittsburgh
Description: Structure sharing by inheritance in frame-based and
object-oriented programming languages has been used for the
representation of linguistic knowledge since the mid seventies. At
first for the representation of semantic and world knowledge, later
also for the representation of other types of linguistic knowledge.
Capturing the meaning of the non-monotonic and default reasoning that
is promoted by inheritance has been the subject of various extensions
of logic. Recently, some linguistic theories have incorporated a form
of inheritance explicitly into their theoretical framework (e.g. Word
Grammar and HPSG). The aim of the workshop is to bring together
linguists, AI-researchers and logicians interested in the application
of the concept of inheritance to natural language processing.
Topics:
Some of the topics that will be discussed (confined to a linguistic
context) are the following:
- Applications of inheritance to linguistic description.
- The theoretical linguistic status of different types of inheritance
(single, multiple, class inheritance, delegation).
- Semantics of inheritance systems.
- Symbolic and subsymbolic (connectionist, genetic search) approaches
to the learning of inheritance hierarchies.
Format:
To encourage interaction, the workshop will be limited to about 30
people, the majority of which will present a paper on their work.
Attendance is by invitation. Please submit 5 hardcopies of an extended
abstract to Walter Daelemans, describing work to be presented at the
workshop.
Deadlines: March 31, 1990: Extended abstracts due
May 31, 1990: Notification of acceptance
For more information, please contact:
Walter Daelemans
ITK, Tilburg University Email: walter@kub.nl
P.O. Box 90153 ...!hp4nl!kubix!walter
NL-5000 LE Tilburg Telephone: +31 13 663070
The Netherlands Fax: +31 13 663019
------------------------------
To: nl-kr@cs.rpi.edu
Date: Mon, 11 Sep 89 12:26:00 -0400
From: finin@PRC.Unisys.COM
Subject: CFP: 6th IEEE Conference on AI Applications
CALL FOR PARTICIPATION
The Sixth IEEE Conference on
Artificial Intelligence Applications
Fess Parker's Red Lion Resort
Santa Barbara, California
March 5-9, 1990
Sponsored by: The Computer Society of IEEE
The conference is devoted to the application of artificial intelligence
techniques to real-world problems. Two kinds of papers are appropriate:
Case studies of knowledge-based applications that solve significant problems
and stimulate the development of useful techniques. Papers on AI techniques
and principles that underlie knowledge-based systems, and in turn, enable
ever more ambitious real-world applications. This conference provides a
forum for such synergy between applications and AI techniques.
Papers describing significant unpublished results are solicited along
three tracks:
- "Engineering/Manufacturing" Track. Contributions stemming from
the general area of industrial and scientific applications.
- "Business/Decision Support" Track. Contributions stemming from
the general area of business, law and various decision support
applications.
Papers in these two application tracks must: (1) Justfy the use
of the AI technique, based on the problem definition and an
analysis of the application's requirements; (2) Explain how AI
technology was used to solve a significant problem; (3) Describe
the status of the implementation; (4) Evaluate both the
effectiveness of the implementation and the technique used.
- "Enabling Technology" Track. Contributions focusing on techniques
and principles that facilitate the development of practical knowledge
based systems, and can be scaled to handle increasing problem complexity.
Topics include, but not limited to: knowledge
acquisition, representation, reasoning, searching, learning, software
life cycle issues, consistency maintenance, verification/validation,
project management, the user interface, integration, problem-
solving architectures, and general tools.
Papers should be limited to 5000 words. The first page of the paper should
contain the following information (where applicable) in the order shown:
- Title.
- Authors' names and affiliation. (specify student)
- Abstract: A 200 word abstract that includes a clear statement on
what the original contribution is and what new lesson is imparted
by the paper.
- AI topic: Knowledge acquisition, explanation, diagnosis, etc.
- Domain area: Mechanical design, factory scheduling, education,
medicine, etc. Do NOT specify the track.
- Language/Tool: Underlying language and knowledge engineering tools.
- Status: development and deployment status as appropriate.
- Effort: Person-years of effort put into developing the particular
aspect of the project being described.
- Impact: A 20 word description of estimated or measured (specify)
benefit of the application developed.
Each paper accepted for publication will be allotted seven pages in the
conference proceedings. Best papers accepted in the Enabling Technology
track will be considered for a special issue of IEEE Transactions on
Knowledge and Data Engineering (TDKE) to appear in late 1990. Best
papers accepted in the application tracks will be considered for a
special issue of IEEE EXPERT, also to appear in late 1990. In addition,
there will be a best student paper award of $1,500, sponsored by IBM
for this conference.
In addition to papers, we will be accepting the following types of
submissions:
- Proposals for Panel discussions. Topic and desired participants.
Indicate the membership of the panel and whether you are interested
in organizing/moderating the discussion. A panel proposal should
include a 1000-word summary of the proposed subject.
- Proposals for Demonstrations. Videotape and/or description of a live
presentation (not to exceed 1000 words). The demonstration should be
of a particular system or technique that shows the reduction to
practice of one of the conference topics. The demonstration or video
tape should be not longer than 15 minutes.
- Proposals for Tutorial Presentations. Proposals of both an
introductory and advanced nature are requested. Topics should relate
to the management and technical development of usable and useful
artificial intelligence applications. Particularly of interest are
tutorials analyzing classes of applications in depth and techniques
appropriate for a particular class of applications. However, all
topics will be considered. Tutorials are three hours in
duration; copies of slides are to be provided in advance to IEEE for
reproduction.
Each tutorial proposal should include the following:
* Detailed topic list and extended abstract (about 3 pages)
* Tutorial level: introductory, intermediate, or advanced
* Prerequisite reading for intermediate and advanced tutorials
* Short professional vita including presenter's experience in
lectures and tutorials.
- Proposals for Vendor Presentations: A separate session will be held
where vendors will have the opportunity to give an overview to
their AI-based software products and services.
IMPORTANT DATES
- September 29, 1989: Six copies of Papers, and four copies of all
the proposals are due. Submissions not received by that date will
be returned unopened. Electronically transmitted materials will not
be accepted.
- October 30, 1989: Author notifications mailed.
- December 12, 1989: Accepted papers due to IEEE. Accepted tutorial
notes due to Tutorial Chair, Donald Kosy
- March 5-6, 1990: Tutorials
- March 7-9, 1990: Conference
Submit Papers and Other Materials to:
Se June Hong (Room 31-206)
IBM T.J. Watson Research Center
P.O. Box 218
Yorktown Heights, NY 10598
USA
Phone: (914)-945-2265
CSNET: HONG@IBM.COM
FAX: (914)-945-2141
TELEX: 910-240-0632
Submit Tutorial Proposals to:
Donald Kosy
Robotics Institute
Carnegie Mellon University
Pittsburgh, Pennsylvania 15213
Phone: 412-268-8814
ARPANET: kosy@cs.cmu.edu
CONFERENCE COMMITTEES
General Chair
Mark S. Fox, Carnegie-Mellon University
Publicity Chair
Jeff Pepper, Carnegie Group Inc
Tutorial Chair
Donald Kosy, Carnegie Mellon University
Program Committee
Chair Se June Hong, IBM Research
At-large Jan Aikins, AION Corp.
John Gero, University of Sidney
Robert E. Filman, IntelliCorp
Gary Kahn, Carnegie Group
John Mc Dermott, DEC
Engineering/Manufacturing Track
Chair Chris Tong, Rutgers University (Visiting IBM)
Sanjaya Addanki, IBM Research
Alice Agogino, UC Berkeley
Miro Benda, Boeing Computer Services
Sanjay Mittal, Xerox PARC
Duvurru Sriram, MIT
Business/Decision Support Track
Chair Peter Hart, Syntelligence
Chidanand Apte, IBM Research
Vasant Dhar, New York University
Richard Fikes, Price-Waterhouse
Timothy Finin, Unisys Paoli Research Center
Daniel O'Leary, University of Southern California
Enabling Technology Track
Chair Howard Shrobe, Symbolics
Lee Erman, CIMFLEX-Teknowledge
Brian Gaines, University of Calgary
Eric Mays, IBM Research
Kathy McKeown, Columbia University
Katia Sycara, Carnegie-Mellon University
Additional Information
For registration and additional conference information, contact:
CAIA-90
The Computer Society of the IEEE
1730 Massachusetts Avenue, NW
Washington, DC 20036-1903
Phone: 202-371-0101
------------------------------
End of NL-KR Digest
*******************
