| T.R | Title | User | Personal
Name | Date | Lines |
|---|
| 125.1 | NL-KR Digest Volume 6 No. 30 | HERON::ROACH | TANSTAAFL ! | Wed Aug 09 1989 11:46 | 499 |
| Printed by: Pat Roach Document Number: 008361
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 08-Aug-1989 10:55pm ETE
From: AI_INFO
AI_INFO@AIVTX@HERON@MRGATE@VALMTS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest Volume 6 No. 30
NL-KR Digest (Fri Jul 7 12:45:01 1989) Volume 6 No. 30
Today's Topics:
A Knowledge Based Software Information System (Unisys seminar)
New Book: INTERLINGUISTICS
Proper Place of Connectionism
ACE Version 1.3 Distribution
INFORMATION NEEDED.......
Re: Natural Language
Knowledge Engineering References
Re: Knowledge Engineering References
Re: Knowledge Engineering References
Submissions: [email protected]
Requests, policy: [email protected]
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: [email protected]
Date: Wed, 5 Jul 89 15:30:58 -0400
>From: [email protected]
Subject: A Knowledge Based Software Information System (Unisys seminar)
AI SEMINAR
UNISYS PAOLI RESEARCH CENTER
A Knowledge Based Software Information System
Prem Devanbu
AT&T Bell Laboratories
The difficulty of maintaining very large software systems is becoming widely
acknowledged. One of the primary problems is the difficulty of accessing
information about a complex and evolving system. Brooks calls this the problem
of "invisibility". This problem leads to various difficulties, including
reduced quality and productivity. We are exploring the contribution to be made
by applying knowledge representation and reasoning to the management of
information about large systems. LaSSIE is a prototype tool (based on the
ARGON system) that uses a frame-based description language and classification
inferences to facilitate a programmer's discovery of the structure of a
complex system. It also supports the retrieval of software for possible re-use
in a new development task. We describe our experiences in building this tool,
what we have learned about this approach.
11:00am July 17
BIC Conference Room
Unisys Paoli Research Center
Route 252 and Central Ave.
Paoli PA 19311
-- non-Unisys visitors who are interested in attending should --
-- send email to [email protected] or call 215-648-7446 --
------------------------------
To: [email protected]
Date: Fri, 7 Jul 89 08:48:55 +0200
>From: Klaus Schubert <[email protected]>
Phone: +31 30 911911
Fax: +31 30 944048
Telex: 40342 bso nl
Subject: New Book: INTERLINGUISTICS
****************************************************************************
I send this book announcement to the readers of the NL-KR Bulletin with a
special dedication. Which is the topic the NL-KR subscribers are interested
in most of all? The answer is short and clear: ESPERANTO. Why? Study the
history of the Bulletin since 1986. The moderator (Brad Miller in those days)
only once in these years found it necessary to cut a discussion that did not
stop by itself: the discussion about Esperanto. My personal conclusion from
that discussion was that quite a few people took part in the controversy
without actually KNOWING very much about planned languages. Most of the
contributions were assumptions and unproved claims.
It is because of this observation that I am especially glad to announce the
below book on INTERLINGUISTICS to the subscribers of this Bulletin.
Klaus Schubert
************** BOOK ANNOUNCEMENT ************** BOOK ANNOUNCEMENT ***********
INTERLINGUISTICS - ASPECTS OF THE SCIENCE OF PLANNED LANGUAGES.
Red. Klaus Schubert (kunlabore kun Dan Maxwell).
Berlin / New York: Mouton de Gruyter 1989, 348 p.
Contents:
Part I: Introductions
Andr'e MARTINET (Paris): The proof of the pudding. Introductory note
Klaus SCHUBERT (Utrecht): Interlinguistics - its aims, its achievements, and
its place in language science
Part II: Planned Languages in Linguistics
Aleksandr D. DULI^CENKO (Tartu): Ethnic language and planned language
Detlev BLANKE (Berlin): Planned languages - a survey of some of the main
problems
Sergej N. KUZNECOV (Moscow): Interlinguistics: a branch of applied linguistics?
Part III: Language Design and Language Change
Dan MAXWELL (Utrecht): Principles for constructing Planned Languages
Francois LO JACOMO (Paris): Optimization in language planning
Claude PIRON (Geneva): A few notes on the evolution of Esperanto
Part IV: Sociolinguistics and Psycholinguistics
Jonathan POOL (Seattle) - Bernard GROFMAN (Irvine): Linguistic artificiality
and cognitive competence
Claude PIRON (Geneva): Who are the speakers of Esperanto?
Tazio CARLEVARO (Bellinzona): Planned auxiliary language and communicative
competence
Part V: The Language of Literature
Manuel HALVELIK (Antwerp): Planning nonstandard language
Pierre JANTON (Clermont-Ferrand): If Shakespeare had written in Esperanto ...
Part VI: Grammar
Probal DASGUPTA (Hyderabad): Degree words in Esperanto and categories in
Universal Grammar
Klaus SCHUBERT (Utrecht): An unplanned development in planned languages. A
study of word grammar
Part VII: Terminology and Computational Lexicography
Wera BLANKE (Berlin): Terminological standardization - its roots and fruits
in planned languages
R"udiger EICHHOLZ (Bailieboro): Terminics in the interethnic language
Victor SADLER (Utrecht): Knowledge-driven terminography for machine translation
Index
*****************************************************************************
------------------------------
To: [email protected]
>From: [email protected] (S. R. Harnad)
Newsgroups: comp.ai
Subject: Proper Place of Connectionism
Keywords: Categorization, Behavioral Capacity, Feature Detection
Date: 16 Jun 89 06:09:24 GMT
[[ The next few articles are from the comp.ai and comp.ai.shells newsgroups.
I will, on occasion, post articles from there that seem relevant to this
group. In the future I won't be making note of it, but you can tell
from the `Newsgroups: ' line in the header of a msg. Be careful when
replying to such message, as the original poster probably does not
read this digest. This next one may not seem appropriate for nl-kr,
but some readers have commented that they missed Steve Harnad's
`colorful' comments. -CW]]
ON THE PROPER PLACE OF CONNECTIONISM IN MODELLING OUR BEHAVIORAL CAPACITIES
(Abstract of paper presented at First Annual Meeting of the American
Psychological Society, Alexandria VA, June 11 1989)
Stevan Harnad, Psychology Department, Princeton University, Princeton NJ 08544
Connectionism is a family of statistical techniques for extracting
complex higher-order correlations from data. It can also be interpreted
and implemented as a neural network of interconnected units with
weighted positive and negative interconnections. Many claims and
counterclaims have been made about connectionism: Some have said it
will supplant artificial intelligence (symbol manipulation) and
explain how we learn and how our brain works. Others have said it is
just a limited family of statistical pattern recognition techniques and
will not be able to account for most of our behavior and cognition. I
will try to sketch how connectionist processes could play a crucial
but partial role in modeling our behavioral capacities in learning and
representing invariances in the input, thereby mediating the "grounding"
of symbolic representations in analog sensory representations. The
behavioral capacity I will focus on is categorization: Our ability to
sort and label inputs correctly on the basis of feedback from the
consequences of miscategorization.
- -
Stevan Harnad INTERNET: [email protected] [email protected]
[email protected] [email protected] [email protected]
CSNET: harnad%[email protected]
BITNET: [email protected] [email protected] (609)-921-7771
------------------------------
To: [email protected]
>From: [email protected] (David Wolfram)
Newsgroups: comp.ai
Subject: ACE Version 1.3 Distribution
Date: 20 Jun 89 08:47:45 GMT
Reply-To: [email protected] (David Wolfram)
Posted: Tue Jun 20 09:47:45 1989
ACE Version 1.3
---------------
ACE (Abstract Clause Engine) is an experimental program for solving problems
specified by clauses. It has a variety of generic search methods, and a
preprocessor. It should be useful for developing prototype languages, and for
use in courses on logic programming or proof theory.
Example problems include:
- logic programming with equational unification
- equational unification
- rewriting
- logic programming
- context-free grammar parsing and generation
- n queens problem
- distinct representatives problem.
The search methods include:
- backtrack
- optimised forward checking with search rearrangement
- adaptive backtrack
- depth first and breadth first search
- iterative deepening (for one or more solutions).
Some of these methods can be combined. For example, adaptive backtrack and
iterative deepening. Search methods can also be combined to solve a problem.
In logic programming with equational unification, the search method for
finding equational unifiers can be different from that for finding
refutations.
ACE is written and distributed as Standard ML Version 2 source files in tar
format on tape. It is approximately 125Kb in total size. It can be compiled
with Poly/ML v1.75, and Standard ML of New Jersey, Version 0.33. Poly/ML is
available only for VAX and Sun-3 computers running Berkeley UNIX. A Sun
should have at last 4Mb of store. Cambridge can distribute Poly/ML for
academic research purposes only. A Poly/ML licence permitting teaching or
commercial research can be obtained from
Imperial Software Technology
3 Glisson Road
Cambridge CB1 2HA
England.
Phone: +44 223 462400.
Please write to receive a copy of the licence agreement for ACE Version 1.3
and state whether you require a licence agreement for Poly/ML for academic
research. Licence forms can be sent to you in LaTeX format by email. There is
a distribution fee of 100 pounds sterling for ACE and 100 pounds sterling for
Poly/ML, if it is required. The first distribution is expected to occur in
September 1989.
- --------------------------------------------------------------------------
David Wolfram E-mail: [email protected]
University of Cambridge Telex: via 81240 CAMSPL G
Computer Laboratory Fax: +44 223 334748
Pembroke Street Phone: +44 223 334634
Cambridge CB2 3QG
England.
------------------------------
To: [email protected]
>From: [email protected] (Alex M. Chan.)
Newsgroups: comp.ai,comp.lang.smalltalk,comp.lang.lisp,or.general,pdx.general
Subject: INFORMATION NEEDED.......
Date: 25 Jun 89 05:49:10 GMT
Reply-To: tektronix!nosun!whizz!tanya!kirk
A friend of mine is working on a Chinese-English translator. Needs:
1) Electronic bitmaps and copy of "The People's Republic of China
National Standard code of Chinese Graphic Character Set for
Information Interchange GB 2312-80" At least the primary
'ChASCII' set of 6763 characters. Any bitmap size from 24x24
thru 60x60 would help.
2) Electronic Chinese dictionary. Latest respected version in ChASCII
or whatever is available.
3) Electronic English-Chinese dictionary. Prefer "A New English-Chinese
Dictionary" with definitions in ChASCII code. Any such dictionary
would help.
4) Electronic Chinese-English dictionary. In addition to regular
dictionary text, need full definition of each ChASCII character
including meanings of individual strokes and sub-characters,
character combination rules including word formation and disallowed
combinations, and context shift rules.
5) Electronic English dictionary. Prefer Webster's New World, Third
edition, having 200,000 English words with definitions.
(Publisher won t sell electronic version. Any electronic dictionary
would help.
6) Electronic English Thesaurus and/or Chinese Thesaurus. Most have
some different entries, so prefer combination, but any would help.
7) Chinese Natural Language Parser/Generator. Handle 150 common
sentence types, distinguish word boundaries, parts of speech;
whatever is available.
8) English Natural Language Parser/Generator. Would like state of the
art aductive reasoning system but will take anything. Prefer Smalltalk,
Lisp OK.
9) If available in the Northwest, a Chinese-English linguist to help
on this project on a volunteer basis.
Anyone who can either provide any of these pieces to the translator or
who can refer me to a good source of any of these is encouraged to reply
via E-mail ( sun!nosun!{qiclab|whizz}!tanya!kirk )
or via US MAIL to: Kirk W. Fraser, PO Box 1426, Beaverton, OR 97075
Thank you in advance.
Sincerely,
K. W. Fraser.
------------------------------
To: [email protected]
>From: [email protected] (Eugene Miya)
Newsgroups: comp.ai
Subject: Re: Natural Language
Date: 28 Jun 89 16:28:31 GMT
Reply-To: [email protected] (Eugene Miya)
The current dicussion about various aspects of natural language
elicits me to ask the yearly query for examples of natural
language to test speech synthesis and recognition.
While a few people are working in these areas, there is lots of
interest by a naive public which does not understand all of the
issues in these areas. In an effort to aid testing, I ask for
sample text for either synthesis and/or recognition.
The existing informally collected file resides on aurora.arc.nasa.gov
in the directory pub and file can be grabbed using one of either two names:
speech.examples, or from a discussion in comp.arch on benchmarking names:
Rhosettastone (the file is identical).
Please email any example you might have to me as I do not reguarly read
comp.ai. I will include it into the file IF it does not alredy exist
in the file and does not contain potentially objectionable material
(taste, it is a Govt. machine and we have lots of bureaucrats around 8).
Credit will also be cited in the file.
Another gross generalization from
- -eugene miya, NASA Ames Research Center, [email protected]
resident cynic at the Rock of Ages Home for Retired Hackers:
"You trust the `reply' command with all those different mailers out there?"
"If my mail does not reach you, please accept my apology."
{ncar,decwrl,hplabs,uunet}!ames!eugene
Live free or die.
------------------------------
To: [email protected]
>From: [email protected] (Steve Peterson)
Newsgroups: comp.ai.shells
Subject: Knowledge Engineering References
Date: 15 Jun 89 22:36:00 GMT
Approved: [email protected]
Posted: Thu Jun 15 23:36:00 1989
Hello,
Recently I've been searching for some references on the knowledge
engineering process. I'd appreciate receiving any information on
methodologies for structuring the knowledge acquisition process
(manual or automated) and then transforming that knowledge into an
appropriate knowledge representation. Information on using a
top-down/structured approach with hueristics like "Define your object
classes before writing the rules", "Start with defining declarative
knowledge, then define procedural knowledge", "Group rules into
knowledge-islands", or "Only have one condition in the IF part of
your rules" would be especially interesting. Comparisons of
methodologies(top-down vs. bottom-up) would also be very interesting.
Thanks in advance and I'll post a summary to net if there is
sufficient interest.
Stephen Peterson
ARPA: [email protected]
UUCP: {decwrl!decvax, mit-eddie, attunix}!apollo!peterson_s
USPS: Apollo Computer, 220 Mill Rd.,MS: CHM 01 SS, Chelmsford MA. 01824
------------------------------
To: [email protected]
>From: [email protected] (Marco Valtorta)
Newsgroups: comp.ai.shells
Subject: Re: Knowledge Engineering References
Date: 18 Jun 89 17:55:22 GMT
Approved: [email protected]
Posted: Sun Jun 18 18:55:22 1989
In article <[email protected]> you write:
>Recently I've been searching for some references on the knowledge
>engineering process. I'd appreciate receiving any information on
>methodologies for structuring the knowledge acquisition process
>(manual or automated) and then transforming that knowledge into an
>appropriate knowledge representation. Information on using a
>top-down/structured approach with hueristics like "Define your object
>classes before writing the rules", "Start with defining declarative
>knowledge, then define procedural knowledge", "Group rules into
>knowledge-islands", or "Only have one condition in the IF part of
>your rules" would be especially interesting. Comparisons of
>methodologies(top-down vs. bottom-up) would also be very interesting.
I recommend that you look at the KADS methodology for knowledge
acquisition and structuring. Write joost breuker at the
University of Amsterdam: ...!mcvax!swivax!breuker.
I would be interested in a summary of replies to your query.
Marco Valtorta usenet: ...!ncrcae!usceast!mgv
Department of Computer Science csnet: [email protected]
University of South Carolina tel.: (1)(803)777-4641
Columbia, SC 29208 tlx: 805038 USC
U.S.A. fax: (1)(803)777-3065
usenet from Europe: ...!mcvax!uunet!ncrlnk!ncrcae!usceast!mgv
------------------------------
To: [email protected]
>From: [email protected] (Caroline Knight)
Newsgroups: comp.ai.shells
Subject: Re: Knowledge Engineering References
Date: 3 Jul 89 08:39:40 GMT
Approved: [email protected]
Posted: Mon Jul 3 09:39:40 1989
Also check out the research by Nigel Shadbolt, Nottinham University, UK
He has been doing comparative large-scale studies of some knowledge
acquisition techniques over the last few years.
See his (and his co-authors) papers in:-
Research and Development in Expert Systems IV ed by Stuart Moralee
(= proceedings of Expert Systems '87, held in Brighton, UK)
Proceedings of ECAI-88
Artificial Intelligence Review (1987) 1, pp245-253
And also for a now somewhat dated review of knowledge engineering and
in particular knowledge acquisition:
Margaret Welbank's "A Review of Knowledge Acquisition Techniques for Expert
Systems" BT Research Labs, Ipswich, UK. 1983
Caroline Knight
HPLabs, Bristol, UK
------------------------------
End of NL-KR Digest
*******************
|
| 125.2 | NL-KR Digest Volume 6 No. 31 | HERON::ROACH | TANSTAAFL ! | Wed Aug 09 1989 11:48 | 345 |
| Printed by: Pat Roach Document Number: 008363
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 08-Aug-1989 11:46pm ETE
From: AI_INFO
AI_INFO@AIVTX@MRGATE@DELOS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest Volume 6 No. 31
NL-KR Digest (Tue Jul 25 15:25:54 1989) Volume 6 No. 31
Today's Topics:
CFP: 6th IEEE Conference on AI Applications
IJCAI-89
Theorem Provers for Temporal Logic
Natural Lang.
Submissions: [email protected]
Requests, policy: [email protected]
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: [email protected]
Date: Fri, 7 Jul 89 22:21:47 -0400
>From: [email protected]
Subject: CFP: 6th IEEE Conference on AI Applications
PRELIMINARY 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: [email protected]
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: [email protected]
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
------------------------------
To: [email protected]
Date: Mon, 17 Jul 89 09:25:34 EDT
>From: [email protected] (Kathryn Dewitt)
Subject: IJCAI-89
WHAT'S so SPECIAL ABOUT IJCAI-89 in DETROIT?
*The Conference will present papers representing the best scientific
research in AI, distinguished speakers and panelists addressing major
topics of current interest, tutorials covering all major areas, and
exhibits with the latest in hardware and software developments.
(A Video Tape Track embodies recent developments in AI that can be
appreciated best in this medium.)
*The Voyager II's closet encounter of Neptune coincides with the
week of IJCAI-89. Conference attendees will be treated to a
continuous satellite feed of these never-before-seen live Neptune
images with commentary by JPL experts.
*A free performance by the Detroit Symphony Orchestra will be given
for the exclusive enjoyment of conference attendees.
*The conference reception will be held at a museum and outdoor complex
(Greenfield Village/Henry Ford Museum) with hundreds of historic
buildings and artifacts, including the ORIGINAL Edison Menlo Park Lab,
The Wright brothers' bicycle shop, and the theater chair in which
Abraham Lincoln was shot. Visitors may view numerous other unique
items of historical significance.
*The Detroit area's high concentration of advanced manufacturing
automation, including state-of-the-art robotic and computer vision
applications, will be directly visible on tours of the Big 3's
automotive assembly plants.
*An IJCAI "first" will be an on-site electronic messaging system
specially designed for this conference to enhance communication
among attendees during the week.
*To provide a synopsis of what kind of REAL-WORLD problems are solved
by AI, a panel will present highlights of deployed applications from
the AAAI-sponsored Innovative Applications of AI Conference.
------------------------------
To: [email protected]
>From: [email protected]
Newsgroups: sci.logic,comp.ai,comp.lang.lisp,comp.lang.prolog
Subject: Theorem Provers for Temporal Logic
Date: 7 Jul 89 15:56:34 GMT
Reply-To: [email protected] ()
Posted: Fri Jul 7 16:56:34 1989
Working in the fields of hardware specification and verification,
I am looking desperately for theorem provers which are able to cope with
temporal logic, especially with linear temporal logic
(as proposed e.g. by Manna & Pnueli).
Every reference to available systems or to people coping with
such tools are gratefully appreciated!
Please E-mail (CS-Net) to [email protected]
Thomas Kropf
Institute of Computer Design and Fault Tolerance
University of Karlsruhe
West-Germany
------------------------------
To: [email protected]
>From: [email protected] (Steve Sanderson)
Newsgroups: comp.ai
Subject: Natural Lang.
Keywords: natural lang sentence text linguistics analysis
Date: 24 Jul 89 19:45:19 GMT
Help!
I'm looking for survey information on the different methods of sentence
analysis and text linguistics. Since I'm relatively new to this area,
I'm interested in working both with individual sentences in isolation
*and* with units larger than a sentence, such as a paragraph, etc...
The following is some of the information I'm looking for with each method:
- Perhaps a brief description of the analysis method or
references to descriptions.
- Input domain; which domain it was designed for, which it
has a problem with, etc.
- What information the analysis yields
- Performance characteristics, whether projected or actual.
- Any other information you might think was useful for
evaluating different sentence analysis methods.
Does anyone out there know of where I can obtain this information? I
know I can get some introductory books, or some in-depth books but
I'm really looking for information to help me evaluate and briefly understand
many different methods, then when I find some that fit my requirements, I
can delve deeper.
Thanks,
Steve Sanderson
cs.utexas.edu!halley!san -or- [email protected]
------------------------------
End of NL-KR Digest
*******************
|
| 125.3 | NL-KR Digest V6 No. 32 | HERON::ROACH | TANSTAAFL ! | Mon Sep 04 1989 11:06 | 426 |
| Printed by: Pat Roach Document Number: 008617
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 02-Sep-1989 09:59am ETE
From: AI_INFO
AI_INFO@AIVTX@MRGATE@STATOS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V6 No. 32
NL-KR Digest (Wed Aug 9 11:11:58 1989) Volume 6 No. 32
Today's Topics:
Query - OCR of Arabic
Parsing word problems
Lexical Functional Grammar, Situations Semantics
NLU benchmarking - request for info
Formal Semantics
Sentence analysis and text linguistics
UM90: 2nd Int'l Workshop on User Modeling
IJCAI 89 Update
Tech Report: Symbol Grounding Problem
Submissions: [email protected]
Requests, policy: [email protected]
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: [email protected]
Date: 27 Jul 89 14:34:38+0200
>From: wilks yorick <[email protected]>
Subject: Query - OCR of Arabic
Is anyone out there aware of work on the OCR of Arabic letters
- -either as research or a commercial product? I would be
grateful for information on that or ony any computer-based
analysis of Turkish, either parsing, morphology, or redundancy
measures on letter sequences.
Thanks
[email protected]
Yorick Wilks
Computing Research Lab.,
NMSU, Las Cruces NM 88003.
------------------------------
To: [email protected]
Date: Mon, 31 Jul 89 10:12:15 EDT
>From: "Mark D. LeBlanc" <mdl%[email protected]>
Subject: Parsing word problems
Does anyone know of systems which parse word problems?
I'm a PhD student here at UNH and currently on a
"literature review wave." Many systems, including the
nice arithmetic word problem simulations (Kintsch,
Greeno, Cummins et al.) start with the word problem
in some propositional form. My question really addresses
those systems which do parse sentences/problems into some
"internal-meaning" representation.
My research area is Intelligent Tutoring Systems, specifically
in helping young (K-3) children solve arithmetic word
problems. I am aware of the 'original' works of
STUDENT (Bobrow), ISAAC (Novak),
Bregar,Bayley and Rapp's ATN, SOPHIE, etc.
Our current parser is a conceptual analyzer, in the spirit of
Schank, Riesbeck, Selfridge and Birnbaum, et al.
In short, the question is quite broad including current
PC software that you may have seen, tried, or just read about.
- Mark LeBlanc
[email protected]
------------------------------
To: [email protected]
>From: [email protected] (Petra Kurej)
Newsgroups: comp.ai.nlang-know-rep
Subject: Lexical Functional Grammar, Situations Semantics
Keywords: natural language database front end
Date: 1 Aug 89 06:41:00 GMT
Reply-To: [email protected] (Petra Kurej)
Hi,
we - two students at University of Dortmund - want to design and to implement
a natural language database front end.
The parser shall be based on the Lexical Functional Grammar formalism.
The representation of the functional structure may also comprise aspects
of situations semantics. As input language we want to use English and
the implementation language shall be PROLOG (esp. qprolog or cprolog).
We are therefore interested in information about related topics (literature,
experiences, software, etc.).
We are looking forward to your responses... .
So long,
CIAO
Antje & Petra
- ---------------------------------------------------------------------
UUCP: ...mcvax!unido!unidocv!kurej
- ---------------------------------------------------------------------
------------------------------
To: [email protected]
Date: Thu, 3 Aug 89 12:36:39 EDT
>From: [email protected]
Subject: NLU benchmarking - request for info
Reply-To: [email protected] (Robert Goldman)
Some time ago, in this digest, I recall reading about a workshop
about evaluation of natural-language understanding programs. Could
anyone provide me with more information about this workshop? Was a
report produced, or a set of position papers/abstracts? If so, I'd be
interested in seeing a copy.
Best,
Robert Goldman
------------------------------
To: [email protected]
>From: [email protected] (John Kozma)
Newsgroups: sci.lang,sci.logic,comp.lang.misc,comp.ai.nlang-know-rep
Subject: Formal Semantics
Keywords: detonational semantics model theory Montague case grammar
Date: 6 Aug 89 02:29:27 GMT
Reply-To: [email protected] (John Kozma)
Followup-To: sci.logic
Can anyone describe succinctly the distinction (if indeed there is one)
between "model theoretic semantics" and "denotational semantics"?
Or for that matter, between "denotation" and "extension", or between
"intensional" and "extensional" verbs.
For anyone familiar with both Goedel's First Incompleteness Theorem and
Montague Semantics, which do you consider easier to understand?
Finally, can anyone suggest references expressing a combination of
concepts from Case Grammar and Montague Semantics?
I'm attempting to post this to several different groups, but I'm not sure
whether some of them are moderated. Anyway, I will gladly post a summary
of responses to the same groups, though I judged it prudent to direct
follow-ups to sci.logic.
Thanx in advance,
John P. Kozma
[email protected]
------------------------------
To: [email protected]
>From: [email protected] (Steve Sanderson)
Newsgroups: comp.ai
Subject: Sentence analysis and text linguistics
Keywords: natural lang sentence text linguistics analysis
Date: 24 Jul 89 19:45:19 GMT
Organization: Tandem Computers, Austin, TX
[[the following article appeared on comp.ai, and was quite garbled by
the time it got here, I attempted to reconstruct it as best I could - CW ]]
Help!
I'm looking for survey information on the different methods of sentence
analysis and text linguistics. Since I'm relatively new to this area,
I'm interested in working both with individual sentences in isolation
*and* with units larger than a sentence, such as a paragraph, etc...
The following is some of the information I'm looking for with each method:
- Perhaps a brief description of the analysis method or
references to descriptions.
- Input domain; which domain it was designed for.
- What information the analysis yields
- Performance characteristics, whether projected or actual.
- Any other information you might think was useful for
evaluating different sentence analysis methods.
Does anyone out there know of where I can obtain this information? I
know I can get some introductory books, or some in-depth books but
I'm really looking for information to help me evaluate and briefly understand
many different methods, then when I find some that fit my requirements, I
can delve deeper.
Thanks,
Steve Sanderson
cs.utexas.edu!4alley!san -or- [email protected]#
------------------------------
To: [email protected]
>From: "Alfred Kobsa" <[email protected]>
Date: Tue, 8 Aug 89 11:15:16 +0200 (MET dst)
Subject: UM90: 2nd Int'l Workshop on User Modeling
Second International Workshop on User Modeling
Hawaii, March 30 - April 1, 1990
Call for Participation
Objectives
User models have recently attracted much research interest in the field of
computer dialog systems. It has become evident that the cooperativeness of
such systems can be greatly improved if the system has a model of the user
available which contains assumptions about his/her background knowledge as well
as his/her goals and plans in consulting the system. Research in the field of
user models investigates how such assumptions can be automatically created,
represented and exploited by the system in the course of an interaction with
the user.
This workshop (a sequel of one in Germany in 1986) will provide a forum for the
discussion of research topics central to the development of user modeling
components in dialog systems. The issues to be addressed include (but are not
restricted to):
-Acquisition of user and student models
-Plan recognition
-Representation of user models
-User stereotypes
-Dialog planning and response tailoring
-Levels of user expertise
-Student modeling and tutoring strategies
-Shell systems for user modeling
-Conceptual models, mental models
An explicit aim of the workshop is to bring together researchers working on
user modeling in the fields of Artificial Intelligence and Human-Computer
Interaction, as well as researchers working in the related field of student
modeling in Intelligent Tutoring Systems.
Program chairman David Chin, Univ. of Hawaii at Manoa, 2565 The Mall,
+ local arrangement Honolulu, HI 96822, U.S.A.
Phone: (808) 948-8162
E-mail: [email protected]
General Chairman Wolfgang Wahlster,
Dept. of Computer Science, Univ. of Saarbruecken and
German Research Center for Artificial Intelligence
D-6600 Saarbruecken 11, West Germany
Phone: +49 681 302 2363
E-mail: wahlster%fb10vax.uni-saarland.dbp.de
...[U.S.: uunet!]unido!sbsvax!wahlster
Program committee: Sandra Carberry, Univ. of Delaware, U.S.A.
Robin Cohen, Univ. of Waterloo, Canada
Thomas Green, Univ. of Cambridge, U.K.
Anthony Jameson, Univ. of Nijmegen, Netherlands
Aravind Joshi, Univ. of Pennsylvania, U.S.A.
Alfred Kobsa, Univ. of Saarbruecken, W. Germany
Gordon McCalla, Univ. of Saskatchewan, Canada
Kathleen McCoy, Univ. of Delaware, U.S.A.
Cecile Paris, Univ. of Southern California, U.S.A.
Elaine Rich, MCC, Austin, TX, U.S.A.
Derek Sleeman, Univ. of Aberdeen, U.K.
Michael Tauber, Univ. of Paderborn, W. Germany
To encourage interaction and a broad exchange of ideas, the workshop will be
kept to a moderate size - preferably to about 50 participants who will either
be presenters or commentators on presentations. Attendance is by invitation
only. Interested presenters should send 4 copies of an extended abstract or a
full paper of their talk to the program chairman (at least 6 pages,
double-spaced). Interested commentators should send him a short statement of
interest. Inquiries regarding the program and local arrangements should be
directed to David Chin, and all other inquiries to Wolfgang Wahlster.
Deadlines: Nov. 31, 1989: Extended abstracts due
Dec. 31, 1989: Statement of interest of commentators due
Jan. 31, 1990: Notification about acceptance of
presentation or attendance.
The papers of the workshop may be published in the newly founded international
journal 'User Modeling and User-Adapted Interaction'.
------------------------------
To: [email protected]
Date: Wed, 26 Jul 89 15:39:06 EDT
>From: [email protected] (Kathryn Dewitt)
Subject: IJCAI 89 Update
CONFERENCE HIGHLIGHTS
Invited Speakers:
Koichi Furukawa, ICOT will speak Monday, August 21, at
11:10am. The title of his talk is "Fifth Generation Computer
Project: Toward a Coherent Framework for Knowledge Information
Processing and Parallel Processing".
Gerald Edelman, Rockefeller University, will speak Monday
August 21, at 2:00pm. The title of his talk is "Neural
Darwinism and Selective Recognition Automata".
E.D. Dickmanns, Universitat de Bundeswehr Munchen, will speak
Wednesday, August 23, at 11:10am. The title of his talk is "Real-Time
Machine Vision Exploiting Integrak Spatio-Temporal World Models".
Enn Tyugu, Institute of Cybernetics, USSR, will speak
Thursday, August 24, at 9:00am. The title of his talk is
"Knowledge-Based Programming Environments"
Fernado Pereira, AT&T Bell Laboratories, will speak Thursday,
August 24, at 11:10am. The title of his talk is "Interpreting
Natural Language".
Geoffrey Hinton, University of Toronto, will speak Friday,
August 25, at 11:10 am. The title of his talk is
"Connectionist Learning Procedures".
Invited Panels:
THE CHALLENGE OF NEURAL DARWINISM - Monday, August 21, 4:15pm.
members: Stephen W. Smoliar(chair), Linda Smith, David Zisper,
John Holland and George Reeke.
ROBOT NAVIGATION - Tuesday, August 22, 9:00am
members: David Miller(chair), Rod Brooks, Raja
Chatila, Scott Harmon,
Stan Rosenschein, Chuck Thorpe, and Chuck Weisbin.
HIGH-IMPACT FUTURE RESEARCH DIRECTIONS FOR ARTIFICIAL INTELLIGENCE
Tuesday, August 22, 11:10am.
members: Perry Thorndyke(Chair), Raj Reddy, and Toshio Yakoi
ARTIFICIAL INTELLIGENCE and SPACE EXPLORATION - Tuesday,
August 22, 2:00pm
members: Peter Friedland(chair), David Atkinson, John Muratore,
and Greg Swietek.
(HOW) IS AI IMPACTING MANUFACTURING? - Friday, August 25, 9:00am.
members: Mark Fox (chair), E.J. van de Kraatz, Dennis
O'Connor, and Karl Kempf.
------------------------------
To: [email protected]
>From: [email protected] (S. R. Harnad)
Newsgroups: comp.ai
Subject: Tech Report: Symbol Grounding Problem
Keywords: connectionism language categorization Searle symbol-systems
Date: 4 Aug 89 04:37:21 GMT
Organization: Princeton University, NJ
THE SYMBOL GROUNDING PROBLEM
Stevan Harnad
Department of Psychology
Princeton University
ABSTRACT: There has been much discussion recently about the scope and
limits of purely symbolic models of the mind and about the proper role
of connectionism in cognitive modeling. This paper describes the
"symbol grounding problem" for a semantically interpretable symbol
system: How can its semantic interpretation be made intrinsic to the
symbol system, rather than just parasitic on the meanings in our heads?
How can the meanings of the meaningless symbol tokens, manipulated
solely on the basis of their (arbitrary) shapes, be grounded in
anything but other meaningless symbols? The problem is analogous to
trying to learn Chinese from a Chinese/Chinese dictionary alone.
A candidate solution is sketched: Symbolic representations must be
grounded bottom-up in nonsymbolic representations of two kinds:
(1) iconic representations, which are analogs of the proximal sensory
projections of distal objects and events, and (2) categorical
representations, which are learned and innate feature-detectors that
pick out the invariant features of object and event categories from
their sensory projections. Elementary symbols are the names of these
object and event categories, assigned on the basis of their
(nonsymbolic) categorical representations. Higher-order (3) symbolic
representations, grounded in these elementary symbols, consist of
symbol strings describing category membership relations ("An X is a Y
that is Z").
Connectionism is one natural candidate for the mechanism that learns
the invariant features underlying categorical representations, thereby
connecting names to the proximal projections of the distal objects they
stand for. In this way connectionism can be seen as a complementary
component in a hybrid nonsymbolic/symbolic model of the mind, rather
than a rival to purely symbolic modeling. Such a hybrid model would not
have an autonomous symbolic "module," however; the symbolic functions
would emerge as an intrinsically "dedicated" symbol system as a
consequence of the bottom-up grounding of categories' names in their
sensory representations. Symbol manipulation would be governed not just
by the arbitrary shapes of the symbol tokens, but by the nonarbitrary
shapes of the icons and category invariants in which they are grounded.
[Presented at CNLS Conference on Emergent Computation, June 1989
Submitted to Physica D -- Preprint Available]
- -
Stevan Harnad
INTERNET: [email protected] [email protected]
[email protected] [email protected] [email protected]
CSNET: harnad%[email protected]
BITNET: [email protected] [email protected]
(609)-921-7771
------------------------------
End of NL-KR Digest
*******************
|
| 125.4 | NL-KR Digest V6 No. 35 | HERON::ROACH | TANSTAAFL ! | Mon Sep 04 1989 11:07 | 251 |
| Printed by: Pat Roach Document Number: 008618
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 02-Sep-1989 10:39am ETE
From: AI_INFO
AI_INFO@AIVTX@MRGATE@DELOS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V6 No. 35
NL-KR Digest (Fri Aug 25 12:16:51 1989) Volume 6 No. 35
Today's Topics:
yet another paper on temporal representation
Allgayer & Reddig paper
Intelligent planning/scheduling approaches
Re: Formal Semantics
cognitive linguistics & connectionism
Word Recognition.
CSLI event
Submissions: [email protected]
Requests, policy: [email protected]
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: [email protected]
Date: Tue, 15 Aug 89 15:53:30 -0400
>From: [email protected]
Subject: yet another paper on temporal representation
Here is yet another paper on temporal representations.
@inProceedings{
author = {David Matuszek and Tim Finin and Rich Fritzson and Chris Overton},
title= {Endpoint Relations on Temporal Intervals},
booktitle = {Proceedings of the Third Annual Rocky
Mountain Conference on Artificial Intelligence},
month = {June},
year = {1988},
note = {also available as technical report LBS-8810, Unisys Paoli
Research Center, PO Box 517, Paoli PA 19301}}
This paper can be ordered by sending a request to:
UNISYS M. W. Freeman Memorial Library
Paoli Research Center
P. O. Box 517
Paoli, PA 19301
For additional information, contact Judie Norton, Technical
Information Specialist, [email protected], 215-648-7254, 215-648-7412 (fax).
------------------------------
To: [email protected]
>From: [email protected]
Newsgroups: comp.ai.nlang-know-rep
Subject: Allgayer & Reddig paper
Date: 22 Aug 89 19:31:22 GMT
does anyone have a copy of the following paper:
Allgayer, J. und C. Reddig (1986): Systemkonzeption zur Verarbeitung
kombinierter sprachlicher und gestlicher Referentenbeschreibungen. SFB
314, Dept. of Computer Science, University of Saarbruecken, FR Germany.
or perhaps an e-mail contact at U of Saarbruecken CS dept?
Thanks.
Jo Lammens
BITNET: [email protected] Internet: [email protected]
UUCP: ...!{watmath,boulder,decvax,rutgers}!sunybcs!lammens
------------------------------
To: [email protected]
>From: [email protected] (Richard Fozzard)
Newsgroups: comp.ai,comp.ai.neural-nets
Subject: Intelligent planning/scheduling approaches
Keywords: scheduling, planning
Date: 14 Aug 89 15:35:29 GMT
Reply-To: [email protected] (Richard Fozzard)
Are you working on or familiar with intelligent scheduling approaches?
We are preparing a grant to do work in this area and need a bibliography
of the most substantive seminal and recent work.
If you have some references, or even just suggestions of where to go to
find the good work, please email and I will send you a copy of the
bibliography I come up with. If there is sufficient interest, I will
also post it to the net.
thanks very much!
[[ Hmmmm...this is getting to be an epidemic - CW ]]
========================================================================
Richard Fozzard "Serendipity empowers"
University of Colorado
[email protected] (303)492-8136 or 444-3168
------------------------------
To: [email protected]
>From: [email protected]
Date: Fri Aug 18 10:18:27 1989
Subject: Re: Formal Semantics
Newsgroups: comp.ai.nlang-know-rep
References: <[email protected]>
In comp.ai.nlang-know-rep you write:
>Can anyone describe succinctly the distinction (if indeed there is one)
>between "model theoretic semantics" and "denotational semantics"?
>Or for that matter, between "denotation" and "extension", or between
>"intensional" and "extensional" verbs.
Briefly, the intuition behind extension/intension is that the
extension of a term is all the things it does refer to; its intension
is all the things it might refer to. When Montague get round to
desfining intension interrms of power sets of the extension life
becomes distinctly obscure.
Raphael Mankin
[email protected]
------------------------------
To: [email protected]
>From: [email protected] (Geert Adriaens)
Newsgroups: comp.ai.nlang-know-rep
Subject: cognitive linguistics & connectionism
Keywords: parallelism, interactive models
Date: 21 Aug 89 12:40:10 GMT
Hello,
In relation to an overview article for a book on parallel models of
natural language computation, 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. I heard Lakoff in
Duisburg (April 1989), and found his ideas very interesting. At the
time, however, there was nothing on paper about the link between
imagery, connectionism, etc. Does anyone have any references, or does
anyone have Lakoff's e-mail address?
Thanks.
- -
Geert Adriaens (SIEMENS-METAL Project)
Maria Theresiastraat 21 [email protected] or
B-3000 Leuven [email protected] or
tel: ..32 16 285091 [email protected]
------------------------------
To: [email protected]
>From: [email protected] (Steve Sutton)
Newsgroups: comp.ai,comp.ai.neural-nets,sci.lang
Subject: Word Recognition.
Keywords: Word Recognition, Lexical Access, Ambiguity Resolution.
Date: 22 Aug 89 09:22:40 GMT
Reply-To: [email protected] (Steve Sutton)
I am keen to know about good references, past/current projects and names of
people interested in the following topics :-
Word recognition and lexical access
- ----------------------------------
Word senses, word recognition and the processing of ambiguous words, including :
- experiments/investigations
- approaches/techniques
- lexical ambiguity
- models of recognition/disambiguation
(possibly components of larger natural language
understanding systems).
Also, any linguistic, psycholinguistic or computational issues related to
these areas.
Thanks in advance.
------------------------------
To: [email protected]
Date: Wed, 16 Aug 89 09:02:09 PDT
>From: [email protected] (Emma Pease)
Subject: CSLI event
COLLOQUIUM ANNOUNCEMENT
Sponsored by
The Center for the Study of Language and Information
and
The Department of Psychology
Speaker: Keith Stenning
Human Communications Research Centre,
Edinburgh University
Title: "One thing at a time!
Working memory and human reasoning style"
Time: Wednesday, August 23, 1989
3:30 PM
Place: Conference Room
Cordura Hall
ABSTRACT
Psychologists have generally taken questions about the relation
between classical logic and human reasoning to be questions whether
the logic of two systems is the same. An alternative is that
`externalised' classical calculi and `internalised' human reasoning
practices are different implementations of the same logical system.
This talk briefly describes an account of working memory for models
(Stenning Shepherd & Levy 1988, Stenning & Levy 1988) and explores its
implications the style of human syllogistic reasoning (see eg.
Johnson-Laird 1983).
References:
Johnson-Laird, P. N. (1983) Mental Models, CUP
Stenning, K. and J. Levy (1988) `Knowledge-rich solutions to the
binding problem: a simulation of some human computational mechanisms',
Knowledge Based Systems, 1(3), pps. 143-152
Stenning, K., M. Shepherd and J. Levy (1988) `On the construction of
representations for individuals from descriptions in text', Language
and Cognitive Processes, 3(3), pps. 129-164
------------------------------
End of NL-KR Digest
*******************
|
| 125.5 | NL-KR Digest V6 No. 33 | HERON::ROACH | TANSTAAFL ! | Mon Sep 04 1989 11:10 | 567 |
| Printed by: Pat Roach Document Number: 008620
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 02-Sep-1989 12:11pm ETE
From: AI_INFO
AI_INFO@AIVTX@MRGATE@DELOS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V6 No. 33
NL-KR Digest (Wed Aug 9 13:17:18 1989) Volume 6 No. 33
Today's Topics:
CRL documentation
intelligent control
time and space representation
References on Temporal Reasoning
Submissions: [email protected]
Requests, policy: [email protected]
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: [email protected]
Date: 28 Jul 89 14:20:17 GMT
>From: [email protected] (frames )
Newsgroups: comp.ai.nlang-know-rep
Subject: CRL documentation
Reply-To: [email protected] (Amedeo Napoli)
Organization: CRIN - INRIA, Nancy, France
I would be interested by the CRL (Carnegie Representation Language)
documentation, but I don't know the electronic address of people who
works on (and with) the language.
Can anybody give me some information ?
Many thanks in advance,
- -- Amedeo Napoli @ CRIN / Centre de Recherche en Informatique de Nancy
EMAIL : [email protected] - POST : BP 239, 54506 VANDOEUVRE CEDEX, France
[[ the email address for The Carnegie Group, Inc (CGI) KnowledgeCraft
Support group is: KCCS%[email protected]. You may need to be
a customer of CGI to actually get anything out of them. ]]
------------------------------
To: [email protected]
Date: 9 Aug 89 14:24 +0200
>From: Llums Vila <[email protected]>
Subject: intelligent control
Return-Receipt-To: Llums Vila <[email protected]>
===================
INTELLIGENT CONTROL
===================
Hello everyone,
the research group I am working in is involved in a project related to the
application of artificial intelligence techniques to process control and
supervision, and also the real-time problems it presents.
At this moment we are specially devoted to the study of the use of qualitative
reasoning to build deep knowledge models and on the other hand to the study of
the problems related with temporal reasoning.
We are interested in establish communication with people working in the same
area. If you are in this situation, please, contact with me.
---------------
We would like particularly to know a litle bit about...
- which are yours special interest points,
- the actual state of your work (and whether you are involved in a
concrete project),
- and the future collaboration possibilities you see.
Thanks.
Lluis.
==================
%---------------------------------------------------------------%
% Lluis Vila i Grabulosa E-mail: [email protected] %
% Centre d'Estudis Avangats de Blanes %
% Cami de Santa Barbara tel. +34 72 33 61 01 %
% 17300 Blanes telex. 56372 CEABL-E %
% Catalunya, Spain fax. +34 72 33 78 06 %
%---------------------------------------------------------------%
------------------------------
To: [email protected]
>From: [email protected] (frames )
Newsgroups: comp.ai.nlang-know-rep
Subject: time and space representation
Date: 9 Aug 89 13:24:24 GMT
Reply-To: [email protected] (Amedeo Napoli)
Organization: CRIN - INRIA, Nancy, France
Keywords: time, space, knowledge representation
Salut,
I am searching for papers on representation of time and space in
knowledge-based systems.
I would appreciate any informations (bibliography, softwares, etc.) on
these topics.
Could you send me the replies directly.
If the informations are of general interest, I will do a synthesis in
the news.
Many thanks in advance,
Amedeo Napoli
- -
- -- Amedeo Napoli @ CRIN / Centre de Recherche en Informatique de Nancy
EMAIL : [email protected] - POST : BP 239, 54506 VANDOEUVRE CEDEX, France
------------------------------
To: [email protected]
Date: Wed, 9 Aug 89 11:38:15 EDT
>From: [email protected] (Christopher A. Welty)
Subject: References on Temporal Reasoning
A number of people have asked for this, so here is waht I have, in
bibtex form:
@TechReport{allen81a,
key"allen81a",
author "ALLEN, J.F.",
title "Maintaining Knowledge About Temporal Intervals, TR 86",
institution "University of Rochester, Department of Computer Science",
year "1981"}
@TechReport{allen81b,
key"allen81b",
author "ALLEN, J.F.",
title "A general model of action and time, TR 97",
institution "University of Rochester, Department of Computer Science",
year "1981"}
@InProceedings{allen81c,
key "allen81c",
author "ALLEN, J.F.",
title "An Interval-Based Representation of Temporal Knowledge",
booktitle "Proceedings of 7th IJCAI",
organization "IJCAI",
pages"221-226",
month "August",
year "1981"}
@Article{allen83a,
key "allen83a",
author "ALLEN, J.F.",
title "Maintaining Knowledge About Temporal Intervals",
journal "Communications of the ACM",
volume "26(11)",
pages "832-843",
year "1983"}
@InProceedings{allen83b,
key "allen83b",
author "ALLEN, J.F. & KOOMEN, J.A.",
title "Planning using a temporal world model",
booktitle "Proceedings of 8th IJCAI 1983",
organization "IJCAI",
year "1983"}
@Article{allen84,
key "allen84",
author "ALLEN, J.F.",
title "Towards a general theory of action and time",
journal "Artificial Intelligence",
volume "23(2)",
pages "123-154",
year "1984"}
@TechReport{allen85a,
key"allen85a",
author "ALLEN, J.F. and HAYES, P.J.",
title "A Commonsense Theory of Time: The Longer Paper",
institution "University of Rochester, Department of Computer Science",
year "1985"}
@InProceedings{allen85b,
key "allen85b",
author "ALLEN, J.F. and HAYES, P.J.",
title "A Commonsense Theory of Time",
booktitle "Proceedings of IJCAI 1985",
organization "IJCAI",
pages"528-531",
year "1985"}
@Article{bruce72,
key "bruce72",
author "BRUCE, B.",
title "A Model for Temporal References and
its Application in a Question Answering Program",
journal "Artificial Intelligence",
volume "4",
pages "1-25",
year "1972"}
@TechReport{cheeseman83,
key"cheeseman83",
author "Cheeseman, P.",
title "A Representation of Time for Planning, Technical Note 278",
institution "SRI Artificial Intelligence Center",
year "1983"}
@InProceedings{cheeseman84,
key "cheeseman84",
author "Cheeseman, P.",
title "A Representation of Time for Automatic Planning",
booktitle "Proceedings of IEEE International Conference on Robotics",
organization "IEEE",
year "1984"}
@InProceedings{chun86,
key "chun86",
author "Chun Hon Wai",
title "A Representation for Temporal Sequence and Duration
in Massively Parallel Networks: Exploiting Link Interactions",
booktitle "Proceedings of AAAI-86, Philadelphia, Pa.",
organization "AAAI",
month "August",
pages"372-376",
year "1986"}
@TechReport{dean83,
key"dean83",
author "DEAN, T.L.",
title "Time Map Maintenance",
institution "Yale University Computer Science Department",
year "1983"}
@InProceedings{dean84a,
key"dean84a",
author "DEAN, T.L.",
title "Planning and Temporal Reasoning Under Uncertainty",
booktitle "Proceedings of IEEE Workshop on Principles of
Knowledge-Based Systems",
organization "IEEE",
month "December",
year "1984"}
@InProceedings{dean84b,
key"dean84b",
author "DEAN, T.L.",
title "Managing Time Maps",
booktitle "Proceedings of CSCSI 84.
Canadian Society for Computational Studies of Intelligence",
organization "CSCSI",
year "1984"}
@TechReport{dean84c,
key"dean84c",
author "DEAN, T.L.",
title "A TNMS User's Manual",
institution "Yale University Computer Science Department",
year "1984"}
@TechReport{dean85,
key"dean85",
author "DEAN, T.L.",
title"Temporal imagery: an approach to reasoning about time for planning
and problem solving",
institution "Yale University Computer Science Department",
year "1985"}
@InProceedings{dean85,
key "dean85",
author "DEAN, T.L.",
title "Temporal Reasoning Involving Counterfactuals and Disjunctions",
booktitle "Proceedings of 9th IJCAI 1985",
organization "IJCAI",
pages "1060-1062",
month "August",
year "1985"}
@InProceedings{dean86,
key "dean86",
author "DEAN, T.L.",
title "Intractability and time dependent planning",
booktitle "Proceedings of the Workshop on Planning and Reasoning About Action",
organization "AAAI",
month "July",
pages"143-164",
year "1986"}
@TechReport{fagan80,
key "fagan80",
author "FAGAN, J.J.",
title "Representing Time-Dependent Relations in a Medical Setting",
type "Ph.D. thesis",
institution "Stanford University",
year "1980"}
@TechReport{Hanks85,
key"Hanks85",
author "HANKS, S. and MCDERMOTT, D.",
title "Temporal Reasoning and Default Logics",
institution "Yale University Department of Computer Science",
year "1985"}
@Article{hendrix73,
key "hendrix73",
author "HENDRIX, G.G",
title "Modeling Simultaneous Actions and Continuous Processes",
journal "Artificial Intelligence",
volume "4",
pages "145-180",
year "1973"}
@InProceedings{hirschman81,
key "hirschman81",
author "HIRSCHMAN, L.",
title "Representing implicit and explicit time relations in narrative",
booktitle "Proceedings of 7th IJCAI",
organization "IJCAI",
pages "289-295",
month "August",
year "1981"}
@Article{kahn77,
key "kahn77",
author "KAHN, K. and GORRY, G.A.",
title "Mechanizing Temporal Knowledge",
journal "Artificial Intelligence",
volume "9",
pages "87-108",
year "1977"}
@InProceedings{kandrashina83,
key "kandrashina83",
author "Kandrashina, E.Y.",
title "Representation of Temporal Knowledge",
booktitle "Proceedings of 8th IJCAI 1983",
organization "IJCAI",
pages "343-345",
year "1983"}
@InProceedings{ladkin85,
key "ladkin85",
author "LADKIN, P.B.",
title "Comments on the Representation of Time",
booktitle "Proceedings of the 1985
Distributed Artificial Intelligence Workshop",
year "1985"}
@InProceedings{ladkin86a,
key "ladkin86a",
author "LADKIN, P.",
title "Primitives and Units for Time Specification",
booktitle "Proceedings of AAAI-86, Philadelphia, Pa.",
organization "AAAI",
month "July",
pages"354-359",
year "1986"}
@InProceedings{ladkin86b,
key "ladkin86b",
author "LADKIN, P.",
title "Time Representation: A Taxonomy of Interval Relations",
booktitle "Proceedings of AAAI-86, Philadelphia, Pa.",
organization "AAAI",
month "August",
pages"360-366",
year "1986"}
@InProceedings{leban86,
key "leban86",
author "LEBAN, B., MCDONALD, D and FORSTER, D.",
title "A Representation for Collections of Temporal Intervals",
booktitle "Proceedings of AAAI-86, Philadelphia, Pa.",
organization "AAAI",
month "August",
pages"367-371",
year "1986"}
@InProceedings{long83b,
key "long83b",
author "LONG, W. and RUSS, T.",
title "A Control Structure for Time Dependent Reasoning",
booktitle "Proceedings of 8th IJCAI 1983",
pages "230-232",
organization "IJCAI",
month "August",
year "1983"}
@InProceedings{malik83,
key "malik83",
author "MALIK, J. and Binford T.O.",
title "Reasoning in Time and Space",
booktitle "Proceedings of 8th IJCAI 1983",
organization "IJCAI",
pages "343-345",
year "1983"}
@InProceedings{masui83b,
key "masui83b",
author "MASUI, S., MCDERMOTT, J. and SOBEL, A.",
title "Decision-Making in Time-Critical Situations",
booktitle "Proceedings of 8th IJCAI 1983",
pages "233-235",
organization "IJCAI",
month "August",
year "1983"}
@InProceedings{miller85,
key "miller85",
author "Miller, D., Firby, J. and Dean, T.",
title "Deadlines, Travel Time and Robot Problem Solving",
booktitle "Proceedings of 9th IJCAI 1985",
organization "IJCAI",
pages "1052-1054",
year "1985"}
@Article{mourelatos78,
key "mourelatos78",
author "MOURELATOS, A.P.D.",
title "Events, processes and states",
journal "Linguistics and Philosophy",
volume "2",
pages "415-434",
year "1978"}
@TechReport{McDermott81,
key"McDermott81",
author "MCDERMOTT, D.",
title "A Temporal Logic for Reasoning about Processes and Plans",
institution "Yale University Department of Computer Science",
year "1981"}
@Article{mcdermott82,
key "mcdermott82",
author "MCDERMOTT, D.",
title "A Temporal Logic for Reasoning about Processes and Plans",
journal "Cognitive Science",
volume "6",
pages "101-155",
year "1982"}
@TechReport{Moore80,
key "Moore80",
author "Moore, R.",
title "Reasoning about knowledge and action (Technical Report 191)",
institution "SRI AI Center",
year "1980"}
@Book(rescher,
key "rescher",
author "RESCHER, N.",
title "Temporal Logic",
publisher "Springer-Verlag",
address "New York",
year "1971" )
@InProceedings{rit86,
key "rit86",
author "Rit, J.",
title "Propagating temporal constraints for scheduling",
booktitle "Proceedings of AAAI-86, Philadelphia, Pa.",
organization "AAAI",
month "August",
pages "383-388",
year "1986"}
@TechReport{shoham86,
key "shoham86",
author "SHOHAM, Y.",
title "Reasoning About Change:
Time and Causation from the Standpoint of Artificial Intelligens",
type "Ph.D. thesis",
year "1986"}
@InProceedings{shoham86,
key "shoham86",
author "Shoham, Y.",
title "Reified Temporal Logics: Semantical and Ontological Considerations",
booktitle "Proceedings of 7th ECAI, Brighton, U.K.",
organization "ECAI",
month "July",
year "1986"}
@InProceedings{shoham86,
key "shoham86",
author "Shoham, Y.",
title "Chronological Ignorance:
Time, Nonmonotonicity, Necessity and Causal Theories",
booktitle "Proceedings of AAAI-86, Philadelphia, Pa.",
organization "AAAI",
month "August",
pages "389-393",
year "1986"}
@TechReport{Smith83,
key "Smith83",
author "Smith, S.F.",
title "Exploiting Temporal Knowledge to Organize Constraints,
Technical Report CMJU-RI-TR-83-12",
institution "CMU Robotics Institute",
year "1983"}
@TechReport{Vere81,
key "Vere81",
author "Vere, S.A.",
title "Planning in Time: Windows and Durations for Activities and Goals",
institution "California Institute of Technology Jet Propulsion Laboratory",
year "1981"}
@TechReport{Vere84,
key "Vere84",
author "Vere, S.A.",
title "Temporal Scope of Assertions and Window Cutoff",
institution "California Institute of Technology Jet Propulsion Laboratory",
year "1984"}
@InProceedings{vere85,
key "vere85",
author "Vere, S.",
title "Temporal Scope of Assertions and Window Cutoff",
booktitle "Proceedings of 9th IJCAI 1985",
organization "IJCAI",
pages "1055-1059",
year "1985"}
@InProceedings{vilain82,
key "vilain82",
author "VILAIN, M.",
title "A System for Reasoning About Time",
booktitle "Proceedings of AAAI-82, Pittsburgh, Pa.",
organization "AAAI",
month "August",
year "1982"}
@InProceedings{vilain86,
key "vilain86",
author "VILAIN, M. and KAUTZ, H.",
title "Constraint Propagation Algorithms for Temporal Reasoning",
booktitle "Proceedings of AAAI-86, Philadelphia, Pa.",
organization "AAAI",
month "August",
year "1986"}
=====
Christopher Welty --- Asst. Director, RPI CS Labs | "Porsche: Fahren in
[email protected] ...!njin!nyser!weltyc | seiner schoensten Form"
------------------------------
End of NL-KR Digest
*******************
|
| 125.6 | NL-KR Digest V6 No. 34 | HERON::ROACH | TANSTAAFL ! | Mon Sep 04 1989 11:12 | 238 |
| Printed by: Pat Roach Document Number: 008619
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 02-Sep-1989 11:10am ETE
From: AI_INFO
AI_INFO@AIVTX@MRGATE@STATOS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V6 No. 34
NL-KR Digest (Tue Aug 15 11:59:34 1989) Volume 6 No. 34
Today's Topics:
Another IJCAI-89 Update
Papers on representation of time
More Papers on representation of time
Re: NLU benchmarking - request for info
Controlled English
Submissions: [email protected]
Requests, policy: [email protected]
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: [email protected]
>From: [email protected]
Date: Wed, 9 Aug 89 14:35:05 EDT
>From: allegra!rjb (Ron Brachman)
Subject: Another IJCAI-89 Update
On Friday afternoon, there will be a "summary session" presenting the
highlights of the KR'89 conference (May 15-18, in Toronto). In addition
to a summary of the conference, the three winners of the KR'89 Awards
for Outstanding Contributions will be re-presented. Here is a draft schedule:
3:00 - 4:30 pm Friday Summary Session IV - Best Knowledge Representation
Papers - 89 (Room D3-28/19 Cobo Hall)
(Chaired by Raymond Reiter)
3:00-3:15 Hector J. Levesque and Ronald J. Brachman,
Introduction and Summary of KR'89
3:15-3:40 Henry A. Kautz and Bart Selman,
"Hard Problems for Simple Default Logics"
3:40-4:05 Lenhart K. Schubert and Chung Hee Hwang,
"An Episodic Knowledge Representation for Narrative Texts"
4:05-4:30 Teodor C. Przymusinski,
"Three-Valued Formalizations of Non-Monotonic Reasoning and
Logic Programming"
------------------------------
To: [email protected]
Sender: [email protected]
Date: Wed, 9 Aug 89 17:11:01 EDT
>From: [email protected]
Subject: Papers on representation of time
Here are two more papers:
@INPROCEEDINGS{AlmSha83,
AUTHOR = "Almeida, M. J. and Shapiro, S. C.",
YEAR = 1983,
TITLE = "Reasoning about the temporal structure of narrative texts",
BOOKTITLE = "Proceedings of the Fifth Annual Meeting of the
Cognitive Science Society",
ADDRESS = "Rochester, {NY}" }
@PHDTHESIS{Alm87,
AUTHOR = "* Almeida, M. J.",
YEAR = 1987,
TITLE = "Reasoning About the Temporal Structure of Narratives",
TYPE = "Technical Report",
NUMBER = "87--10",
SCHOOL = "Department of Computer Science, {SUNY} at Buffalo,",
PAGES = 185 }
------------------------------
To: [email protected]
Date: Wed, 9 Aug 89 15:54 EDT
>From: Brad Miller <[email protected]>
Subject: Re: NL-KR Digest, Volume 6 No. 33
Reply-To: [email protected]
Postal-Address: 610 CS Building, Comp Sci Dept., U. Rochester, Rochester NY
14627
Phone: 716-275-1118
A number of people have asked for this, so here is waht I have, in
bibtex form:
I'd also add:
@string{URCS = "University of Rochester, Computer Science Department"}
@techreport{timelogic,
Author = "Koomen, Johannes A.G.M.",
Title = "The TIMELOGIC Temporal Reasoning System",
Institution = URCS,
Number = "231 (revised)",
Month = Oct,
Year = 1988}
He also has a thesis forthcoming on the subject "Reasoning about
Recurrence".
------------------------------
To: [email protected]
Date: Thu, 10 Aug 89 14:09:05 -0400
>From: [email protected]
Subject: Re: NLU benchmarking - request for info
> Date: Thu, 3 Aug 89 12:36:39 EDT
> From: [email protected]
> Subject: NLU benchmarking - request for info
>
> Some time ago, in this digest, I recall reading about a workshop
> about evaluation of natural-language understanding programs. Could
> anyone provide me with more information about this workshop? Was a
> report produced, or a set of position papers/abstracts? If so, I'd be
> interested in seeing a copy. ...
There was a Workshop on the Evaluation of Natural Language Processing Systems
held in December of 1988 in Wayne, Pennsylvania. The workshop was organized
by Martha Palmer (Unisys Paoli Research Center) and supported by RADC, AAAI,
ACL and Unisys. Martha Palmer, Sharon Walters (RADC) and I have written a
report summarizing the results of the workshop which we hope to publish soon.
I will announce its availability via the NL-KR newsgroup. I've attached some
additional information on the workshop below.
Tim
___________________________________________________________________________
In the past few years, the computational linguistics research community has
begun to wrestle with the problem of how to evaluate its progress in
developing natural language processing systems. With the exception of
natural language interfaces there are few working systems in existence, and
they tend to focus on very different tasks and equally different techniques.
There has been little agreement in the field about training sets and test
sets, or about clearly defined subsets of problems that constitute standards
for different levels of performance. Even those groups that have attempted a
measure of self-evaluation have often been reduced to discussing a system's
performance in isolation - comparing its current performance to its previous
performance rather than to another system. As this technology begins to move
slowly into the marketplace, the lack of useful evaluation techniques is
becoming more and more painfully obvious.
In order to make progress in the difficult area of natural language
evaluation, a Workshop on the Evaluation of Natural Language Processing
Systems was held last December at the Wayne Hotel in Wayne, Pennsylvania.
There were two basic premises for this workshop. The first was that it
should be possible to discuss system evaluation in general without having to
state whether the purpose of the system is "question-answering" or "text
processing." Evaluating a system requires the definition of an application
task in terms of input/output pairs which are equally applicable to
question-answering, text processing, or generation.
The second premise was that there are two basic types of evaluation, black
box evaluation which measures system performance on a given task in terms of
well-defined input/output pairs, and glass box evaluation which examines the
internal workings of the system. For example, glass box performance
evaluation for a system that is supposed to perform semantic and pragmatic
analysis should include the examination of predicate-argument relations,
referents, and temporal and causal relations. Since there are many different
stages of development that a natural language system passes through before it
is in a state where black box evaluation is even possible, glass box
evaluation plays an especially important role in guiding the development at
early stages.
With these premises in mind, the workshop was structured around the
following three sessions:
- Defining the notions of "glass box evaluation" and "black box
evaluation" and exploring their utility.
- Defining criteria for "glass box evaluation."
- Defining criteria for "black box evaluation."
Calls for participation were sent by electronic mail to several national and
international mailing lists and posted on numerous internet newsgroups and
resulted a large response. A program committee consisting of Beth Sundheim
(NOSC), Ed Hovy (ISI), Tim Finin (Unisys Paoli Research Center), Lynn Bates
(BBN), Martha Palmer (Unisys Paoli Research Center), Mitch Marcus (CIS,
University of Pennsylvania) was put together to plan the workshop and invite
participants. Those respondents interested in participating in the workshop
were asked to describe their interest in the topic, describe any relevant
work done in the area, and provide an abstract on evaluation topics that they
would want to present. A total of fifty people were invited to participate.
It was hoped that the workshop would shed light on the following questions:
- What are valid measures of "black box" performance?
- What linguistic theories are relevant to developing test suites?
- How can we characterize efficiency?
- What is a reasonable expectation for robustness?
- What would constitute valid training sets and test sets?
- How does all of this relate to measuring progress in the field?
------------------------------
To: [email protected]
>From: [email protected] (Geert Adriaens)
Newsgroups: comp.ai.nlang-know-rep
Subject: Controlled English
Date: 11 Aug 89 07:30:43 GMT
In view of a project at the Departement of Applied Linguistics at the
University of Leuven, we are investigating the possibilities and
limitations of Controlled English (CE) with particular focus on the
grammatical and lexical frameworks used to achieve a form of CE.
Can anyone send us a copy of the following manuals (or give me addresses
where we can order them) :
- the "Caterpillar Fundamental English"-manual,
- the "Kodak International Service Language"-manual,
- J. Smart's "Plain English Program",
- B.T. White's "International Language for Servicing and Maintenance".
Any information about publications on CE or addresses of people also
studying CE (both in industry and at universities) will be most welcome.
- -
Geert Adriaens (SIEMENS-METAL Project)
Maria Theresiastraat 21 [email protected] or
B-3000 Leuven [email protected] or
tel: ..32 16 285091 [email protected]
------------------------------
End of NL-KR Digest
*******************
|
| 125.7 | NL-KR Digest Volume 6 No. 36 | HERON::ROACH | TANSTAAFL ! | Thu Sep 14 1989 12:55 | 698 |
| Printed by: Pat Roach Document Number: 008728
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 14-Sep-1989 10:35am ETE
From: AI_INFO
AI_INFO@AIVTX@MRGATE@STATOS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest Volume 6 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: [email protected]
Requests, policy: [email protected]
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: [email protected]
>From: [email protected] ( 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:
[email protected]
[email protected]
..!mcvax!i2unix!irst!basso
basso%[email protected] (from ARPA)
------------------------------
To: [email protected]
>From: [email protected] (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: [email protected]
>From: [email protected] (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: [email protected] (Roberto Desimone)
In article <[email protected]> [email protected] (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%[email protected]
Roberto Desimone r.desimone%[email protected]
Brian Drabble b.drabble%[email protected]
Roberto Desimone
Knowledge-Based Planning Group (KBPG) at AIAI
------------------------------
To: [email protected]
>From: [email protected] ( 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:
[email protected]
[email protected]
..!mcvax!i2unix!irst!basso
basso%[email protected] (from ARPA)
------------------------------
To: [email protected]
>From: [email protected] (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: [email protected]
>From: [email protected] (Steve Sutton)
Newsgroups: comp.ai,sci.lang
Subject: locating a paper
Date: 25 Aug 89 16:15:31 GMT
Reply-To: [email protected] (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: [email protected] | POST: University of Lancaster,
UUCP: ...!mcvax!ukc!dcl-cs!sutton | Department of Computing,
ARPA: [email protected] | Bailrigg,
PHONE: +44 524 65201 Ext. 3796 | Lancaster, LA1 4YR
FAX: +44 524 381707 | UNITED KINGDOM
------------------------------
To: [email protected]
Date: Thu, 31 Aug 89 12:37:14 -0400
>From: [email protected] (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.
[email protected]
Now visiting Bellcore, NJ, till 09/14, [email protected]
================================================================
"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: [email protected]
Date: Tue, 5 Sep 89 11:48:57 EDT
>From: [email protected] (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
[email protected]
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;
[email protected]. 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; [email protected]. 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; [email protected] 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: [email protected]
X-Delivery-Notice: SMTP MAIL FROM does not correspond to sender.
Date: Fri, 8 Sep 89 11:38:49 +0200
>From: walter%[email protected]
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: [email protected]
P.O. Box 90153 ...!hp4nl!kubix!walter
NL-5000 LE Tilburg Telephone: +31 13 663070
The Netherlands Fax: +31 13 663019
------------------------------
To: [email protected]
Date: Mon, 11 Sep 89 12:26:00 -0400
>From: [email protected]
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: [email protected]
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: [email protected]
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
*******************
|
| 125.8 | NL-KR Digest V6.40 | HERON::ROACH | TANSTAAFL ! | Wed Nov 29 1989 15:26 | 410 |
| Printed by: Pat Roach Document Number: 009292
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 28-Nov-1989 10:35am CET
From: AI_INFO
AI_INFO@AIVTX@MRGATE@DELOS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V6.40
NL-KR Digest (Tue Oct 31 09:37:40 1989) Volume 6 No. 40
Today's Topics:
discourse and anaphora
Speech Processing Systems for Sanskrit language
SNAP/NLP at USC
Prolog parser
More papers on connectionism and natural language
CALL FOR PAPERS - CONNECTION SCIENCE: Special Issue
SPECIAL CSLI LECTURE BY DOUG HOFSTADTER ON 13 NOVEMBER
Recent Memoranda in Computer and Cognitive Science (NLP only)
NATO Workshop announcement
Submissions: [email protected]
Requests, policy: [email protected]
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.
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.
[[ I screwed up again and skipped issue 38, so there was none ]]
-----------------------------------------------------------------
To: [email protected]
Date: Thu, 5 Oct 89 09:52:48 -0400
>From: [email protected] (William J. Rapaport)
Subject: discourse and anaphora
If you'll send me your US mail address, I'll send you a copy of:
Li, Naicong (1986), "Pronoun Resolution in SNePS," SNeRG Technical Note
No. 18 (Buffalo: SUNY Buffalo Department of Computer Science, SNePS
Research Group).
William J. Rapaport
Associate Professor of Computer Science
Interim Director, Center for Cognitive Science
Dept. of Computer Science||internet: [email protected]
SUNY Buffalo ||bitnet: [email protected]
Buffalo, NY 14260 ||uucp: {decvax,watmath,rutgers}!sunybcs!rapaport
(716) 636-3193, 3180 ||fax: (716) 636-3464
------------------------------
To: [email protected]
>From: [email protected] (Dr. Ranga R. Vemuri)
Newsgroups: comp.ai.nlang-know-rep,soc.culture.indian
Subject: Speech Processing Systems for Sanskrit language
Date: 9 Oct 89 17:15:54 GMT
Followup-To: [email protected]
Are there any speech processing systems for the Sanskrit language
(or for any other phoneticallly sound Indian languages) ?
Any information is appreciated. Thanks.
Ranga.
[email protected]
------------------------------
To: [email protected]
Date: Sun, 29 Oct 89 10:00:46 PST
>From: demara%[email protected] (Ron DeMara)
Subject: SNAP/NLP at USC
Newsgroups: comp.ai.nlang-know-rep
Our group in the EE-Systems department at USC is working on the design
of a prototype natural language processing system called SNAP/NLP. The
objective of SNAP/NLP is to provide an experimental system that utilizes
the inherent parallelism of the Semantic Network Array Processor (SNAP)
for text understanding and question answering. SNAP is a marker passing
hardware architecture for knowledge processing that is also in
development at USC. SNAP/NLP will be an integrated set of software containing
a syntactic parser, semantic interpreter, discourse analyzer and a classifier.
We would like to know about the availability of Augmented Transition Network
(ATN) parsers in the public domain. We are looking for an existing ATN based
parser for English text, preferably implemented in LISP. We would appreciate
any pointers to what may be available. Thank you.
Ron DeMara, [email protected]
------------------------------
To: [email protected]
Date: Sat, 30 Sep 89 16:48:58 CDT
>From: Jan Wilms <JWILMS%[email protected]>
Subject: Prolog parser
Does anyone on the net have access to a public domain natural
language parser in PROLOG? The intended target machine is a
Symbolics workstation. I am especially looking for a chart
parser, but any non-trivial parser is welcome.
Thanks in advance
G. Jan WILMS
JWILMS@MSSTATE
POBox 1715 MSU, MS 39762
(601) 323 5462
------------------------------
To: [email protected]
Date: Wed, 20 Sep 89 08:34:41 EDT
>From: [email protected] (Robert B Allen)
Subject: More papers on connectionism and natural language
Allen, R.B. & Riecken, M.E. (1989). Reference in connectionist language
users. Connectionism in Perspective, R. Pfeifer, Z. Schreter, F.
Fogelman-Soulie, and L. Steels (eds.). Elsevier: Amsterdam, 301-308.
(presented at Connectionism in Perspective, Zurich, Oct. 1988).
Allen, R.B., & Riecken, M.E. (Sept. 1988). Interacting and communicating
connectionist agents. Proceedings of the International Neural Network So-
ciety. 67. Boston.
Riecken, M.E. (Nov. 1988). Neural networks in natural language processing
and distributed artificial intelligence. Thesis presented to the Depart-
ment of Computer and Electrical Engineering, University of New Mexico.
Allen, R.B. (Nov. 1989). Developing agent models with a neural reinforce-
ment technique. IEEE Systems Man and Cybernetics Conference. Cambridge,
MA.
Allen, R.B. (Aug. 1988). Sequential connectionist networks for answering
simple questions about a microworld. Proceedings of the Cognitive Science
Society. 489-495. Montreal.
Hanson, S.J., & Kegl, J. (Aug. 1987). PARSNIP: A connectionist network
that learns natural language grammar from exposure to natural language sen-
tences. Proceedings of the Cognitive Science Society. Seattle, WA. 106-
119.
Allen, R.B. (June 1987). Several studies on back-propagation and natural
language. Proceedings of the International Conference on Neural Networks.
San Diego, II/335-341.
Allen, R.B., & Kaufman, S.M. (Oct. 1989). Identifying and discriminating
temporal events with connectionist language users. IEE Conference on Ar-
tificial Neural Networks, London.
Allen, R.B. (June, 1989). Sequence generation with connectionist state
machines. International Joint Conference on Neural Networks. Washington,
2/593.
Allen, R.B. (Feb. 1989). Adaptive training and connectionist state
machines. ACM Computer Science Conference. Louisville, 428.
------------------------------
To: [email protected]
Date: Fri, 29 Sep 89 07:43:42 EDT
>From: [email protected] (Robert B Allen)
Subject: CALL FOR PAPERS - CONNECTION SCIENCE: Special Issue
(Journal of Neural Computing, Artificial Intelligence and Cognitive Research)
CONNECTIONIST RESEARCH ON NATURAL LANGUAGE
Editor: Noel E. Sharkey, University of Exeter
Special Editorial Review Panel
Robert Allen, Bellcore, New Jersey
Garrison W. Cottrell, University of California, San Diego
Michael G. Dyer, University of California, Los Angeles
Jeffrey L. Elman, University of California, San Diego
George Lakoff, University of California, Berkeley
Wendy W. Lehnert, University of Massachusetts at Amherst
Jordan Pollack, Ohio State University
Ronan Reilly, Beckmann Institute, Illinois
Bart Selman, University of Toronto
Paul Smolensky, University of Colorado, Boulder
This special issue will accept submissions of full length connectionist papers
and brief reports from any area of natural language research including:
Connectionist applications to AI problems in natural
language (e.g. paraphrase, summarisation, question answering).
New formalisms or algorithms for natural language processing.
Simulations of psychological data.
Memory modules or inference mechanisms to support natural
language processing.
Representational methods for natural language.
Techniques for ambiguity resolution.
Parsing.
Speech recognition, production, and processing.
Connectionist approaches to linguistics (phonology, morphology etc.).
Submissions of short reports or recent updates will also be accepted for
the Brief Reports section in the journal. No paper should be currently
submitted elsewhere.
DEADLINES:
Deadline for submissions: December 15th 1989
Decision/reviews by: February 1990
Papers may be accepted to appear in regular issues if there is insufficient
space in the special issue.
For further information about the journal please contact:
Lyn Shackleton
(Assistant Editor)
Centre for Connection Science JANET: [email protected]
Dept. Computer Science
University of Exeter UUCP: !ukc!expya!lyn
Exeter EX4 4PT
Devon, U.K. BITNET: [email protected]@UKACRL
------------------------------
To: [email protected]
Date: Fri, 27 Oct 89 16:28:59 PDT
>From: [email protected] (Ingrid Deiwiks)
Subject: SPECIAL CSLI LECTURE BY DOUG HOFSTADTER ON 13 NOVEMBER
CONCEPT ACQUISITION
(Tentative Title)
Doug Hofstadter
Departments of Computer Science and Psychology
University of Michigan
presently visiting scholar at
San Francisco State University
Doug Hofstadter will give a special lecture at CSLI on Monday, 13
November 1989, at 1:15, in Cordura 100. Abstract to follow.
------------------------------
To: [email protected]
>From: [email protected]
Date: Tue, 10 Oct 89 19:34:41 MDT
Subject: Recent Memoranda in Computer and Cognitive Science (NLP only)
For copies of the technical reports listed below write to:
Memoranda Series
Computing Research Laboratory
Box 30001
New Mexico State University
Las Cruces, New Mexico 88003
USA
Fowler, R.H., Slator, B.M. & Balogh, I. (1989),
On Psychological Plausibility in Artificial Intelligence, CRL,
MCCS-89-150.
The Artificial Intelligence literature is liberally laced with claims
about cognitive reality. Sometimes these are strong claims that cite
empirical psychological evidence; but more often these claims take the
form of weak appeals to ``psychological plausibility.'' To examine the
nature and scientific status of these claims, AI research is characterized
along a particular dimension, cast as the ``psychological evidence line.''
Then, some ideas about theory in AI are examined, especially the thorny
notion of ``models'' in AI theories: what does it mean to use human
intellect as a model in an AI theory, or in an AI program? Then, as is so
often the case, further light is shed by an historical characterization,
giving evidence for a particular grouping of
``camps'' in AI, according to how psychological evidence ``matters'' to
them. These discussions set the scene, finally, for an examination of the
role (really, roles) that psychological plausibility actually plays in AI;
and this leads naturally into a discussion, and some conclusions, about
which of these roles are appropriate, and which are not.
Barnden, J. (1989),
Neural-Net Implementation of Complex Symbol-Processing in a Mental
Model Approach to Syllogistic Reasoning, CRL, MCCS-89-154.
A neural net system called ``Conposit'' is described. Conposit
performs rule-based manipulation of very short term, complex symbolic
data structures. This paper concentrates on a simulated version of
Conposit that embodies core aspects of Johnson-Laird's mental model
theory of syllogistic reasoning. This Conposit version is not
intended to be a psychological theory, but rather to act as a test and
demonstration of the power and flexibility of Conposit's unusual
connectionist techniques for encoding the structure of data.
Barnden, J. (1989),
Belief, Metaphorically Speaking*, CRL, MCCS-89-155.
The central claim of the paper concerns AI systems that attempt to
represent propositional attitudes in realistic situations, and
particularly in situations portrayed in natural language discourse.
The claim is that the system, in order to achieve a coherent, useful
view of a situation, must often ascribe, to outer agents, views of
inner agents' attitudes that are based on rich explications in terms
of commonsense metaphorical views of mind. This elevates the
emasculated metaphors based on notions of world, situation, container,
and so on that underlie propositional attitude representation
proposals to the status of explicitly-used, rich metaphors. A system
can adopt different patterns of commonsense inference about attitudes
by choosing different metaphors. The current stage of development of
a detailed representation scheme based on the claim is described. The
scheme allows different metaphors to be used for the explication of
attitudes at different levels in a nested-attitude situation.
Guo. C-M. (1989),
Constructing A Machine Tractable Dictionary From Longman Dictionary of
Contemporary English, CRL, MCCS-89-156.
Dissertation.
It is the purpose of this research to design a machine-tractable
dictionary (henceforth MTD) from Longman Dictionary of Contemporary
English (henceforth LDOCE). The MTD is intended to be a basic
facility for a whole spectrum of natural language processing tasks.
The research adopts a compositional-reduction approach to obtain a
formalized set of definitions of sense entries in a nested predicate
form, where the predicates are a set of "seed sense". The focus of
this research is on the derivation of these "seed senses" and their
utilization in the construction of the MTD.
The Construction of the proposed MTD involves the following four
steps: Step: Determine the "defining senses" of LDOCE, i.e., those
world senses that are used in the definition of the meaning of 2,137
``controlled words'' of LDOCE, step 2: Derive the ``seed senses'' of
LDOCE. The ``seed senses" are a subset of the defining sense which
are sufficient to define senses of Step 1. The seen senses are taken
as a natural set semantic primitives derived from LDOCE; step 3:
Hand-code the initial knowledge base for the natural set of semantic
primitives derived from LDOCE; step 4: Construct a MTD for the
controlled words and the rest of LDOCE words by means of bootstrapping
process is a process of knowledge acquisition from dictionary definition
text.
Step 1 of the construction process has been completed. A total of
3,860 defining senses have been determined. Step 2 of the
construction process has also been completed. A total of 3,280 word
senses are found to be the seed senses of LDOCE. These seed senses
are taken as a natural set of semantic primitives derived from the
dictionary. The feasibility of Steps 3 and 4 of the coprocess have
been demonstrated with implemented examples. What
remains to be accomplished is to complete Steps 3 and 4 to build a
full-sized MTD from LDOCE using as guidelines the results of initial
implementation of the two steps.
------------------------------
To: [email protected]
Date: 30 Oct 89 11:37:00 EDT
>From: "SWARTZ, MERRYANNA" <[email protected]>
Subject: NATO Workshop announcement
Please post the following:
A NATO ADVANCED WORKSHOP ON
INTELLIGENT TUTORING SYSTEMS (ITS) FOR FOREIGN LANGUAGE LEARNING
September 19-21, 1990
Washington, D.C.
USA
Focus of the Workshop: To broaden technological advancements in foreign
language ITS applications. To exchange and synthesize scientific progress
in four technical areas: computational bases for foreign langauge ITS,
modelling and diagnosis of the language student, tutorial strategies and
learner control, and hypermedia for interface design.
Background: Language is a "bridge to international communication." As
the international community grows smaller and smaller in economic, scientific,
and day-to-day exchanges, multilingualism becomes a vital skill. Teaching
language skills so that they are easily acquired and retained poses a challenge
to educational and computational researchers. One solution is to create an
intelligent tutoring system for language learning. But how can we build such
an environment? What computational resources are needed? What tutoring
strategies will be used? How will diagnosis and student modelling be
accomplished? What kind of interface is best for presenting language to
students? Current advances in artificial intelligence and natural language
processing technology provide a unique opportunity for developing ITS to
support foreign lanaguage learning that goes beyond grammar instruction.
This workshop will discuss issues in each of the four topic areas and
provide possible solutions to some of the research problems we face.
Participants: Researchers from computer science, foreign language and
linguistics, and psychology who are are interested should submit a brief
abstract of their work (500 words) by January 1990. Demonstrations of
systems,prototypes are welcomed. Submitted abstracts will be reviewed by
the organizing committee by March 1990.
For more information contact:
Merryanna L. Swartz (PERI-IC)
US Army Research Institute
5001 Eisenhower Ave.
Alexandria, VA 22333
USA
phone: (202)274-5569/40, email: [email protected]
Organizing committee: Merryanna L. Swartz, Masoud Yazdani, Joseph
Psotka, Henry Hamburger, Gerard Kempen
------------------------------
End of NL-KR Digest
*******************
|
| 125.9 | NL-KR Digest V6.37 | HERON::ROACH | TANSTAAFL ! | Wed Nov 29 1989 15:27 | 497 |
| Printed by: Pat Roach Document Number: 009293
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 28-Nov-1989 11:26am CET
From: AI_INFO
AI_INFO@AIVTX@MRGATE@DELOS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V6.37
NL-KR Digest (Tue Sep 19 18:38:21 1989) Volume 6 No. 37
Today's Topics:
Better Explanations for Expert Systems (Unisys AI Seminar)
Workshop Announcement & Call for papers
Special Session on Logic and A.I.
AI Seminar
Re: Connectionist Approaches to NLU
What KL-ONE Lookalikes Need to Cope with NL (Unisys Seminar)
CALL FOR PAPERS Mathematical Programming and Expert Systems...
Submissions: [email protected]
Requests, policy: [email protected]
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.
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: [email protected]
Date: Mon, 11 Sep 89 13:58:30 -0400
>From: [email protected] (Tim Finin)
Subject: Better Explanations for Expert Systems (Unisys AI Seminar)
AI SEMINAR
UNISYS PAOLI RESEARCH CENTER
Dr. Jennifer Jerrams Smith
Artificial Intelligence Group
Philips Research Laboratories
Redhill, Surrey, RH1 5HA, UK
(vrdxhq!uunet!prlb2!prlhp1!smithjj)
The BEES project:
Better Explanations for Expert Systems.
The aim of the BEES project is to improve the communication and
cooperation between users and knowledge based systems. It resulted
from the realization that current expert systems (ES) provide very
limited explanations to their users (the traditional "how" and "why"
questions). In many cases their acceptability, marketability and
usability would be greatly improved if such systems could interact in
a more cooperative way to solve problems through the combined
expertise of user and ES.
Development of more cooperative ESs involves investigation of what
domain knowledge is needed and how it should be represented so that
the ES can answer some of the many different sorts of questions which
users wish to ask. Additionally, the ES must hold information about
the user, so that it can communicate effectively and efficiently, in
terms which the user understands.
We are currently working on the following areas: representing the
variety of knowledge required, natural language processing, generating
textual responses, integrating graphical and textual explanations,
behavioural studies of advisors and users, developing a taxonomy of
explanations.
11:00am September 25
BIC Conference Room
Unisys Paoli Research Center
Route 252 and Central Ave.
Paoli PA 19311
-- non-Unisys visitors who are interested in attending should --
-- send email to [email protected] or call 215-648-7446 --
------------------------------
To: [email protected]
Date: Mon, 11 Sep 89 19:14:53 -0400
>From: [email protected] (Deepak Kumar)
Subject: Workshop Announcement & Call for papers
CALL FOR PAPERS
FIRST ANNUAL SNePS WORKSHOP
Co-Sponsored by the SNePS Research Group and the
SUNY at Buffalo Center for Cognitive Science
November 13, 1989
280 Park Hall
North Campus
SUNY at Buffalo
SNePS, in its various incarnations, is being actively used and
developed at various AI research labs around the world. The
aim of this workshop is to try to get together researchers who
are (have been, or are considering) using SNePS as a research
tool for AI modeling as well as those who are (have been,
or are considering) evaluating SNePS as an AI research
environment.
The theme of this workshop is to present a survey of
current and on-going research and developments at various
research sites. Attendance at the workshop
will be kept small (by invitation only) to allow for maximum
possible interaction among participants.
The workshop will be semi-formal and held on the
campus of SUNY at Buffalo (where the SNePS headquarters are
located). All papers presented will be
edited and compiled into Proceedings which will be
published as a Department of Computer Science, SUNY at
Buffalo Technical Report.
To be invited to the workshop, you have to do one of the
following (preferably by e-mail):
1. Submit a one page abstract of a paper to be considered
for presentation.
2. Submit a short write-up of your current research and how
it does/might relate to the SNePS family of projects.
We will also schedule a time slot for live demonstrations of systems.
Those interested in giving demonstrations should submit a small
description outlining the nature of the demonstration along with
hardware/software/time requirements.
DEADLINES
Abstracts/Research Summaries due on Friday, October 6, 1989.
Notification of acceptance/participation by October 13, 1989.
Final papers due on Tuesday, October 31, 1989.
SUBMISSIONS TO:
Deepak Kumar
226 Bell Hall
SUNY at Buffalo
Buffalo NY, 14260
[email protected]
Send any queries to the organization committee:
General:
Deepak Kumar ([email protected])
Sy Ali ([email protected])
Demos:
Hans Chalupsky ([email protected])
Everyone will be expected to make their own living arrangements.
There may be a possibility of making some arrangements with
local SNeRG members.
Thank you.
Deepak Kumar
------------------------------
To: [email protected]
>From: [email protected] (Wiktor Marek)
Newsgroups: comp.ai
Subject: Special Session on Logic and A.I.
Date: 12 Sep 89 17:15:08 GMT
Reply-To: [email protected] (Wiktor Marek)
Special Session on Logic and Artificial Intelligence
at:
Symposium on Artificial Intelligence and Mathematics
Fort Lauderdale, FL January 3-5 1990
During the Symposium (see: news.announce.conferences) a spe-
cial Session on Logic and Artificial Intelligence will take
place. A number of logicians currently involved in investi-
gations of Logical Foundations of Artificial Intelligence
will take part in the Session. These currently include: H.
Blair (Syracuse U.), A. Brown (Xerox), M. Gelfond (U. of
Texas), W. Marek (Cornell and U. of Kentucky), A. Nerode
(Cornell), J. Schlipf (U. of Cincinnati), M. Truszczynski
(U. of Kentucky), D. Wijesekera (Cornell).
Scientists active in the research of Logical Foundations of
Artificial Intelligence and interested in participating in
the Session, are requested to get in touch with:
Professor Anil Nerode
Department of Mathematics
Cornell University
Ithaca, NY 14850
Electronic inquiries can be sent to:
[email protected]
Wiktor Marek
normally in the University of Kentucky, but now for 1989/90 in the
MSI/ Cornell University. If you want to reach me, write to:
[email protected]
------------------------------
To: [email protected]
Subject: AI Seminar
>From: "Damaris M. Ayuso" <[email protected]>
Reply-To: [email protected]
Date: Thu, 14 Sep 89 14:45:00 EDT
BBN STC Science Development Program
AI Seminar Series Lecture
AUTOMATIC PROCESSING OF UNRESTRICTED NATURAL
LANGUAGE TEXTS
GERARD SALTON
Cornell University
BBN STC, 2nd floor large conference room
10 Moulton St, Cambridge MA, 02138
Thursday September 21st, 10:30 AM
The conventional artificial intelligence approaches are not viable when
large text samples in arbitrary subject areas must be processed. Text
analysis methods based largely on statistical methods have, however,
been used successfully in information retrieval and related areas for many
years.
The main text analysis methods usable with general purpose texts are
briefly reviewed and applications are described in such areas as
document retrieval, book indexing, linking of related text excerpts, subject
area organization, and so on. Evaluation output is shown wherever
possible to demonstrate the effectiveness of the proposed methodologies.
------------------------------
To: [email protected]
>From: [email protected] (Jacob Cybulski)
Newsgroups: comp.ai.digest,comp.ai.nlang-know-rep,aus.ai
Subject: Re: Connectionist Approaches to NLU
Date: 14 Sep 89 00:20:31 GMT
Last week I sent a request for references on connectionist
approaches to natural language processing. Special thanks to:
Ron Chrisley of Xerox
Trent Lange of AI Labs, UCLA
Diana Roberts of HP Labs
Here are some of the references they suggested, plus a few
I found myself. Note that I also included approximate location
of the authors. I'll be grateful if you could still contribute to
this list and send me some additional information on yours or
your colleagues' work in this area. Again I will summarize the
responses to the net.
Jacob o | o
\_/
References:
Bookman, L.A. (Brandeis Uni - 1987):
"A Microfeature Based Scheme for Modelling Semantics,"
IJCAI 87, 611-614.
Cottrell, G.W. and Small, S.L. (Uni of Rochester - 1983):
"A Connectionist Scheme for Modelling Word Sense Disambiguation,"
Cog. and Brain Theory, 6(1), 89-120.
Dolan, C. P. and Dyer, M. G. (UCLA - 1988):
"Parallel Retrieval of Conceptual Knowledge,"
In D. Touretzky (ed), Proc. of the 1988 Connectionist Summer School,
Morgan Kaufmann.
Dyer, M. G. (UCLA - 1989):
"Symbolic NeuroEngineering for Natural Language Processing,"
To appear in J. Barnden and J. Pollack (eds), Advances in
Connectionist and Neural Computation Theory, Ablex Publications.
Elman, J.L. (UCSD - 1989):
"Representation and Structure in Connectionist Models,"
Cognitive Science Society Conference (not in proceedings)
Elman, J.L. (UCSD - 1988):
"Discovering Syntactic Structure Using Simple Recurrent Networks,"
Technical Report.
Howells, T. (Uni of Massachusetts - 1988):
"VITAL: A Connectionist Parser,"
Proc. Conf. Cog. Sci. 88, 18-25.
Jones, M.A. (AT&T Bell Labs - 1987):
"Feedback as a Coindexing Mechanism in Connectionist Architectures,"
IJCAI 87, 602-610.
Lange, T. and Dyer, M. G. (UCLA - 1989):
"Dynamic, Non-Local Role-Bindings and Inferencing in
a Localist Network for Natural Language Understanding,"
In D. Touretzky (ed), Advances in Neural Information Processing
Systems I, Morgan Kaufmann, San Mateo, CA.
Lange, T. and Dyer, M. G. (UCLA - 1989):
"Frame Selection in a Connectionist Model of
High-Level Inferencing,"
Proc. of the Eleventh Annual Conf. of the Cognitive Science Society,
Ann Arbor, MI, Aug 1989.
MacWhinney, B. (Carnegie Mellon University - 1989):
"A Crosslinguistic Connectionist Model for Morphological Learning,"
Cognitive Science Society Conference (not in proceedings)
Marchman, V. & Plunkett, K. (UCSD & Uni of Aarhus, Denmark - 1989):
"U-Shaped Learning Curves in a Connectionist Model of
Past Tense Learning,"
Cognitive Science Society Conference (not in proceedings)
McClelland, J.L. and Rumelhart, D.E. (Carnegie Mellon - 1981):
"An Interactive Activation Model of Context Effects in
Letter Perception,"
Psychological Reviews 88, 375-407.
McClelland, J.L. (Carnegie Mellon - 1989):
"Models of Language: Rules or Connections?"
Cognitive Science Society Conference (not in proceedings)
Miikkulannen, R. and Dyer, M. G. (UCLA - 1988):
"Encoding Input/Output Representations in Connectionist Cognitive
Systems,"
In D. Touretzky (ed), Proceedings of the 1988 Connectionist Summer
School, Morgan Kaufmann.
Miikkulainen, R. and Dyer, M. G. (UCLA - 1989):
"A Modular Neural Network Architecture for Sequential Paraphrasing
of Script-Based Stories,"
Proceedings of the First Annual International
Joint Conference on Neural Networks, Washington DC, June 1989.
Pollack, J.B. and Waltz, D.L. (Uni of Illinois at U-C - 1984):
"Parallel Interpretation of Natural Language,"
Proc. Int. Conf. 5th Gen. Comp. Sys., 686-691.
Small, S.L. (Uni of Rochester - 1987):
"A Distributed Word-Based Approach to Parsing,"
in L. Bolc (ed) Natural Language Parsing Systems,
Springer-Verlag, 161-202.
St. John, M. (Carnegie Mellon University - 1989):
"Sentence Comprehension by Parallel Constraint Satisfaction,"
Cognitive Science Society Conference (not in proceedings)
------------------------------
To: [email protected]
Date: Tue, 19 Sep 89 11:33:15 -0400
>From: [email protected]
Subject: What KL-ONE Lookalikes Need to Cope with NL (Unisys Seminar)
AI SEMINAR
UNISYS PAOLI RESEARCH CENTER
What KL-ONE Lookalikes Need
to Cope with Natural Language
Juergen Allgayer
University of Saarbrucken
FRG
One of the major drawbacks of current NL processing systems is an
adequate representation of and reasoning about plurals. This is true
because current knowledge representation languages do not provide well
suited representational means neither to describe sets, subsets, and
elements nor to deal with the respective relations or use them in
specially tailored inference systems.
On the other side, there exists (at least) one linguistic theory about
plurality in natural language, the General Quantifier Theory (GQT).
What we want to present in this paper is how we adopted this theory
into the already existing framework of the XTRA system. Our goal
therefor is to develop a well-grounded knowledge representation
formalism able to represent sets as well as to deal with them and
combine this representation formalism with a well-defined linguistic
theory.
The knowledge representation language SB-ONE+ integrates sets into the
KL-ONE like KR language SB-ONE. It realizes this by means of
regarding sets as epistemological primitives, thus allowing for both
an implementation of set-relevant properties (like reasoning about
subset-of and element-of relationships) in the system as well as a
description of sets as elements inside the TBox if relevant for the
domain under consideration. Taking SB-ONE+ as representational basis,
we show how some inte- resting results from GQT are implemented in the
XTRA system.
11:00am September 20
BIC Conference Room
Unisys Paoli Research Center
Route 252 and Central Ave.
Paoli PA 19311
-- non-Unisys visitors who are interested in attending should --
-- send email to [email protected] or call 215-648-7446 --
------------------------------
To: [email protected]
>From: [email protected]
Newsgroups: comp.ai.nlang-know-rep
Subject: CALL FOR PAPERS Mathematical Programming and Expert Systems...
Date: Tuesday, 19 Sep 1989 12:38:37 EDT
+-------------------------------------------------------------------+
| CALL FOR PAPERS |
| |
| RECENT APPLICATIONS OF MATHEMATICAL PROGRAMMING TO |
| EXPERT SYSTEMS DEVELOPMENT |
| |
| A Section of the 8th INTERNATIONAL CONGRESS OF CYBERNETICS |
| AND SYSTEMS |
| |
| Hunter College of the City University of New York |
| New York, New York |
| June 11-15, 1990 |
+-------------------------------------------------------------------+
This session will host work that demonstrates the
increasing potential of combining mathematical programming
approaches to expert systems problems. Both original
research and survey papers will be considered. Some
relevant topics include, but are not limited to:
o Machine Learning and Mathematical Programming
o Logic Problems and Mathematical Programming
o Expert Systems and Operations Research
o AI and Operations Research
This triennial conference is supported by many
international groups concerned with management, the sciences,
computers, and information systems. The Congress will
provide a forum, symposia and sections, for the presentation
and discussion of current research. All meetings will be
held in midtown Manhattan.
Section Chairs:
Allen L. Soyster, Professor and Head,
Dept. of Industrial Engineering, Penn State University
Evangelos Triantaphyllou, Ph.D. Candidate,
Dept. of Industrial Engineering, Penn State University
Program Chair:
Constantin Negoita, Professor,
Hunter College, CUNY, New York, NY.
Papers should be approximately 2,000-4,000 words in
length. Please send 4 hard copies (not e-mail) to:
+-------------------------------------------------------------------+
| Evangelos Triantaphyllou |
| E-Mail: [email protected] |
| Department of Industrial Engineering |
| Penn State University |
| 207 Hammond Building |
| University Park, PA 16802, USA |
+-------------------------------------------------------------------+
Deadlines: January 1, 1990: Submission of paper.
April 1, 1990: Notification of disposition
All items will be acknowledged
------------------------------
End of NL-KR Digest
*******************
|
| 125.10 | NL-KR Digest V6.37 | HERON::ROACH | TANSTAAFL ! | Wed Nov 29 1989 15:28 | 497 |
| Printed by: Pat Roach Document Number: 009294
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 28-Nov-1989 12:07pm CET
From: AI_INFO
AI_INFO@AIVTX@MRGATE@DELOS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V6.37
NL-KR Digest (Tue Sep 19 18:38:21 1989) Volume 6 No. 37
Today's Topics:
Better Explanations for Expert Systems (Unisys AI Seminar)
Workshop Announcement & Call for papers
Special Session on Logic and A.I.
AI Seminar
Re: Connectionist Approaches to NLU
What KL-ONE Lookalikes Need to Cope with NL (Unisys Seminar)
CALL FOR PAPERS Mathematical Programming and Expert Systems...
Submissions: [email protected]
Requests, policy: [email protected]
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.
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: [email protected]
Date: Mon, 11 Sep 89 13:58:30 -0400
>From: [email protected] (Tim Finin)
Subject: Better Explanations for Expert Systems (Unisys AI Seminar)
AI SEMINAR
UNISYS PAOLI RESEARCH CENTER
Dr. Jennifer Jerrams Smith
Artificial Intelligence Group
Philips Research Laboratories
Redhill, Surrey, RH1 5HA, UK
(vrdxhq!uunet!prlb2!prlhp1!smithjj)
The BEES project:
Better Explanations for Expert Systems.
The aim of the BEES project is to improve the communication and
cooperation between users and knowledge based systems. It resulted
from the realization that current expert systems (ES) provide very
limited explanations to their users (the traditional "how" and "why"
questions). In many cases their acceptability, marketability and
usability would be greatly improved if such systems could interact in
a more cooperative way to solve problems through the combined
expertise of user and ES.
Development of more cooperative ESs involves investigation of what
domain knowledge is needed and how it should be represented so that
the ES can answer some of the many different sorts of questions which
users wish to ask. Additionally, the ES must hold information about
the user, so that it can communicate effectively and efficiently, in
terms which the user understands.
We are currently working on the following areas: representing the
variety of knowledge required, natural language processing, generating
textual responses, integrating graphical and textual explanations,
behavioural studies of advisors and users, developing a taxonomy of
explanations.
11:00am September 25
BIC Conference Room
Unisys Paoli Research Center
Route 252 and Central Ave.
Paoli PA 19311
-- non-Unisys visitors who are interested in attending should --
-- send email to [email protected] or call 215-648-7446 --
------------------------------
To: [email protected]
Date: Mon, 11 Sep 89 19:14:53 -0400
>From: [email protected] (Deepak Kumar)
Subject: Workshop Announcement & Call for papers
CALL FOR PAPERS
FIRST ANNUAL SNePS WORKSHOP
Co-Sponsored by the SNePS Research Group and the
SUNY at Buffalo Center for Cognitive Science
November 13, 1989
280 Park Hall
North Campus
SUNY at Buffalo
SNePS, in its various incarnations, is being actively used and
developed at various AI research labs around the world. The
aim of this workshop is to try to get together researchers who
are (have been, or are considering) using SNePS as a research
tool for AI modeling as well as those who are (have been,
or are considering) evaluating SNePS as an AI research
environment.
The theme of this workshop is to present a survey of
current and on-going research and developments at various
research sites. Attendance at the workshop
will be kept small (by invitation only) to allow for maximum
possible interaction among participants.
The workshop will be semi-formal and held on the
campus of SUNY at Buffalo (where the SNePS headquarters are
located). All papers presented will be
edited and compiled into Proceedings which will be
published as a Department of Computer Science, SUNY at
Buffalo Technical Report.
To be invited to the workshop, you have to do one of the
following (preferably by e-mail):
1. Submit a one page abstract of a paper to be considered
for presentation.
2. Submit a short write-up of your current research and how
it does/might relate to the SNePS family of projects.
We will also schedule a time slot for live demonstrations of systems.
Those interested in giving demonstrations should submit a small
description outlining the nature of the demonstration along with
hardware/software/time requirements.
DEADLINES
Abstracts/Research Summaries due on Friday, October 6, 1989.
Notification of acceptance/participation by October 13, 1989.
Final papers due on Tuesday, October 31, 1989.
SUBMISSIONS TO:
Deepak Kumar
226 Bell Hall
SUNY at Buffalo
Buffalo NY, 14260
[email protected]
Send any queries to the organization committee:
General:
Deepak Kumar ([email protected])
Sy Ali ([email protected])
Demos:
Hans Chalupsky ([email protected])
Everyone will be expected to make their own living arrangements.
There may be a possibility of making some arrangements with
local SNeRG members.
Thank you.
Deepak Kumar
------------------------------
To: [email protected]
>From: [email protected] (Wiktor Marek)
Newsgroups: comp.ai
Subject: Special Session on Logic and A.I.
Date: 12 Sep 89 17:15:08 GMT
Reply-To: [email protected] (Wiktor Marek)
Special Session on Logic and Artificial Intelligence
at:
Symposium on Artificial Intelligence and Mathematics
Fort Lauderdale, FL January 3-5 1990
During the Symposium (see: news.announce.conferences) a spe-
cial Session on Logic and Artificial Intelligence will take
place. A number of logicians currently involved in investi-
gations of Logical Foundations of Artificial Intelligence
will take part in the Session. These currently include: H.
Blair (Syracuse U.), A. Brown (Xerox), M. Gelfond (U. of
Texas), W. Marek (Cornell and U. of Kentucky), A. Nerode
(Cornell), J. Schlipf (U. of Cincinnati), M. Truszczynski
(U. of Kentucky), D. Wijesekera (Cornell).
Scientists active in the research of Logical Foundations of
Artificial Intelligence and interested in participating in
the Session, are requested to get in touch with:
Professor Anil Nerode
Department of Mathematics
Cornell University
Ithaca, NY 14850
Electronic inquiries can be sent to:
[email protected]
Wiktor Marek
normally in the University of Kentucky, but now for 1989/90 in the
MSI/ Cornell University. If you want to reach me, write to:
[email protected]
------------------------------
To: [email protected]
Subject: AI Seminar
>From: "Damaris M. Ayuso" <[email protected]>
Reply-To: [email protected]
Date: Thu, 14 Sep 89 14:45:00 EDT
BBN STC Science Development Program
AI Seminar Series Lecture
AUTOMATIC PROCESSING OF UNRESTRICTED NATURAL
LANGUAGE TEXTS
GERARD SALTON
Cornell University
BBN STC, 2nd floor large conference room
10 Moulton St, Cambridge MA, 02138
Thursday September 21st, 10:30 AM
The conventional artificial intelligence approaches are not viable when
large text samples in arbitrary subject areas must be processed. Text
analysis methods based largely on statistical methods have, however,
been used successfully in information retrieval and related areas for many
years.
The main text analysis methods usable with general purpose texts are
briefly reviewed and applications are described in such areas as
document retrieval, book indexing, linking of related text excerpts, subject
area organization, and so on. Evaluation output is shown wherever
possible to demonstrate the effectiveness of the proposed methodologies.
------------------------------
To: [email protected]
>From: [email protected] (Jacob Cybulski)
Newsgroups: comp.ai.digest,comp.ai.nlang-know-rep,aus.ai
Subject: Re: Connectionist Approaches to NLU
Date: 14 Sep 89 00:20:31 GMT
Last week I sent a request for references on connectionist
approaches to natural language processing. Special thanks to:
Ron Chrisley of Xerox
Trent Lange of AI Labs, UCLA
Diana Roberts of HP Labs
Here are some of the references they suggested, plus a few
I found myself. Note that I also included approximate location
of the authors. I'll be grateful if you could still contribute to
this list and send me some additional information on yours or
your colleagues' work in this area. Again I will summarize the
responses to the net.
Jacob o | o
\_/
References:
Bookman, L.A. (Brandeis Uni - 1987):
"A Microfeature Based Scheme for Modelling Semantics,"
IJCAI 87, 611-614.
Cottrell, G.W. and Small, S.L. (Uni of Rochester - 1983):
"A Connectionist Scheme for Modelling Word Sense Disambiguation,"
Cog. and Brain Theory, 6(1), 89-120.
Dolan, C. P. and Dyer, M. G. (UCLA - 1988):
"Parallel Retrieval of Conceptual Knowledge,"
In D. Touretzky (ed), Proc. of the 1988 Connectionist Summer School,
Morgan Kaufmann.
Dyer, M. G. (UCLA - 1989):
"Symbolic NeuroEngineering for Natural Language Processing,"
To appear in J. Barnden and J. Pollack (eds), Advances in
Connectionist and Neural Computation Theory, Ablex Publications.
Elman, J.L. (UCSD - 1989):
"Representation and Structure in Connectionist Models,"
Cognitive Science Society Conference (not in proceedings)
Elman, J.L. (UCSD - 1988):
"Discovering Syntactic Structure Using Simple Recurrent Networks,"
Technical Report.
Howells, T. (Uni of Massachusetts - 1988):
"VITAL: A Connectionist Parser,"
Proc. Conf. Cog. Sci. 88, 18-25.
Jones, M.A. (AT&T Bell Labs - 1987):
"Feedback as a Coindexing Mechanism in Connectionist Architectures,"
IJCAI 87, 602-610.
Lange, T. and Dyer, M. G. (UCLA - 1989):
"Dynamic, Non-Local Role-Bindings and Inferencing in
a Localist Network for Natural Language Understanding,"
In D. Touretzky (ed), Advances in Neural Information Processing
Systems I, Morgan Kaufmann, San Mateo, CA.
Lange, T. and Dyer, M. G. (UCLA - 1989):
"Frame Selection in a Connectionist Model of
High-Level Inferencing,"
Proc. of the Eleventh Annual Conf. of the Cognitive Science Society,
Ann Arbor, MI, Aug 1989.
MacWhinney, B. (Carnegie Mellon University - 1989):
"A Crosslinguistic Connectionist Model for Morphological Learning,"
Cognitive Science Society Conference (not in proceedings)
Marchman, V. & Plunkett, K. (UCSD & Uni of Aarhus, Denmark - 1989):
"U-Shaped Learning Curves in a Connectionist Model of
Past Tense Learning,"
Cognitive Science Society Conference (not in proceedings)
McClelland, J.L. and Rumelhart, D.E. (Carnegie Mellon - 1981):
"An Interactive Activation Model of Context Effects in
Letter Perception,"
Psychological Reviews 88, 375-407.
McClelland, J.L. (Carnegie Mellon - 1989):
"Models of Language: Rules or Connections?"
Cognitive Science Society Conference (not in proceedings)
Miikkulannen, R. and Dyer, M. G. (UCLA - 1988):
"Encoding Input/Output Representations in Connectionist Cognitive
Systems,"
In D. Touretzky (ed), Proceedings of the 1988 Connectionist Summer
School, Morgan Kaufmann.
Miikkulainen, R. and Dyer, M. G. (UCLA - 1989):
"A Modular Neural Network Architecture for Sequential Paraphrasing
of Script-Based Stories,"
Proceedings of the First Annual International
Joint Conference on Neural Networks, Washington DC, June 1989.
Pollack, J.B. and Waltz, D.L. (Uni of Illinois at U-C - 1984):
"Parallel Interpretation of Natural Language,"
Proc. Int. Conf. 5th Gen. Comp. Sys., 686-691.
Small, S.L. (Uni of Rochester - 1987):
"A Distributed Word-Based Approach to Parsing,"
in L. Bolc (ed) Natural Language Parsing Systems,
Springer-Verlag, 161-202.
St. John, M. (Carnegie Mellon University - 1989):
"Sentence Comprehension by Parallel Constraint Satisfaction,"
Cognitive Science Society Conference (not in proceedings)
------------------------------
To: [email protected]
Date: Tue, 19 Sep 89 11:33:15 -0400
>From: [email protected]
Subject: What KL-ONE Lookalikes Need to Cope with NL (Unisys Seminar)
AI SEMINAR
UNISYS PAOLI RESEARCH CENTER
What KL-ONE Lookalikes Need
to Cope with Natural Language
Juergen Allgayer
University of Saarbrucken
FRG
One of the major drawbacks of current NL processing systems is an
adequate representation of and reasoning about plurals. This is true
because current knowledge representation languages do not provide well
suited representational means neither to describe sets, subsets, and
elements nor to deal with the respective relations or use them in
specially tailored inference systems.
On the other side, there exists (at least) one linguistic theory about
plurality in natural language, the General Quantifier Theory (GQT).
What we want to present in this paper is how we adopted this theory
into the already existing framework of the XTRA system. Our goal
therefor is to develop a well-grounded knowledge representation
formalism able to represent sets as well as to deal with them and
combine this representation formalism with a well-defined linguistic
theory.
The knowledge representation language SB-ONE+ integrates sets into the
KL-ONE like KR language SB-ONE. It realizes this by means of
regarding sets as epistemological primitives, thus allowing for both
an implementation of set-relevant properties (like reasoning about
subset-of and element-of relationships) in the system as well as a
description of sets as elements inside the TBox if relevant for the
domain under consideration. Taking SB-ONE+ as representational basis,
we show how some inte- resting results from GQT are implemented in the
XTRA system.
11:00am September 20
BIC Conference Room
Unisys Paoli Research Center
Route 252 and Central Ave.
Paoli PA 19311
-- non-Unisys visitors who are interested in attending should --
-- send email to [email protected] or call 215-648-7446 --
------------------------------
To: [email protected]
>From: [email protected]
Newsgroups: comp.ai.nlang-know-rep
Subject: CALL FOR PAPERS Mathematical Programming and Expert Systems...
Date: Tuesday, 19 Sep 1989 12:38:37 EDT
+-------------------------------------------------------------------+
| CALL FOR PAPERS |
| |
| RECENT APPLICATIONS OF MATHEMATICAL PROGRAMMING TO |
| EXPERT SYSTEMS DEVELOPMENT |
| |
| A Section of the 8th INTERNATIONAL CONGRESS OF CYBERNETICS |
| AND SYSTEMS |
| |
| Hunter College of the City University of New York |
| New York, New York |
| June 11-15, 1990 |
+-------------------------------------------------------------------+
This session will host work that demonstrates the
increasing potential of combining mathematical programming
approaches to expert systems problems. Both original
research and survey papers will be considered. Some
relevant topics include, but are not limited to:
o Machine Learning and Mathematical Programming
o Logic Problems and Mathematical Programming
o Expert Systems and Operations Research
o AI and Operations Research
This triennial conference is supported by many
international groups concerned with management, the sciences,
computers, and information systems. The Congress will
provide a forum, symposia and sections, for the presentation
and discussion of current research. All meetings will be
held in midtown Manhattan.
Section Chairs:
Allen L. Soyster, Professor and Head,
Dept. of Industrial Engineering, Penn State University
Evangelos Triantaphyllou, Ph.D. Candidate,
Dept. of Industrial Engineering, Penn State University
Program Chair:
Constantin Negoita, Professor,
Hunter College, CUNY, New York, NY.
Papers should be approximately 2,000-4,000 words in
length. Please send 4 hard copies (not e-mail) to:
+-------------------------------------------------------------------+
| Evangelos Triantaphyllou |
| E-Mail: [email protected] |
| Department of Industrial Engineering |
| Penn State University |
| 207 Hammond Building |
| University Park, PA 16802, USA |
+-------------------------------------------------------------------+
Deadlines: January 1, 1990: Submission of paper.
April 1, 1990: Notification of disposition
All items will be acknowledged
------------------------------
End of NL-KR Digest
*******************
|
| 125.11 | dL-KR Digest V6.37 | HERON::ROACH | TANSTAAFL ! | Wed Nov 29 1989 15:29 | 497 |
| Printed by: Pat Roach Document Number: 009294
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 28-Nov-1989 12:07pm CET
From: AI_INFO
AI_INFO@AIVTX@MRGATE@DELOS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V6.37
NL-KR Digest (Tue Sep 19 18:38:21 1989) Volume 6 No. 37
Today's Topics:
Better Explanations for Expert Systems (Unisys AI Seminar)
Workshop Announcement & Call for papers
Special Session on Logic and A.I.
AI Seminar
Re: Connectionist Approaches to NLU
What KL-ONE Lookalikes Need to Cope with NL (Unisys Seminar)
CALL FOR PAPERS Mathematical Programming and Expert Systems...
Submissions: [email protected]
Requests, policy: [email protected]
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.
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: [email protected]
Date: Mon, 11 Sep 89 13:58:30 -0400
>From: [email protected] (Tim Finin)
Subject: Better Explanations for Expert Systems (Unisys AI Seminar)
AI SEMINAR
UNISYS PAOLI RESEARCH CENTER
Dr. Jennifer Jerrams Smith
Artificial Intelligence Group
Philips Research Laboratories
Redhill, Surrey, RH1 5HA, UK
(vrdxhq!uunet!prlb2!prlhp1!smithjj)
The BEES project:
Better Explanations for Expert Systems.
The aim of the BEES project is to improve the communication and
cooperation between users and knowledge based systems. It resulted
from the realization that current expert systems (ES) provide very
limited explanations to their users (the traditional "how" and "why"
questions). In many cases their acceptability, marketability and
usability would be greatly improved if such systems could interact in
a more cooperative way to solve problems through the combined
expertise of user and ES.
Development of more cooperative ESs involves investigation of what
domain knowledge is needed and how it should be represented so that
the ES can answer some of the many different sorts of questions which
users wish to ask. Additionally, the ES must hold information about
the user, so that it can communicate effectively and efficiently, in
terms which the user understands.
We are currently working on the following areas: representing the
variety of knowledge required, natural language processing, generating
textual responses, integrating graphical and textual explanations,
behavioural studies of advisors and users, developing a taxonomy of
explanations.
11:00am September 25
BIC Conference Room
Unisys Paoli Research Center
Route 252 and Central Ave.
Paoli PA 19311
-- non-Unisys visitors who are interested in attending should --
-- send email to [email protected] or call 215-648-7446 --
------------------------------
To: [email protected]
Date: Mon, 11 Sep 89 19:14:53 -0400
>From: [email protected] (Deepak Kumar)
Subject: Workshop Announcement & Call for papers
CALL FOR PAPERS
FIRST ANNUAL SNePS WORKSHOP
Co-Sponsored by the SNePS Research Group and the
SUNY at Buffalo Center for Cognitive Science
November 13, 1989
280 Park Hall
North Campus
SUNY at Buffalo
SNePS, in its various incarnations, is being actively used and
developed at various AI research labs around the world. The
aim of this workshop is to try to get together researchers who
are (have been, or are considering) using SNePS as a research
tool for AI modeling as well as those who are (have been,
or are considering) evaluating SNePS as an AI research
environment.
The theme of this workshop is to present a survey of
current and on-going research and developments at various
research sites. Attendance at the workshop
will be kept small (by invitation only) to allow for maximum
possible interaction among participants.
The workshop will be semi-formal and held on the
campus of SUNY at Buffalo (where the SNePS headquarters are
located). All papers presented will be
edited and compiled into Proceedings which will be
published as a Department of Computer Science, SUNY at
Buffalo Technical Report.
To be invited to the workshop, you have to do one of the
following (preferably by e-mail):
1. Submit a one page abstract of a paper to be considered
for presentation.
2. Submit a short write-up of your current research and how
it does/might relate to the SNePS family of projects.
We will also schedule a time slot for live demonstrations of systems.
Those interested in giving demonstrations should submit a small
description outlining the nature of the demonstration along with
hardware/software/time requirements.
DEADLINES
Abstracts/Research Summaries due on Friday, October 6, 1989.
Notification of acceptance/participation by October 13, 1989.
Final papers due on Tuesday, October 31, 1989.
SUBMISSIONS TO:
Deepak Kumar
226 Bell Hall
SUNY at Buffalo
Buffalo NY, 14260
[email protected]
Send any queries to the organization committee:
General:
Deepak Kumar ([email protected])
Sy Ali ([email protected])
Demos:
Hans Chalupsky ([email protected])
Everyone will be expected to make their own living arrangements.
There may be a possibility of making some arrangements with
local SNeRG members.
Thank you.
Deepak Kumar
------------------------------
To: [email protected]
>From: [email protected] (Wiktor Marek)
Newsgroups: comp.ai
Subject: Special Session on Logic and A.I.
Date: 12 Sep 89 17:15:08 GMT
Reply-To: [email protected] (Wiktor Marek)
Special Session on Logic and Artificial Intelligence
at:
Symposium on Artificial Intelligence and Mathematics
Fort Lauderdale, FL January 3-5 1990
During the Symposium (see: news.announce.conferences) a spe-
cial Session on Logic and Artificial Intelligence will take
place. A number of logicians currently involved in investi-
gations of Logical Foundations of Artificial Intelligence
will take part in the Session. These currently include: H.
Blair (Syracuse U.), A. Brown (Xerox), M. Gelfond (U. of
Texas), W. Marek (Cornell and U. of Kentucky), A. Nerode
(Cornell), J. Schlipf (U. of Cincinnati), M. Truszczynski
(U. of Kentucky), D. Wijesekera (Cornell).
Scientists active in the research of Logical Foundations of
Artificial Intelligence and interested in participating in
the Session, are requested to get in touch with:
Professor Anil Nerode
Department of Mathematics
Cornell University
Ithaca, NY 14850
Electronic inquiries can be sent to:
[email protected]
Wiktor Marek
normally in the University of Kentucky, but now for 1989/90 in the
MSI/ Cornell University. If you want to reach me, write to:
[email protected]
------------------------------
To: [email protected]
Subject: AI Seminar
>From: "Damaris M. Ayuso" <[email protected]>
Reply-To: [email protected]
Date: Thu, 14 Sep 89 14:45:00 EDT
BBN STC Science Development Program
AI Seminar Series Lecture
AUTOMATIC PROCESSING OF UNRESTRICTED NATURAL
LANGUAGE TEXTS
GERARD SALTON
Cornell University
BBN STC, 2nd floor large conference room
10 Moulton St, Cambridge MA, 02138
Thursday September 21st, 10:30 AM
The conventional artificial intelligence approaches are not viable when
large text samples in arbitrary subject areas must be processed. Text
analysis methods based largely on statistical methods have, however,
been used successfully in information retrieval and related areas for many
years.
The main text analysis methods usable with general purpose texts are
briefly reviewed and applications are described in such areas as
document retrieval, book indexing, linking of related text excerpts, subject
area organization, and so on. Evaluation output is shown wherever
possible to demonstrate the effectiveness of the proposed methodologies.
------------------------------
To: [email protected]
>From: [email protected] (Jacob Cybulski)
Newsgroups: comp.ai.digest,comp.ai.nlang-know-rep,aus.ai
Subject: Re: Connectionist Approaches to NLU
Date: 14 Sep 89 00:20:31 GMT
Last week I sent a request for references on connectionist
approaches to natural language processing. Special thanks to:
Ron Chrisley of Xerox
Trent Lange of AI Labs, UCLA
Diana Roberts of HP Labs
Here are some of the references they suggested, plus a few
I found myself. Note that I also included approximate location
of the authors. I'll be grateful if you could still contribute to
this list and send me some additional information on yours or
your colleagues' work in this area. Again I will summarize the
responses to the net.
Jacob o | o
\_/
References:
Bookman, L.A. (Brandeis Uni - 1987):
"A Microfeature Based Scheme for Modelling Semantics,"
IJCAI 87, 611-614.
Cottrell, G.W. and Small, S.L. (Uni of Rochester - 1983):
"A Connectionist Scheme for Modelling Word Sense Disambiguation,"
Cog. and Brain Theory, 6(1), 89-120.
Dolan, C. P. and Dyer, M. G. (UCLA - 1988):
"Parallel Retrieval of Conceptual Knowledge,"
In D. Touretzky (ed), Proc. of the 1988 Connectionist Summer School,
Morgan Kaufmann.
Dyer, M. G. (UCLA - 1989):
"Symbolic NeuroEngineering for Natural Language Processing,"
To appear in J. Barnden and J. Pollack (eds), Advances in
Connectionist and Neural Computation Theory, Ablex Publications.
Elman, J.L. (UCSD - 1989):
"Representation and Structure in Connectionist Models,"
Cognitive Science Society Conference (not in proceedings)
Elman, J.L. (UCSD - 1988):
"Discovering Syntactic Structure Using Simple Recurrent Networks,"
Technical Report.
Howells, T. (Uni of Massachusetts - 1988):
"VITAL: A Connectionist Parser,"
Proc. Conf. Cog. Sci. 88, 18-25.
Jones, M.A. (AT&T Bell Labs - 1987):
"Feedback as a Coindexing Mechanism in Connectionist Architectures,"
IJCAI 87, 602-610.
Lange, T. and Dyer, M. G. (UCLA - 1989):
"Dynamic, Non-Local Role-Bindings and Inferencing in
a Localist Network for Natural Language Understanding,"
In D. Touretzky (ed), Advances in Neural Information Processing
Systems I, Morgan Kaufmann, San Mateo, CA.
Lange, T. and Dyer, M. G. (UCLA - 1989):
"Frame Selection in a Connectionist Model of
High-Level Inferencing,"
Proc. of the Eleventh Annual Conf. of the Cognitive Science Society,
Ann Arbor, MI, Aug 1989.
MacWhinney, B. (Carnegie Mellon University - 1989):
"A Crosslinguistic Connectionist Model for Morphological Learning,"
Cognitive Science Society Conference (not in proceedings)
Marchman, V. & Plunkett, K. (UCSD & Uni of Aarhus, Denmark - 1989):
"U-Shaped Learning Curves in a Connectionist Model of
Past Tense Learning,"
Cognitive Science Society Conference (not in proceedings)
McClelland, J.L. and Rumelhart, D.E. (Carnegie Mellon - 1981):
"An Interactive Activation Model of Context Effects in
Letter Perception,"
Psychological Reviews 88, 375-407.
McClelland, J.L. (Carnegie Mellon - 1989):
"Models of Language: Rules or Connections?"
Cognitive Science Society Conference (not in proceedings)
Miikkulannen, R. and Dyer, M. G. (UCLA - 1988):
"Encoding Input/Output Representations in Connectionist Cognitive
Systems,"
In D. Touretzky (ed), Proceedings of the 1988 Connectionist Summer
School, Morgan Kaufmann.
Miikkulainen, R. and Dyer, M. G. (UCLA - 1989):
"A Modular Neural Network Architecture for Sequential Paraphrasing
of Script-Based Stories,"
Proceedings of the First Annual International
Joint Conference on Neural Networks, Washington DC, June 1989.
Pollack, J.B. and Waltz, D.L. (Uni of Illinois at U-C - 1984):
"Parallel Interpretation of Natural Language,"
Proc. Int. Conf. 5th Gen. Comp. Sys., 686-691.
Small, S.L. (Uni of Rochester - 1987):
"A Distributed Word-Based Approach to Parsing,"
in L. Bolc (ed) Natural Language Parsing Systems,
Springer-Verlag, 161-202.
St. John, M. (Carnegie Mellon University - 1989):
"Sentence Comprehension by Parallel Constraint Satisfaction,"
Cognitive Science Society Conference (not in proceedings)
------------------------------
To: [email protected]
Date: Tue, 19 Sep 89 11:33:15 -0400
>From: [email protected]
Subject: What KL-ONE Lookalikes Need to Cope with NL (Unisys Seminar)
AI SEMINAR
UNISYS PAOLI RESEARCH CENTER
What KL-ONE Lookalikes Need
to Cope with Natural Language
Juergen Allgayer
University of Saarbrucken
FRG
One of the major drawbacks of current NL processing systems is an
adequate representation of and reasoning about plurals. This is true
because current knowledge representation languages do not provide well
suited representational means neither to describe sets, subsets, and
elements nor to deal with the respective relations or use them in
specially tailored inference systems.
On the other side, there exists (at least) one linguistic theory about
plurality in natural language, the General Quantifier Theory (GQT).
What we want to present in this paper is how we adopted this theory
into the already existing framework of the XTRA system. Our goal
therefor is to develop a well-grounded knowledge representation
formalism able to represent sets as well as to deal with them and
combine this representation formalism with a well-defined linguistic
theory.
The knowledge representation language SB-ONE+ integrates sets into the
KL-ONE like KR language SB-ONE. It realizes this by means of
regarding sets as epistemological primitives, thus allowing for both
an implementation of set-relevant properties (like reasoning about
subset-of and element-of relationships) in the system as well as a
description of sets as elements inside the TBox if relevant for the
domain under consideration. Taking SB-ONE+ as representational basis,
we show how some inte- resting results from GQT are implemented in the
XTRA system.
11:00am September 20
BIC Conference Room
Unisys Paoli Research Center
Route 252 and Central Ave.
Paoli PA 19311
-- non-Unisys visitors who are interested in attending should --
-- send email to [email protected] or call 215-648-7446 --
------------------------------
To: [email protected]
>From: [email protected]
Newsgroups: comp.ai.nlang-know-rep
Subject: CALL FOR PAPERS Mathematical Programming and Expert Systems...
Date: Tuesday, 19 Sep 1989 12:38:37 EDT
+-------------------------------------------------------------------+
| CALL FOR PAPERS |
| |
| RECENT APPLICATIONS OF MATHEMATICAL PROGRAMMING TO |
| EXPERT SYSTEMS DEVELOPMENT |
| |
| A Section of the 8th INTERNATIONAL CONGRESS OF CYBERNETICS |
| AND SYSTEMS |
| |
| Hunter College of the City University of New York |
| New York, New York |
| June 11-15, 1990 |
+-------------------------------------------------------------------+
This session will host work that demonstrates the
increasing potential of combining mathematical programming
approaches to expert systems problems. Both original
research and survey papers will be considered. Some
relevant topics include, but are not limited to:
o Machine Learning and Mathematical Programming
o Logic Problems and Mathematical Programming
o Expert Systems and Operations Research
o AI and Operations Research
This triennial conference is supported by many
international groups concerned with management, the sciences,
computers, and information systems. The Congress will
provide a forum, symposia and sections, for the presentation
and discussion of current research. All meetings will be
held in midtown Manhattan.
Section Chairs:
Allen L. Soyster, Professor and Head,
Dept. of Industrial Engineering, Penn State University
Evangelos Triantaphyllou, Ph.D. Candidate,
Dept. of Industrial Engineering, Penn State University
Program Chair:
Constantin Negoita, Professor,
Hunter College, CUNY, New York, NY.
Papers should be approximately 2,000-4,000 words in
length. Please send 4 hard copies (not e-mail) to:
+-------------------------------------------------------------------+
| Evangelos Triantaphyllou |
| E-Mail: [email protected] |
| Department of Industrial Engineering |
| Penn State University |
| 207 Hammond Building |
| University Park, PA 16802, USA |
+-------------------------------------------------------------------+
Deadlines: January 1, 1990: Submission of paper.
April 1, 1990: Notification of disposition
All items will be acknowledged
------------------------------
End of NL-KR Digest
*******************
|
| 125.12 | NL-KR Digest V6.43 | HERON::ROACH | TANSTAAFL ! | Wed Nov 29 1989 15:36 | 628 |
| Printed by: Pat Roach Document Number: 009300
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 28-Nov-1989 01:49pm CET
From: AI_INFO
AI_INFO@AIVTX@HERON@MRGATE@VALMTS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V6.43
NL-KR Digest (Tue Nov 21 12:42:32 1989) Volume 6 No. 43
Today's Topics:
BC Canada Wants ATMS implementation
Request for articles/papers.
USER MODELING AND USER-ADAPTED INTERACTION: An International Journal
Nonmonotonic Reasoning Workshop
Advance Programme for KBCS '89 (Dec 11-13, Bombay, INDIA)
Submissions: [email protected]
Requests, policy: [email protected]
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.
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: [email protected]
>From: mdavcr!rdr (Randolph Roesler)
Newsgroups: comp.ai.nlang-know-rep
Subject: BC Canada Wants ATMS implementation
Summary: DeKleer's ATMS
Date: 31 Oct 89 22:32:33 GMT
Reply-To: mdavcr!auriga!rdr (Randolph Roesler)
Organization: MacDonald Dettwiler, Richmond, B.C., Canada
Does anybody have a public domain (or shareware)
implementation of DeKleer's ATMS.
Any language OK.
Thanks.
- -
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
It's not the size of your signature that Randy Roesler
counts - it's how you use it! MacDonald Dettwiler & Assc.
email ...!uunet!van-bc!mdavcr!rdr BC Canada 604-278-3411
------------------------------
To: [email protected]
Date: Tue, 14 Nov 89 18:08 CDT
>From: <RAYMOND%[email protected]>
Subject: Request for articles/papers.
My father edits the "Creative Science and Technology" magazine;
Which is distributed nation wide. Among his past authors you can
find Herbert Simon, Linus Pauling, Edward Teller, Buchminster Fuller
and other internationally known scientists and engineers.
Articles in the areas of physical science, life science and technology
are hearby solicited. We are sorry that we are not able to pay for
articles, since the magazine is free for minorities and women who
attend the schools on the distribution list. We hope that your
satisfaction will come from, turning young minds on to the fields
of science and technology.
You may submit articles, along with a short biographical sketch, either
through Email or Snail-Mail. Thanks in advance.
Sincerely,
Raymond M. A. Erdey
Snail-Mail : Dr. Michael R. A. Erdey
P. O. Box 1852
Auburn, Alabama 36831-1852
Phone Office : (205) 727-8988
Home : (205) 821-8008
BITNET : Raymond@AuDucVAX
------------------------------
To: [email protected]
>From: "Alfred Kobsa" <sbsvax!ak%[email protected]>
Date: Fri, 3 Nov 89 09:49:04 +0100 (MET)
Subject: USER MODELING AND USER-ADAPTED INTERACTION: An International Journal
Advance Information and Call for Papers:
USER MODELING AND USER-ADPTED INTERACTION:
AN INTERNATIONAL JOURNAL
A new journal has been founded that provides an interdisciplinary forum for the
dissemination of new research results on all aspects of user-adapted inter-
action in person-machine interfaces, natural-language dialog systems,
intelligent tutoring systems and intelligent interfaces. The journal publishes
high-quality original papers contributing to these fields, including the
following areas:
- acquisition of user and student models
- conceptual models, mental models
- dialog planning and response tailoring
- levels of user expertise
- explanation strategies
- plan recognition and generation
- presentation planning
- recognition and correction of misconceptions
- user stereotypes
- formal representation of user and student models
- shell systems for user modeling
- tutoring strategies
Relevant papers from the fields of Psychology, Linguistics and the
Instructional Sciences are also considered.
The central audience of the journal are researchers, students and industrial
practitioners from the following areas: Artificial Intelligence (focus on
knowledge-based systems), Human-Computer Interaction (focus on cognitive
engineering and intelligent interfaces), Linguistics (focus on pragmatics and
dialog models), and the Instructional Sciences (focus on computer-based
tutoring systems).
Editor: Alfred Kobsa
Dept. of Computer Science
University of Saarbruecken
D-6600 Saarbruecken 11
WEST GERMANY
Editorial Board:
David Benyon, Open University, England
Sandra Carberry, Univ. of Delaware, U.S.A.
David Chin, Univ. of Hawaii at Manoa, U.S.A.
Robin Cohen, Univ. of Waterloo, Canada
Timothy Finin, Unisys, Paoli, U.S.A.
Gerhard Fischer, Univ. of Colorado, U.S.A.
Gordon McCalla, Univ. of Saskatchewan, Canada
Dianne Murray, City University, England
Cecile Paris, Information Science Institute, U.S.A.
Elaine Rich, MCC, Austin, U.S.A.
Hans Spada, Univ. of Freiburg, West Germany
Karen Sparck Jones, Univ. of Cambridge, England
Michael Tauber, Univ. of Paderborn, West Germany
Wolfgang Wahlster, Univ. of Saarbruecken, West Germany
Richard Young, MRC, Cambridge, England
(List to be completed)
UMUAI is published quarterly by Kluwer Academic Publishers, Dordrecht,
Netherlands. The first issue is to appear in January, 1991.
Authors who wish to submit a paper should send four copies to the Editor. Elec-
tronic submission of LaTeX files is also possible if the special UMUAI style is
used. For further information (especially on electronic submission), send a
message to umuai-info%[email protected] or
[{uunet,mcvax}!]unido!sbsvax!fb10vax!umuai-info. These addresses will be
probably changed to [email protected] in 1990.
------------------------------
To: [email protected]
>From: [email protected] (Kurt Konolige)
Newsgroups: comp.ai
Subject: Nonmonotonic Reasoning Workshop
Date: 2 Nov 89 02:01:24 GMT
Organization: SRI International, Menlo Park, CA
Please note: there is a revised deadline for submissions,
** December 17, 1989 **. Also, electronic submissions should
be either printable directly, or in LaTeX format, with all
relevant macros included.
- ----------------------------------------------------
CALL FOR PARTICIPATION
THIRD INTERNATIONAL WORKSHOP ON NONMONOTONIC REASONING
The third international workshop on nonomontonic reasoning, sponsored by
AAAI and CSCSI, will be held May 31-June 3, 1990, at the Stanford Sierra
Camp in South Lake Tahoe, California. The aim of the workshop is to
bring together active researchers in the area of nonmonotonic reasoning
to discuss current research, results, and problems of both theoretical
and practical nature.
Topics (not necessarily exhaustive):
General theories of defeasible inference
Comparison of formal systems
Applications to planning, commonsense reasoning
Knowledge update and truth maintenance
Relation to probability models
Theories of inheritance with exceptions
Argument-based systems
Proof theory, complexity, and automation
Attendance will be limited to 30-40 people, by invitation only. Those
wishing to attend should submit five copies of a detailed abstracts of
current research to:
Kurt Konolige
SRI International EJ272
333 Ravenswood Avenue
Menlo Park, Ca. 94025
Phone: (415) 859-2788
E-mail: [email protected]
Electronic mail submissions are encouraged (one copy only!). Abstracts
should consist of no more than 10 double-spaced pages when printed (4000
words) and should include enough information to enable the program
committee to judge the contribution of the work. Abstracts will be
accepted on the basis of quality, originality, and significance. The
deadline for submission of papers is ***December 17, 1989*** (note that
this is later than the original announcement). Notification of
acceptance will be made by February 26, 1990. Accepted authors will be
asked to send a preprint for distribution at the workshop. Papers
presented at the workshop can be submitted for publication in a
collection to appear later.
Program Committee:
Johan DeKleer, Xerox Parc ([email protected])
Jon Doyle, MIT ([email protected])
David Etherington, AT&T ([email protected])
Matt Ginsberg, Stanford ([email protected])
Hector Geffner, UCLA ([email protected])
David Israel, SRI ([email protected])
Henry Kautz, AT&T ([email protected])
Vladimir Lifschitz, Stanford ([email protected])
David Poole, UBC ([email protected])
Erik Sandewall, Linkoping
([email protected])
Richmond Thomason, Pittsburgh ([email protected])
In addition to accepted authors, we have a limited number of slots for
students who have shown promise in the area. Sponsors for such students
should send a short justification to Kurt Konolige at the above address.
------------------------------
To: [email protected]
Date: Wed, 1 Nov 89 15:18:29 -0500 (EST)
>From: "Prakash N. Kytharam" <[email protected]>
Subject: Advance Programme for KBCS '89 (Dec 11-13, Bombay, INDIA)
Subject: Advance Programme for KBCS '89
Conference on Knowledge Based Computer Systems - KBCS '89
Bombay, India
Venue: Centaur Hotel Juhu Beach
December 11-13, 1989
Advance Programme
1. About the Conference
141 papers were received from India and abroad within
the deadline, and 44 have been selected for presenta-
tion.
The technical programme will consist of invited talks,
paper presentations and poster sessions. The paper
presentations will be held in two parallel streams.
2. Invited Speakers
A Computational Architecture for Co-operative Systems
David Allport, Hewlett Packard Laboratories, UK
Computer Architecture: What it can do and what it
cannot do for AI
Arvind, MIT, USA
Could a Computer be Creative?
Margaret Boden, University of Sussex, UK
Developments in Expert Systems
B Chandrasekaran, Ohio State University, USA
Natural Language Understanding (title to be confirmed)
Aravind Joshi, University of Pennsylvania, USA
Human and Artificial Intelligence: Report on the
Conclusions of a Seminar
R Narasimhan, Tata Institute of Fundamental Research, Bombay
Parsing with Extended Unification
P Saint-Dizier, Universite Paul Sabatier, France
Parallel Logic Programming Systems
David Warren, University of Bristol, UK
3-D Computer Vision
Steven Zucker, McGill University, Canada
3. Contributed Papers
Advances in Expert Systems
--------------------------
Modelling Exceptions in Semantic Database and
Knowledge-based Systems
PL Tan, TS Dillon and J Zeleznikow
La Trobe University, Australia
Interpretation and Rule Packet in Expert Systems:
Application to the SEPT Expert System
Patrick Brezillon
Universite de Paris XI, France
New Techniques in Model-Based Diagnosis
Peter Struss
Siemens AG, West Germany
An Expert System Framework for the Preliminary Design of
Process Flowsheets
MS Gandikota and JF Davis
Ohio State University, USA
Intelligent Onboard Telemetry System: A Design Approach
P Anguswamy, M Krishnakumar and V Mala
Vikram Sarabhai Space Centre, Trivandrum, India
The Platypus Expert System Shell
Bill Havens
Simon Fraser University, Canada
Logic Programming
-----------------
Believability in Default Logic Entails Logical Consequence
from Circumscription (Sometimes)
Atsushi Togashi, Ben Hui Hou and Shoichi Noguchi
Research Institute of Electrical Communication, Japan
An Abstract Machine for the REDUCE-OR Process Model
for Parallel Prolog
B Ramkumar and LV Kale
University of Illinois at Urbana-Champaign, USA
Generalized Predicate Completion
Atsushi Togashi, A Ben Hui Hou and A Shoichi Noguchi
Tohoku University, Japan
On the Completeness of Narrowing for E-unification
Jia-Huai You and PA Subrahmanyam
University of Alberta, Canada
On the Generalized Predicate Completion of Non-Horn Program
Phan Minh Dung and Kanchana Kanchanasut
Asian Institute of Technology, Thailand
A Unified Framework for Characterising Logic Program
Executions
SL Mehndiratta and E Ravindran
Indian Institute of Technology, Bombay, India
Improving Prolog Performance through Inductive
Proof Generalization
Milind Gandhe and G Venkatesh
Indian Institute of Technology, Bombay, India
Knowledge Representation
------------------------
Representing and Using Protosemantic Information in
Generating Bus Route Descriptions
T Pattabhiraman and Nick Cercone
Simon Fraser University, Canada
Integrated Actor Paradigm for Knowledge Based Systems
BJ Garner and D Lukose
Deakin University, Australia
Knowledge Representation in Distributed Blackboard
Architecture: Some Issues
Manoj K Saxena, KK Biswas and PCP Bhatt
CMC Ltd, New Delhi, India
Differing Perspectives of Knowledge Representation in
Artificial Intelligence and Discrete Event Modeling:
A Technical Summary
Ashvin Radiya
Syracuse University, USA
A Representation for Modeling Functional Knowledge
in Geometric Structures
Amitabha Mukerjee
Texas A&M University, USA
Four General Representations and Processes for Use
in Problem Solving
Dan Fass
Simon Fraser University, Canada
Handling Multiple Inheritance with Exceptions:
An Alternate Approach
Sanjay Bhansali and Mehdi T Harandi
University of Illinois at Urbana Champaign, USA
Reasoning using Inheritance from a Mixture of
Knowledge and Beliefs
Afzal Ballim, Sylvia Candelaria de Ram and Dan Fass
Institut Dalle Molle pour les Etudes
Semantiques et Cognitives, Switzerland
Implementation of Conceptual Graphs using Frames in LEAD
KC Reddy, CSK Reddy and PG Reddy
University of Hyderabad, Hyderabad, India
Natural Language Understanding
------------------------------
Representing Discursive Temporal Knowledge: A Computational
Application of DRT
Myriam Bras
Institut de Recherche en Informatique de Toulouse, France
From Utterance to Belief via Presupposition:
Default Logic in User-Modelling
A Csinger and D Poole
University of British Columbia, Canada
Novel Terms and Cooperation in a Natural Language Interface
Paul McFetridge and Chris Groeneboer
Simon Fraser University, Canada
Parsing with Extended Unification Mechanisms
Patrick Saint-Dizier
LSI Universite Paul Sabatier, France
Intelligent Information Categorization, Archival and Retrieval
Abhay Bhandarkar, R Chandrasekar, S Ramani and A Bhatnagar
National Centre for Software Technology, Bombay, India
Pattern Recognition and Vision
------------------------------
Shape Based Object Recognition
DK Banerjee, SK Parui, D Dutta Majumder
Indian Statistical Institute, Calcutta, India
Newspaper Image Understanding
V Govindaraju, S Lam, D Niyogi, DB Sher, R Srihari,
SN Srihari and D Wang
State University of New York at Buffalo, USA
Learning
--------
A Methodology for Self Monitoring in Information
Retrieval Systems
Padmini Srinivasan
George Mason University, USA
Knowledge Discovery: A Theoretical Perspective
Dimitrios Thanassas
Imperial College, United Kingdom
Computer Architecture and Parallel Processing
---------------------------------------------
Design and Implementation of a Broadcast Cube Multiprocesser
Rajat Moona and V Rajaraman
Indian Institute of Science, Bangalore, India
Automatic Test Pattern Generation on Multiprocessors
Sunil Aravindam, Vipin Kumar, V Nageshwara Rao and Vineet Singh
University of Texas at Austin, USA
Tools for Representation of Knowledge on Parallel Machines
Perry J Busalacchi and James R Slagle
University of Minnesota, USA
Intelligent Tutoring Systems
----------------------------
Mental Models of Recursion and Their Use in the
SCENT Programming Advisor
Shawkat H Bhuiyan, Jim E Greer and Gordon I McCalla
University of Saskatchewan, Canada
A Trigonometry Tutor
Parvati Rajan, P Patil, KSR Anjaneyulu and P Srinivas
National Centre for Software Technology, Bombay, India
Explanation of Algebraic Reasoning: The Aplusix System
Jean-Francois Nicaud and Mustapha Saidi
Universite Paris XI, France
Reasoning
---------
Implementing Persistence of Derived Information in a
Reason Maintenance System
N Parameswaran and D Kulkarni
Indian Institute of Technology, Madras, India
Pruning by Upperbounds in Heuristic Search: Use of
Approximate Algorithms
UK Sarkar, PP Chakrabarti, S Ghose and SC De Sarkar
Indian Institute of Technology, Kharagpur, India
Speech
------
A Probabilistic Training Scheme for the
Time-Concentration Network
S Krishnan and P Poddar
Tata Institute of Fundamental Research, Bombay, India
AI Applications
---------------
Solving the Generalized Job Shop Scheduling Problem via
Temporal Constraint Propagation
Wesley Chu and Patrick Ngai
University of California at Los Angeles, USA
Network Search with Inadmissible Heuristics
A Mahanti and K Ray
Jadavpur University Campus, Calcutta, India
Central Government Pension Rules as a Logic Program
KK Bajaj, RK Dubash and R Kowalski
Department of Electronics, Govt of India, New Delhi, India
A Computational Architecture for Co-operative Systems
David Allport
Hewlett Packard Laboratories, United Kingdom
4. Pre-Conference Tutorials (On December 10th, 1989)
A1: Task Specific Architectures for the Construction of
Knowledge Based Systems
B Chandrasekaran, Ohio State University, USA
A2: Natural Language Processing and Logic Programming
P Saint-Dizier, Universite Paul Sabatier, France
B1: Representation of Linguistic Knowledge: Recent
Grammatical Formalisms
Aravind Joshi, University of Pennsylvania, USA
B2: Logic Programming Systems
David Warren, University of Bristol, UK
B3: The Computational Neurobiology of Vision
Steven Zucker, McGill University, Canada
5. Conference Committees
International Advisory Committee
--------------------------------
K Apt, Centrum voor Wiskunde en Informatica, Amsterdam
Arvind, Massachusetts Institute of Technology, USA
M Boden, University of Sussex, UK
A Joshi, University of Pennsylvania, USA
R Kowalski, Imperial College, UK
CJP Lucena, Pontifficia Universidade Catoilica do Rio de Janeiro, Brazil
P Saint-Dizier, Universite Paul Sabatier, France
A Togashi, Tohoku University, Japan
Programme Committee
-------------------
S Ramani, National Centre for Software Technology, Bombay (Chairman)
S Arun Kumar, Indian Institute of Technology, Bombay
KK Bajaj, Department of Electronics, Delhi
VP Bhatkar, Centre for Development of Advanced Computing, Pune
PCP Bhatt, Indian Institute of Technology, Delhi
D Dutta Majumder, Indian Statistical Institute, Calcutta
HN Mahabala, Indian Institute of Technology, Madras
V Rajaraman, Indian Institute of Science, Bangalore
PVS Rao, Tata Institute Fundamental Research, Bombay
R Sangal, Indian Institute of Technology, Kanpur
6. Registration Fee
Conference
On or before November 30, 1989 : Rs 1500 (US $90)
After November 30, 1989 : Rs 1800 (US $110)
On-site Registration : Rs 2000 (US $125)
On-site registration will be subject to availability of
seats. Coupons for the Conference Dinner will be free
for those who register on or before November 15. Others
will be able to purchase it for Rs 50 (US $5).
Tutorials
Rs 500 (US $35) per tutorial for conference participants.
All payments should be made by a crossed cheque or
draft, payable to National Center for Software Technology.
Credit Cards cannot be accepted.
7. Address for Correspondence
KBCS '89 Secretariat
National Centre for Software Technology
Gulmohar Cross Road No. 9
Juhu, Bombay 400 049, INDIA
Email: [email protected]
Telex: +81 (11) 78260 NCST IN
Telephone: +91 (22) 620 1606
------------------------------
End of NL-KR Digest
*******************
|
| 125.13 | NL-KR Digest V6.41 | HERON::ROACH | TANSTAAFL ! | Wed Nov 29 1989 15:37 | 560 |
| Printed by: Pat Roach Document Number: 009301
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 28-Nov-1989 02:09pm CET
From: AI_INFO
AI_INFO@AIVTX@MRGATE@STATOS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V6.41
NL-KR Digest (Tue Oct 31 15:36:09 1989) Volume 6 No. 41
Today's Topics:
IEA/AIE-90 Call for Papers
RA Post in AI Dept at Edinburgh
HMI/AI in aeronatics and space conference
BBN AI Seminar
CFP with REVISED SUBMISSION DATE
ATN written in C or Pascal
CFP 1990 European Knowledge Acquisition Workshop
Submissions: [email protected]
Requests, policy: [email protected]
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.
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: [email protected]
>From: [email protected] (Marco Valtorta)
Newsgroups: comp.ai
Subject: IEA/AIE-90 Call for Papers
Date: 3 Oct 89 13:24:06 GMT
Reply-To: [email protected] (Marco Valtorta)
Third International Conference on Industrial and Engineering Applications
of Artificial Intelligence and Expert Systems
CALL FOR PAPERS
Charleston, South Carolina, U.S.A.
July 15-18, 1990
Aims and Scope:
==============
This conference continues its tradition of emphasizing applications
of artificial intelligence and expert/knowledge-based systems to
engineering and industrial problems. Also of interest are
the AI technology and research supporting such applications.
Topics of interest include, but are not limited to:
Pattern Recognition Knowledge Representation
Vision Knowledge Acquisition
Sensor Fusion Machine Learning
Computer Aided Manufacturing Natural Language Processing
Computer Aided Design Neural Networks
Robotics Intelligent Tutoring
Planning/Scheduling Reasoning under Uncertainty
Diagnostic Systems Distributed and Parallel Architectures
Intelligent Interfaces Qualitative Models
Intelligent Databases Blackboard Systems
Autonomous Systems Industrial Expert Systems
Papers:
======
Please submit by December 1, 1989, four copies of an extended
abstract (4-6 double spaced pages) to the Program Chair at the
address below. All abstracts will be refereed by at least two
members of the program committee. Authors will be notified of
acceptance by February 1, 1990 and final copies of complete pa-
pers will be due April 1, 1990.
Program Chair: General Chair:
Dr. Manton M. Matthews Dr. Moonis Ali
Department of Computer Science MS 15
University of South Carolina University of Tennessee Space Institute
Columbia, SC 29208 Tullahoma, TN 37388
phone: (803)777-3285 phone: (615)455-0631, ext. 236
CSNET: [email protected]
Sponsors:
========
Association for Computing Machinery/SIGART
The University of South Carolina
The University of Tennessee Space Institute (UTSI)
In Cooperation with:
===================
American Association for Artificial Intelligence
Canadian Society for Computational Studies of Intelligence
IEEE Computer Society
International Association of Knowledge Engineers
International Center for the Applications of Information Technology
International Neural Networks Society
Proceedings:
===========
The proceedings will be published by ACM and will be available at the
conference. A few copies of the proceedings of earlier conferences are
available by contacting Nancy Wise at (615)455-0631 ext. 236.
Program Co-Chairs:
=================
Jaime Carbonell, Carnegie-Mellon University
Paul Chung, AIAI, Edinburgh, UK
Michael Magee, University of Wyoming
Other Officers:
==============
Local Chair: Marco Valtorta, University of South Carolina
Tutorial Chair: Gautam Biswas, Vanderbilt University
Exhibits Chair: Jeffrey Dawson, Digital Equipment Corporation
Registration Chair: Sandy Shankle, University of Tennessee Space Institute
Publicity Chair: S.C. Lee, University of Tennessee Space Institute
Program Committee:
=================
Fevzi Belli, University of Paderborn, Federal Republic of Germany
James Bezdek, Boeing Aerospace
Gautam Biswas, Vanderbilt University
John Bourne, Vanderbilt University
Bruce Buchanan, University of Pittsburg
Thomas Bylander, Ohio State University
A. Costes, LAAS-CNRS, France
Graham Forsyth, DSTO Aeronautical, Australia
Toshio Fukuda, University of Tokio, Japan
Edward Grant, Turing Institute, UK
Uwe Haass, ESPRIT, Belgium
William A. Hoff, Martin Marietta Astronautics
Michael Huhns, MCC
Robert Inder, AIAI, Edinburgh, UK
Kazuhiko Kawamura, Vanderbilt University
Roy Leitch, Heriot-Watt University, UK
Jonathan Litt, Army Louis Research Center
Richard Mansfield, Journal of Expert Systems
L.P. McNamee, UCLA
Walter Merrill, NASA Lewis
Sanjai Mittal, Xerox Corporation
John Mitchiner, Sandia Labs
Bernard Moulin, Laval University, Canada
Penny Nii, Stanford University
A.M. Norman, Rockwell International
Francois Pin, Oak Ridge National Labs
David Plaisted, UNC-Chapel Hill
Don Potter, University of Georgia
John Roach, Virginia Tech University
Carol Russo, GE Aircraft
Erik Sandewall, Linkoping University, Sweden
Wolfgang Schoenfeld, IBM Heidelberg, Federal Republic of Germany
Paul Schutte, NASA Langley
Donald Steiner, MCC
Greg Switek, NASA
Marco Valtorta, University of South Carolina
Bruce Whitehead, UTSI
Venue and date:
==============
The conference will take place at the Mills House Hotel in historic downtown
Charleston, South Carolina, U.S.A., on July 15-18, 1989.
------------------------------
To: [email protected]
Date: Wed, 11 Oct 89 13:19:20 BST
>From: Alan Bundy <bundy%[email protected]>
Subject: RA Post in AI Dept at Edinburgh
Department of Artificial Intelligence
University of Edinburgh
RESEARCH FELLOW
(Mathematical Reasoning)
Applications are invited for an SERC supported post, tenable from 1st
January 1990, or on a mutually agreed date. Appointment will be to
September 30th 1991, initially, but with a possibility of renewal.
The research is to develop proof plans, a technique for guiding the
search for a proof in automatic theorem proving. The main application
is to the automatic synthesis, verification and transformation of
logic programs using constructive logic. The project is led by
Professor Alan Bundy and Dr Alan Smaill.
Candidates should possess a PhD or have equivalent research or
industrial experience. Knowledge of logic is essential and knowledge
of artificial intelligence, formal methods in software engineering or
logic programming would be an advantage. Salary is on the AR1A scale
in the range 10,458-16,665 pounds p.a., according to age,
qualifications and experience.
Applicants should send a CV and the names of two referees to:
Prof. Alan Bundy.
Department of Artificial Intelligence,
University of Edinburgh,
80 South Bridge,
Edinburgh,
EH1 1HN.
as soon as possible. The closing date for applications
is 14th November
1990. Further details may be obtained from Prof. Bundy (at the above
address or email to [email protected] or [email protected])
quoting reference number 5717/E.
------------------------------
To: [email protected]
>From: [email protected] (Roberto Desimone)
Newsgroups: comp.ai,sci.space
Subject: HMI/AI in aeronatics and space conference
Date: 6 Oct 89 15:16:31 GMT
Reply-To: [email protected] (Roberto Desimone)
Organization: AIAI, University of Edinburgh, Scotland
3rd INTERNATIONAL CONFERENCE
HUMAN MACHINE INTERACTION
AND ARTIFICIAL INTELLIGENCE
IN AERONAUTICS AND SPACE
ODYSSUD
Toulouse - Blagnac
France
26 - 28 September 1990
Conference Objectives
This conference is aimed at promoting an international cooperation between
representatives of industry, academia and government, with particular
reference to Aeronautics and Space applications.
As with the two previous conferences held in Toulouse, France in 1986 and
1988, the objectives are:
- Examine-of-the-art Human Machine Interaction and AI research,
- Highlight the achievements over the past two years,
- Evaluate these aplications which are now operational and in commercial
service.
Topics
A) Fundamental Topics:
-Knowledge Representation,
-Knowledge Acquisition, Machine Learning,
-Reasoning Modeling and Explanation,
-Planning, Schedulinbg,
-Real-Time Reasoning
-Human Factors,
-Interface Languages.
B) Application Domains:
- Specification and Design,
- Production Management,
- Maintenance, Diagnosis and Control,
- Operator Assistance,
- Mission Planning and Monitoring,
- Education and Training
Tutorials
Half-day tutorials on the basic concepts of AI and HMI will be held before
the conference providing that a minimum of 10 participants register for each
tutorial.
Two tutorials are proposed:
1. Introduction to AI and to Operatorn Assistant Systems,
2. Cognitive Engineering
Any suggestions for additional subjects will be welcomed and if suitable will
be included.
Important Dates
Deadline for submitted papers: November 15, 1989
Notification of acceptance and mailing of recommendations to authors:
February 1, 1990
Full papers due: June 15, 1990
Papers submitted must be written in English.
Fees - 3,000 FF for conference and 1,200 FF for each tutorial.
Please send papers and enquiries to the Conference Secretariat at
G.Picchi Telephone: 61 55 70 01
CERT Telex: 521596F
B.P. 4025 Fax: 61 55 71 72
31055 Toulouse Cedex
France
===========================================================
Roberto Desimone JANET: [email protected]
KB Planning Group (KBPG) ARPA: r.desimone%[email protected]
AI Applications Institute,
Edinburgh EH1 1HN, Scotland Tel: +44 31 225-4464 Fax: +44 31 226-2730
------------------------------
To: [email protected]
Subject: BBN AI Seminar
>From: "Damaris M. Ayuso" <[email protected]>
Reply-To: [email protected]
Date: Tue, 24 Oct 89 10:21:45 EDT
BBN STC Science Development Program
AI Seminar Series Lecture
USING GENETIC ALGORITHMS TO STUDY THE EVOLUTION OF
COOPERATIVE BEHAVIOR
STEPHANIE FORREST
Center for Nonlinear Studies
Los Alamos National Laboratory
steph%[email protected]
BBN STC, 2nd floor large conference room
10 Moulton St, Cambridge MA, 02138
Tuesday October 31st, 10:30 AM
I am interested in understanding how cooperative behavior can arise
in populations of automonous self-interested agents in which there
is no central authority. Such an understanding could contribute
both to the design of distributed computational systems and to models
of social interactions, for example, international relations.
The talk will review previous work in two areas: (1) using genetic
algorithms to play the iterated Prisoner's Dilemma game, and (2) using
nonlinear dynamical equations to predict the long term effect of
various strategic policies on global stability. Recently, we have
developed a model that combines elements from both of the previous
approaches. Preliminary results obtained from the model will be
presented, and several planned extensions will be discussed.
------------------------------
To: [email protected]
Date: Thu, 26 Oct 89 15:46:58 EDT
>From: "Sherman Alpert" <[email protected]>
Subject: CFP with REVISED SUBMISSION DATE
C A L L F O R P A P E R S
Call for Papers and Referees
Object-Oriented Programming in AI
====> NOTE CHANGE IN DEADLINE FOR PAPERS! <====
'Object-Oriented Programming in AI' has been selected as a track which
will appear in IEEE Expert in 1990. (A 'track' is Expert's version of a
theme issue; however, rather than have all track-related papers appear
in one issue, they are spread out over several issues.) Manuscripts are
solicited for this track. Also sought are individuals interested in
serving as referees for papers submitted for the track. Manuscript
submissions should address the use of object-oriented programming (OOP)
in AI systems and applications. Prospective referees should send a note
to the contact below indicating their technical interests and
qualifications.
Some goals of the OOP in AI track are that readers come away with a
broader sense of how researchers and system developers are applying OOP
in AI applications, where and why OOP is beneficial to AI system build-
ers (and where and why it is not), and how more traditional AI ap-
proaches (rules, logic programming, etc.) may be integrated with OOP.
The potential topics include, but are not limited to:
o knowledge representation, including:
- comparison of objects and frames
- comparison of OOP inheritance to other models of representation-
sharing
o integrating multiple paradigms: e.g., the use of objects to inte-
grate rules, logic, and procedural knowledge
o cooperating, intelligent agents (and the relationship of OOP to Dis-
tributed AI)
o specific application areas, such as
- model-based reasoning
- constraint propagation
- intelligent simulation
- natural language processing
- other knowledge-based applications.
The guest editors for this track are:
Sherman Alpert, IBM T.J. Watson Research Center
Lloyd Arrowood, Oak Ridge National Laboratory
Howard Shrobe, Symbolics, Inc.
Scott Woyak, EDS Research and Development
An abstract should be submitted as soon as possible (e-mail or fax would
work well here). Full manuscripts should be 15 to 30 one-sided, double-
spaced pages. IEEE Expert prefers shorter papers; superfluous refer-
ences are also to be avoided. Manuscripts will be reviewed by at least
3 referees. Four copies of the full manuscript should be submitted by
February 1, 1990 to:
- ---------------
Sherman Alpert
IBM T.J. Watson Research Center
PO Box 704
Yorktown Heights, NY 10598
(914) 789-7736
FAX: (914) 789-7279
ALPERT @ IBM.COM
------------------------------
To: [email protected]
>From: [email protected] (J. Daniel Smith)
Newsgroups: comp.ai,comp.lang.c,comp.lang.pascal
Subject: ATN written in C or Pascal
Keywords: ATN, C, Pascal, AI, Programming
Date: 31 Oct 89 17:22:47 GMT
Reply-To: [email protected] (J. Daniel Smith)
Organization: Michigan State University, Computer Science Department
Does anyone know where I might be able to find ATN (Augmented
Transition Network) code in either Pascal or C?
Programs or references would be great!
Please respond via EMAIL since I don't read [all] of these groups.
Thanks,
Dan
=========================================================================
J. Daniel Smith Internet: [email protected]
Michigan State University BITNET: smithdan@msuegr
Usenet: uunet!frith!smithda
Wenn die Katze aus dem Haus ist, tanzen die Maeuse.
(When the cat's away, the mice will play.)
=========================================================================
------------------------------
To: [email protected]
>From: john@bcsaic (John Boose)
Newsgroups: news.announce.conferences,comp.ai
Subject: CFP 1990 European Knowledge Acquisition Workshop
Date: 30 Oct 89 01:00:19 GMT
Organization: Boeing Computer Services ATC, Seattle
CALL FOR PAPERS
4th European Knowledge Acquisition for Knowledge-Based
Systems Workshop
EKAW-90
Amsterdam, The Netherlands
June 25-29, 1990
EKAW
The EKAW is concerned with the research on acquisition of knowledge for
practical knowledge-based systems. The workshop will be in two parts: a
one day open meeting with key note presentations, and a three-and-a-half
day closed workshop. The closed workshop will be limited to 40
participants, one author for each paper accepted. Papers are invited
for consideration on all aspects of knowledge acquisition for
knowledge-based systems: including (but not restricted to):
* Elicitation/modeling of expertise - systems that obtain and model
knowledge from experts.
* Elicitation/modeling of expertise - manual knowledge acquisition
methods and techniques.
* Apprenticeship, explanation-based, and other learning systems;
integration of such systems with other knowledge acquisition techniques.
* Issues in cognition and expertise that affect the knowledge
acquisition process.
* Extracting and modeling of knowledge from text.
* Integration of knowledge acquisition techniques within a single
system; integration of knowledge acquisition systems with other systems
(hypermedia, database management systems, simulators, spreadsheets).
* Knowledge acquisition methodology and training.
* Validation of knowledge acquisition techniques; the role of knowledge
acquisition techniques in validating knowledge-based systems.
SUBMISSION OF PAPERS
Five copies of a full-length draft paper (up to 20 pages) should be sent
to Bob Wielinga (see address below) before February 26th, 1990.
Acceptance notices will be mailed by April 16th. Camera-ready copies
should be returned before May 14th. The proceedings will be distributed
at the workshop.
WORKSHOP CO-CHAIRMEN
Bob Wielinga
Social Science Informatics,
University of Amsterdam,
Herengracht 196, 1016 BS Amsterdam,
The Netherlands,
Tel: +31 20 525 2160/2073
E-mail: [email protected]
(will change to [email protected])
John Boose
Advanced Technology Center
Boeing Computer Services, 7L-64
PO Box 24346
Seattle, Washington, USA 98124,
Tel: (206) 865-3253
E-mail: [email protected]
Brian Gaines
Department of Computer Science
University of Calgary
2500 University Dr. NW
Calgary, Alberta, Canada T2N 1N4,
Tel: (403) 220-5901
E-mail: [email protected]
PROGRAM COMMITTEE
Tom Addis, University of Reading
Guy Boy, Centre d'Etudes et de Recherche de Toulouse
Jeffrey Bradshaw, Boeing Computer Services
Jean Gabriel Ganascia, Universite Paris-Sud
Yves Kodratoff, Universite Paris-Sud
Marc Linster, GMD, St Augustin
John McDermott, Digital Equipment Corporation
Ryszard Michalski, George Mason University
Katharina Morik, GMD, St Augustin
Nigel Shadbolt, University of Nottingham
Mildred Shaw, University of Calgary
Guus Schreiber, University of Amsterdam
Maarten van Someren, University of Ansterdam
- -
Good health is merely the slowest rate at which one can die.
------------------------------
End of NL-KR Digest
*******************
|
| 125.14 | NL-KR Digest V6.39 | HERON::ROACH | TANSTAAFL ! | Wed Nov 29 1989 15:40 | 658 |
| Printed by: Pat Roach Document Number: 009303
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 28-Nov-1989 03:36pm CET
From: AI_INFO
AI_INFO@AIVTX@HERON@MRGATE@VALMTS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V6.39
NL-KR Digest (Tue Oct 3 11:39:15 1989) Volume 6 No. 39
Today's Topics:
morphological analyzer for English
Help on Discourse and Anaphora Rep.
Abstracts from Third JETAI
7th Intl Conference on Machine Learning
Biotech/AI Seminar 10/3/89
Announcement: Knowledge Acquisition WS
Speech Act Interpretation: ...(Unisys AI Seminar)
CSLI Calendar, 28 September 1989, vol. 5:2
Submissions: [email protected]
Requests, policy: [email protected]
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.
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: [email protected]
Date: Thu, 28 Sep 89 16:38 EST
>From: [email protected]
Subject: morphological analyzer for English
Professor Choueka recently asked about the availability of morphological
analyzers for English. There is one that is part of the Alvey toolkit,
which also includes a GPSG parser, grammar, and lexicon. The toolkit
is written in Common Lisp and costs 500 pounds for academic use. The
following article describes the morphology component:
Ritchie G., Pulman S., Black A., and Russell G., ``A Computational
Framework for Lexical Description'', Computational Linguistics,
Vol. 13, No. 3-4, 1987
You can obtain more information and an application form by writing to:
Artificial Intelligence Applications Institute
University of Edinburgh
80 South Bridge
Edinburgh EH1 1HN
U.K.
ph. 44-031-225 4464
-bob
[email protected]
------------------------------
To: [email protected]
Date: Thu, 21 Sep 89 10:16:33 -0500
>From: [email protected] (gkp)
Subject: Help on Discourse and Anaphora Rep.
I am going to write my Master's thesis about discourse representation and
anaphora resolution, with emphasis on the point that the former is a
prerequisite for the latter. My plan is to implement a kind of experimental
"discourse workbench" that maintains syntactic and semantic information,
focus sets, co-reference constraints, etc. - If there is time left afterwards,
I shall move to the actual process of anaphora resolution, using a blackboard
approach with hypotheses of antecedent assignments that are to be evaluated
against each other. So far my ambitions...
In case anybody is working in this or a related area, or has heard about
somebody else working on it - I am grateful for every hint, since I would
not like to ponder questions that have already been answered elsewhere.
/| /|
/ | / |anfred Stede, [email protected]
/ |/ |
------------------------------
To: [email protected]
>From: [email protected]
Date: Sat, 30 Sep 89 15:39:02 MDT
Subject: Abstracts from Third JETAI
The following are abstracts of papers appearing in the third issue
of the Journal of Experimental and Theoretical Artificial
Intelligence, to appear in April, 1989.
For submission information, please contact either of the editors:
Eric Dietrich Chris Fields
PACSS - Department of Philosophy Box 30001/3CRL
SUNY Binghamton New Mexico State University
Binghamton, NY 13901 Las Cruces, NM 88003-0001
[email protected] [email protected]
JETAI is published by Taylor & Francis, Ltd., London, New York, Philadelphia
_________________________________________________________________________
Consequences of nonclassical measurement for the algorithmic
description of continuous dynamical systems.
Chris Fields, Computing Research Lab, New Mexico State University, Las
Cruces, NM 88003-0001, USA
Continuous dynamical systems intuitively seem capable of more complex
behavior than discrete systems. If analyzed in the framework of the
traditional theory of computation, a continuous dynamical system with
countably many quasistable states has at least the computational power
of a universal Turing machine. Such an analysis assumes, however, the
classical notion of measurement. If measurement is viewed
nonclassically, a continuous dynamical system cannot, even in
principle, exhibit behavior that cannot be simulated by a universal
Turing machine.
__________________________________________________________________________
Principles of continuous analogical reasoning.
Thomas Eskridge, Computing Research Laboratory, New Mexico State
University, Las Cruces, NM 88003-0001, USA
This paper presents evidence supporting the view of analogical
reasoning as a continuous process. The phrase continuous analogical
reasoning refers to the continuous flow of information between the
three stages in analogical reasoning: selection, mapping, and
evaluation. This paper presents the motivations behind the
development of the continuous analogical reasoning approach, along
with evidence of the interactions between stages from the
psychological community. Implications for discrete analogical
reasoning systems are discussed. The implementation of a continuous
analogical reasoning system called ASTRA is presented and discussed in
terms of the interactions between the stages.
_________________________________________________________________________
Philosophical issues in Edelman's neural darwinism
R. J. Nelson, Department of Philosophy, Gerald Edelman's Neural
Darwinism advances an hypothesis that the brain develops
epigenetically in the individual according to principles of natural
selection operating over populations of neuronal groups. The central
idea is that the organism does not adapt to a pre-categorized world,
but generates categories (for instance for visual recognition) that
have survival value. Hence, it is argued, brain process-development
cannot be modeled by instructionist - program-driven sequential
processes - methods. AI must therefore fail in principle in
attempting to explain cognitive processes.
The alternative is the parallel, distributed processing model, which
must be subject to evolutional change and devoid of precategorization
or based on assumptions of a pre-labelled world.
In the present paper I argue that computational models are not limited
to sequential programs, but that embodied algorithms as are realized
in hardware and probably in neural circuits do afford adequate models.
Thus there is no principled reason for adoption of nondigital models,
although Edelman is right about conventional AI, which uses free
sequential algorithms.
I conclude by remarking that semantical and intentional properties of
the mind/brain cannot be modeled by the type of parallel connectionist
system that Edelman advocates, but requires computational (recursive)
models.
________________________________________________________________________
OSCAR: A general theory of rationality.
John Pollack, Department of Philosophy, University of Arizona, Tucson,
AZ 85721 USA
The enterprise is the construction of a general theory of rationality,
and its implementation in an automated reasoning system called OSCAR.
The paper describes a general architecture for rational thought. This
includes both theoretical reasoning and practical reasoning, and
builds in important interconnections between them. It is urged that a
sophisticated reasoner must be an introspective reasoner, capable of
monitoring its own reasoning and reasoning about it. An introspective
reasoner is built on top of a nonintrospective reasoner that
represents the system's default reasoning strategies. The
introspective reasoner engeges in practical reasoning about reasoning
in order to override these default strategies. The paper concludes
with a discussion of some aspects of the default reasoner, including
the manner in which reasoning is interest driven, and the structure of
defeasible reasoning.
________________________________________________________________________
The a priori meaningfulness measure and resolution theorem proving.
Joseph Fulda* and Kevin De Fontes**, *Department of Biomathematical
Sciences, Mount Sinai School of Medicine, New York, NY 10029, USA;
**Hofstra University, New York, USA
(No abstract available)
__________________________________________________________________________
------------------------------
To: [email protected]
>From: [email protected] (B. Porter and R. Mooney)
Date: Thu, 21 Sep 89 13:45:37 CDT
Subject: 7th Intl Conference on Machine Learning
SEVENTH INTERNATIONAL CONFERENCE ON MACHINE
LEARNING: CALL FOR PAPERS
The Seventh International Conference on Machine Learning will be
held at the University of Texas in Austin during June 21--23,
1990. Its goal is to bring together researchers from all
areas of machine learning. The conference will include
presentations of refereed papers, invited talks, and poster
sessions. The deadline for submitting papers is February 1,
1990.
REVIEW CRITERIA
In order to ensure high quality papers, each submission will
be reviewed by two members of the program committee and
judged on clarity, significance, and originality. All sub-
missions should contain new work, new results, or major extensions
to prior work. If the paper describes a running system, it
should explain that system's representation of inputs and outputs,
its performance component, its learning methods, and its evalua-
tion. In addition to reporting advances in current areas of
machine learning, authors are encouraged to report results on
exploring novel learning tasks.
SUBMISSION OF PAPERS
Each paper must have a cover page with the title, author's
names, primary author's address and telephone number, and an
abstract of about 200 words. The cover page should also give
three keywords that describe the research. Examples of keywords
include:
PROBLEM AREA GENERAL APPROACH EVALUATION CRITERIA
Concept learning Genetic algorithms Empirical evaluation
Learning and planning Empirical methods Theoretical analysis
Language learning Explanation-based Psychological validity
Learning and design Connectionist
Machine discovery Analogical reasoning
Papers are limited to 12 double-spaced pages (including figures
and references), formatted with twelve point font. Authors
will be notified of acceptance by Friday, March 23, 1990 and
camera-ready copy is due by April 23, 1990.
Send papers (3 copies) to: For information, please contact:
Machine Learning Conference Bruce Porter or Raymond Mooney
Department of Computer Sciences [email protected]
Taylor Hall 2.124 (512) 471-7316
University of Texas at Austin
Austin, Texas 78712-1188
------------------------------
To: [email protected]
Date: Mon, 2 Oct 89 9:59:07 EDT
>From: Fran Lewitter <[email protected]>
Subject: Biotech/AI Seminar 10/3/89
**** NOTE ROOM CHANGE ****
Joint Biotechnology and
Artificial Intelligence
Seminar Series
BBN Laboratories
Science Development Program
Topic: PRODIGY: An Integrated Reasoning Architecture
Speaker: Jaime Carbonell, Ph.D.
Department of Computer Science
Carnegie Mellon University
and member of the NIH Genome Advisory Committee
Location: Conference Center, Room F
10 Fawcett Street, Cambridge
Date & Time: Tuesday October 3, 1989 - 3 pm
Abstract: Integrated reasoning architectures are the major intellectual focus
of Artificial Intelligence research at Carnegie Mellon University, with
Newell's SOAR, Mitchell's THEO, Carbonell's PRODIGY, and VanLehn's TETON. The
presentation focuses on the PRODIGY architecture and its component parts: the
universal problem solver, the explanation-based learning method, the
abstraction learner for hierarchical planning, the derivational analogy
case-builder, and the experimentation module. Examples are drawn from several
application domains, such as machine-shop scheduling, robotic planning and
specialized domains such as telescope making. It is argued that PRODIGY can
provide a flexible substrate for the next generation of knowledge-based systems
in planning-intensive tasks. If time permits, the presentation will address
implementation issues, such as fast matching algorithms for large knowledge
bases, and the utility of this technology beyond PRODIGY (e.g. to aspects of
bibliographic matching, and human-genome sequence matching).
------------------------------
To: [email protected]
>From: [email protected] (Jim Brule)
Newsgroups: comp.ai
Subject: Announcement: Knowledge Acquisition WS
Keywords: Knowledge Acquisition, Expert Systems
Date: 26 Sep 89 21:28:28 GMT
Reply-To: [email protected] (Jim Brule)
Strategies for Knowledge Acquisition
1990 Winter Workshop
January 22 - 25, 1990
Minnowbrook Conference Center
Blue Mountain Lake, NY
Sponsored by:
Coherent Research, Inc.
and
New York State Center for Advanced
Technology in Computer Applications and
Software Engineering at Syracuse University
Syracuse, NY
"Strategies for Knowledge Acquisition" is a workshop
designed to give the knowledge engineer a pragmatic
understanding of the problems of knowledge engineering,
along with the tools and techniques for their solution.
This hands-on workshop presents a theoretic framework
based on the cybernetics of human interaction within
which the knowledge acquisition relationship can be
understood and predicted. It then proceeds to deliver
practical methods for meeting the everyday concerns of
knowledge engineers:
* establishing a productive environment for knowledge
acquisition
* enhancing the opportunities for uncovering knowledge
of which the domain expert is not fully aware
* generating the richest set of information possible
* dealing with contradictory information
* translating the acquired knowledge into a useful form
* creating the best organizational chances for the
project to succeed
In order to provide the greatest potential benefit, the
workshop incorporates individual practice of the tools,
techniques, and concepts presented. Upon completion, the
student will have gained an understanding of both the
principles underlying knowledge acquisition and the
practical tools and techniques required to apply these
principles to the building of expert systems in
operational applications.
Attendees should be individuals who have built, or are
preparing to build, expert systems involving knowledge
to be acquired from human experts. Other individuals who
are already familiar with the issues of expert systems
from an academic standpoint are encouraged to attend.
This workshop has been presented throughout the United
States and England. The instructors are experienced in
the problems of knowledge acquisition from a diverse set
of perspectives. Mr. Brule' has led the development of
successful expert systems many fields (including
medical, financial, and nursing care) using the
techniques which led to this workshop. Dr. Blount has
been applying the cybernetics of human systems to
organizations, groups, families, and individuals for
nearly a decade. Their text, "Knowledge Acquisition"
(McGraw-Hill, 1989), will be distributed as part of the
workshop.
Workshop Schedule:
=================
Monday Afternoon:
- ---------------
Introduction
The case for a Cybernetic/Psychological study of the
human expert
The Theory of Cybernetics
Cybernetics and Human Systems
Levels of Learning
Coding / Representation of Abstract Learning
Tuesday:
- ------
The Dynamics of the Knowledge Acquisition Relationship
Fundamentals
Establishing a Productive Context
Pitfalls in Interviewing Experts
Practical Techniques
Practice
Assessment
Metaphor
Relevance of Metaphor to Knowledge Acquisition
Metaphor in non-Poetic Discourse
Metaphor in Building the Knowledge Acquisition
Relationship
Metaphor in Hypothesis Generation
Practical Techniques
Practice
Assessment
Wednesday:
- --------
Organization of the Knowledge Acquisition Session
Planning
Orientation
Development of Structure
Elicitation of Specifics
Practice
Assessment
Special Concerns
The Value of Conflicting Information
The Use of Multiple Experts
Validation and Verification
Tools & Techniques
Practice
Assessment
Integration
The Knowledge Template
The Knowledge Acquisition Team
The Organizational Context of Knowledge Acquisition
Tools & Techniques
Practice
Assessment
Thursday Morning:
- ---------------
Summary
Practical Applications
Future Directions
=================
Accomodations and Travel
The Minnowbrook Conference Center is one of the elegant
Adirondack "Camps" located on Blue Mountain Lake in the
high-peaks region of the Adirondack Mountains. Recently
renovated, the main lodge offers year-round services in
a relaxed setting with modern amenities. Winter sports
opportunities abound nearby, including downhill and
cross-country skiing,and exhilirating hikes through the
mountainous region. Minnowbrook itself has a recreation
center, which is made exclusively available to workshop
attendees. Ample opportunities for relaxing and
establishing cameraderie are provided in the schedule.
All meals, lodging, and workshop materials are included
in the fee. Minnowbrook is best reached through Syracuse
Airport, from where ground transportation to Blue
Mountain Lake can be easily arranged.
=================
Registration Form
Name:
Title:
Organization:
Address:
City/State/Zip:
Phone:
EMail:
Fees:
Until After
11/1/89 11/1/89
$650 $750
(Includes meals, lodging, and all workshop materials).
Please make check payable to:
Coherent Research, inc.
Return payment and form to:
Strategies for Knowledge Acquisition
Coherent Research, Inc.
100 East Washington Street
Syracuse, NY 13202
(315) 426-0929
[email protected]
------------------------------
To: [email protected]
Date: Mon, 2 Oct 89 23:00:35 -0400
>From: [email protected]
Subject: Speech Act Interpretation: ...(Unisys AI Seminar)
AI SEMINAR
UNISYS PAOLI RESEARCH CENTER
Speech Act Interpretation:
Linguistic Structure meets Knowledge Representation
James F. Allen
University of Rochester
One of the crucial problems facing natural language research is the
interpretation of language in context. This requires not only
sophisticated systems to analyze the underlying structure of language,
but also the representation of general knowledge about the world, and
the modelling of natural inference processes. In this talk I will look
at one particular problem that requires both structural constraints
and inference in order to identify the correct interpretation, namely
the identification of the intentions of the speaker. This area of
research often falls under the heading of indirect speech act
recognition. I will argue, however, that the distinction between
literal speech acts and indirect speech acts is impossible to make,
since both notions depend critically on contextual interpretation. I
will then describe a system that uses syntactic and semantic clues to
the speech act as well as inferential processes embodying the context,
to produce a range of acceptable interpretations.
11:00am October 6
BIC Conference Room
Unisys Paoli Research Center
Route 252 and Central Ave.
Paoli PA 19311
-- non-Unisys visitors who are interested in attending should --
-- send email to [email protected] or call 215-648-7446 --
------------------------------
To: [email protected]
Date: Wed, 27 Sep 89 16:43:15 PDT
>From: [email protected] (Ingrid Deiwiks)
Subject: CSLI Calendar, 28 September 1989, vol. 5:2
C S L I C A L E N D A R O F P U B L I C E V E N T S
_____________________________________________________________________________
28 September 1989 Stanford Vol. 5, No. 2
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 28 SEPTEMBER 1989
12:00 noon TINLunch
Cordura 100 Document Image Analysis by Tree Structure Model
Y. Nishimura, T. Takahashi, and Y. Kobayashi
ATR Communication Systems Research Laboratories
([email protected])
Abstract in last week's Calendar
2:15 p.m. CSLI Seminar
Cordura 100 Models of Rational Agency
First meeting
Michael Bratman, Martha Pollack, Stan Rosenschein
([email protected],
[email protected], [email protected])
Abstract in last week's Calendar
CSLI ACTIVITIES FOR NEXT THURSDAY, 5 OCTOBER 1989
12:00 noon TINLunch
Cordura 100 Logical Form and the Identity of Events
Stephen Neale
Visiting Scholar, Princeton University
([email protected])
Abstract in next week's Calendar
2:15 p.m. CSLI Seminar
Cordura 100 Models of Rational Agency 2
Michael Bratman, Martha Pollack, Stan Rosenschein
([email protected],
[email protected], [email protected])
Abstract below
3:30 p.m. Tea
Cordura 117 There will be a beginning-of-the-quarter tea
(second lounge) so that new visitors and students may meet "old"
CSLI-ites.
____________
ANNOUNCEMENT
This fall, the STASS Seminar will be oriented towards introducing
people to post-SITUATIONS AND ATTITUDES developments in situation
theory, and nonlinguistic applications thereof. Meetings will be held
(some) Tuesdays, 3:15-5:05, starting 3 October, in Cordura 100. Those
who plan to attend the meetings should get a copy of THE SITUATION IN
LOGIC, by Jon Barwise, available at the Stanford Bookstore and other
bookstores. Related class: Linguistics 223, "Topics in Semantics,"
Nerbonne and Halvorsen, TTh 1:15-2:45, e229.
____________
NEXT WEEK'S CSLI SEMINAR
Models of Rational Agency 2
Michael Bratman, Martha Pollack, Stan Rosenschein
We will discuss a model of practical reasoning that is intended to
provide part of an answer to the challenge of resource limitations.
In this model, the mental attitudes of belief and desire are not seen
as sufficient for explaining rational behavior: instead, intentions
and plans play a central role.
------------
STASS SEMINAR
Organizational and Introductory Remarks
David Israel and John Perry
Tuesday, 3 October 1989, 3:15-5:05
Cordura 100
This is an organizational meeting. Attendees should bring their copy
of Barwise's THE SITUATION IN LOGIC.
------------------------------
End of NL-KR Digest
*******************
|
| 125.15 | NL-KR Digest V6.44 | HERON::ROACH | TANSTAAFL ! | Wed Nov 29 1989 15:42 | 680 |
| Printed by: Pat Roach Document Number: 009311
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 28-Nov-1989 05:13pm CET
From: AI_INFO
AI_INFO@AIVTX@HERON@MRGATE@VALMTS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V6.44
NL-KR Digest (Tue Nov 21 16:40:23 1989) Volume 6 No. 44
Today's Topics:
Second Conference on Situation Theory and its Applications: CFP
Pragmatics in AI conference CFP
New KIT-Reports from TU Berlin (Abstracts)
RA Job -- Chart Parsing + Syntax Correction ...
What is a Symbol System?
Re: What is a Symbol System?
Special talk by Hector Levesque
Submissions: [email protected]
Requests, policy: [email protected]
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.
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: [email protected]
>From: STA II 1990 <stass90%[email protected]>
Reply-To: stass90%[email protected]
Subject: Second Conference on Situation Theory and its Applications: CFP
Date: Thu, 09 Nov 89 17:49:59 +0000
CALL FOR PAPERS
***************
Second Conference
on
Situation Theory and its Applications
Kinloch Rannoch, Scotland, UK
September 13-16, 1990
Venue
The second Conference on Situation Theory and its Applications will be
held between the 13th and 16th September 1990. It will be held at the
secluded Loch Rannoch Hotel on the shores of Loch Rannoch in the heart
of the Scottish Highlands. Lodging for 50 participants is available
there on a first-come, first-served basis, but with speakers being
given assured accommodations. Some financial assistance is available
to help cover the cost and accommodations of speakers.
Call for Papers
The Program Committee welcomes theoretical and computational
contributions in at least the following areas:
* Logical and Philosophical foundations of Situation Theory
* Application to the analysis of Natural and Artificial languages
* Inference
* Applications to Information Theory
* Mathematical tools
* Critical papers and papers on other topics are also welcome.
Speakers will be selected by the program committee on the basis of
``abstracts'' of 8 to 12 pages. Following the model of the first ST&A
Conference, talks will be 40 minutes in length, and will be held in
the morning and evenings, with afternoons free for discussions,
working groups, and walks around the Loch. Speakers are expected to
contribute their papers to a Conference Proceedings, with final papers
due two months after the conference.
Important Dates
Submission of Abstracts March 1 1990
Notification to authors May 1 1990
Submission to Proceedings November 16 1990
Program Committee
Jon Barwise Stanford University
Mark Gawron Simon Fraser University
Gordon Plotkin Edinburgh University
Syun Tutiya Chiba University
Abstracts (preferably by e-mail in LaTeX) to:
STASS
CSLI
Ventura Hall
Stanford, CA. 94305
USA
E-mail: [email protected].
Fax No: +1 (415) 723 0758
Accommodation and Local Inquiries to:
Situation Theory Conference
HCRC
4 Buccleuch Place
Edinburgh EH8 9LW
UK
E-mail: [email protected].
Fax No: +44 (0)31 662 4912
------------------------------
To: [email protected]
>From: [email protected]
Date: Mon, 13 Nov 89 21:37:59 MST
Subject: Pragmatics in AI conference CFP
CALL FOR PAPERS
Pragmatics in Artificial Intelligence
5th Rocky Mountain Conference on Artificial Intelligence (RMCAI-90)
Las Cruces, New Mexico, USA, June 28-30, 1990
PRAGMATICS PROBLEM:
The problem of pragmatics in AI is one of developing theories, models,
and implementations of systems that make effective use of contextual
information to solve problems in changing environments.
CONFERENCE GOAL:
This conference will provide a forum for researchers from all
subfields of AI to discuss the problem of pragmatics in AI.
The implications that each area has for the others in tackling
this problem are of particular interest.
ACKNOWLEDGEMENTS:
In cooperation with:
Association for Computing Machinery (ACM) (pending approval)
Special Interest Group in Artificial Intelligence (SIGART) (pending approval)
U S WEST Advanced Technologies and the Rocky Mountain Society
for Artificial Intelligence (RMSAI)
With grants from:
Association for Computing Machinery (ACM)
Special Interest Group in Artificial Intelligence (SIGART)
U S WEST Advanced Technologies and the Rocky Mountain Society
for Artificial Intelligence (RMSAI)
THE LAND OF ENCHANTMENT:
Las Cruces, lies in THE LAND OF ENCHANTMENT (New Mexico),
USA and is situated in the Rio Grande Corridor with the scenic
Organ Mountains overlooking the city. The city is
close to Mexico, Carlsbad Caverns, and White Sands National Monument.
There are a number of Indian Reservations and Pueblos in the Land Of
Enchantment and the cultural and scenic cities of Taos and Santa Fe
lie to the north. New Mexico has an interesting mixture of Indian, Mexican
and Spanish culture. There is quite a variation of Mexican and New
Mexican food to be found here too.
GENERAL INFORMATION:
The Rocky Mountain Conference on Artificial Intelligence is a
major regional forum in the USA for scientific exchange and presentation
of AI research.
The conference emphasizes discussion and informal interaction
as well as presentations.
The conference encourages the presentation of completed research,
ongoing research, and preliminary investigations.
Researchers from both within and outside the region
are invited to participate.
Some travel awards will be available for qualified applicants.
FORMAT FOR PAPERS:
Submitted papers should be double spaced and no more than 5 pages
long. E-mail versions will not be accepted.
Send 3 copies of your paper to:
Paul Mc Kevitt,
Program Chairperson, RMCAI-90,
Computing Research Laboratory (CRL),
Dept. 3CRL, Box 30001,
New Mexico State University,
Las Cruces, NM 88003-0001, USA.
DEADLINES:
Paper submission: March 1st, 1990
Pre-registration: April 1st, 1990
Notice of acceptance: May 1st, 1990
Final papers due: June 1st, 1990
LOCAL ARRANGEMENTS:
Jennifer Griffiths, Local Arrangements Chairperson, RMCAI-90.
(same postal address as above).
INQUIRIES:
Inquiries regarding conference brochure and registration form
should be addressed to the Local Arrangements Chairperson.
Inquiries regarding the conference program should be addressed
to the program Chairperson.
Local Arrangements Chairperson: E-mail: INTERNET: [email protected]
Phone: (+ 1 505)-646-5466
Fax: (+ 1 505)-646-6218.
Program Chairperson: E-mail: INTERNET: [email protected]
Phone: (+ 1 505)-646-5109
Fax: (+ 1 505)-646-6218.
TOPICS OF INTEREST:
You are invited to submit a research paper addressing Pragmatics
in AI , with any of the following orientations:
Philosophy, Foundations and Methodology
Knowledge Representation
Neural Networks and Connectionism
Genetic Algorithms, Emergent Computation, Nonlinear Systems
Natural Language and Speech Understanding
Problem Solving, Planning, Reasoning
Machine Learning
Vision and Robotics
Applications
INVITED SPEAKERS:
The following researchers have agreed to speak at the
conference (a number of others have been invited):
Martin Casdagli, Los Alamos National Laboratory USA
(Dynamical systems, Artificial neural nets, Applications)
Arthur Cater, University College Dublin IRELAND
(Robust Parsing)
James Martin, University of Colorado at Boulder USA
(Metaphor and Context)
Derek Partridge, University of Exeter UK
(Connectionism, Learning)
Philip Stenton, Hewlett Packard UK
(Natural Language Interfaces)
PROGRAM COMMITTEE:
John Barnden, New Mexico State University
(Connectionism, Beliefs, Metaphor processing)
Hans Brunner, U S WEST Advanced Technologies
(Natural language interfaces, Dialogue interfaces)
Martin Casdagli, Los Alamos National Laboratory
(Dynamical systems, Artificial neural nets, Applications)
Mike Coombs, New Mexico State University
(Problem solving, Adaptive systems, Planning)
Thomas Eskridge, Lockheed Missile and Space Co.
(Analogy, Problem solving)
Chris Fields, New Mexico State University
(Neural networks, Nonlinear systems, Applications)
Roger Hartley, New Mexico State University
(Knowledge Representation, Planning, Problem Solving)
Paul Mc Kevitt, New Mexico State University
(Natural language interfaces, Dialogue modeling)
Joe Pfeiffer, New Mexico State University
(Computer Vision, Parallel architectures)
Keith Phillips, University of Colorado at Colorado Springs
(Computer vision, Mathematical modeling)
Yorick Wilks, New Mexico State University
(Natural language processing, Knowledge representation)
Scott Wolff, U S WEST Advanced Technologies
(Intelligent tutoring, User interface design, Cognitive modeling)
REGISTRATION:
Pre-Registration: Professionals $50.00; Students $30.00
(Pre-Registration cutoff date is April 1st 1990)
Registration: Professionals $70.00; Students $50.00
(Copied proof of student status is required).
Registration form (IN BLOCK CAPITALS).
Enclose payment (personal checks and Eurochecks accepted).
Send to the following address:
Jennifer Griffiths,
Local Arrangements Chairperson, RMCAI-90
Computing Research Laboratory
Dept. 3CRL, Box 30001, NMSU
Las Cruces, NM 88003-0001, USA.
Name:_______________________________ E-mail_____________________________
Phone__________________________
Affiliation: ____________________________________________________
Fax: ____________________________________________________
Address: ____________________________________________________
____________________________________________________
____________________________________________________
COUNTRY__________________________________________
Organizing Committee RMCAI-90:
Paul Mc Kevitt Yorick Wilks
Research Scientist Director
CRL CRL
cut------------------------------------------------------------------------
------------------------------
To: [email protected]
Date: Tue, 14 Nov 89 12:23:46 +0100
>From: "Christel Hecht (Secretary Projectgroup KIT)"
<CISKIT%[email protected]>
Subject: New KIT-Reports from TU Berlin (Abstracts)
NL-KR Digest
Subject: New KIT-Reports from TU Berlin - abstracts -
The following reports may be obtained free of charge from:
PROJECT GROUP KIT
Technische Universitaet Berlin
Fachbereich Informatik
Sekr. FR 5 - 12
Franklinstr. 28/29
D-1000 Berlin 10, West-Germany
<ciskit%[email protected]>
Christof Peltason, Albrecht Schmiedel, Carsten Kindermann, Joachim Quantz
"The BACK System Revisited"
KIT-Report no. 75, September 1989, 100 pages
The "Berlin
advanced computational knowledge representation system" BACK
has been developed as a KL-ONE-based hybrid reasoning system since 1985.
In this report the redesign and the implemention of the system
(in Prolog) are described.
The overall knowledge base language is sketched,
syntax and semantics are given, and the usage is illustrated by examples.
It is a step towards a uniform object description language for accessing
knowledge bases, combining intensional and
extensional aspects - and also taking into account
features known from typical database query languages.
The implementational issues of the recent development are sketched;
algorithms and data structures are presented,
efficiency aspects are discussed, and
the choices made between various implementational techniques are explained
The report is intended to serve not only as a platform for
discussion on the technical issues and extensions yet to come,
but also as a reference guide to the use of the
current system.
Stephan Busemann, Christa Hauenschild, Carla Umbach (eds.) \\
"Views of the Syntax/Semantics Interface"
KIT-Report no. 74, July 1989, 197 pages
Proceedings of the Workshop "GPSG and Semantics", organized by
the project KIT-FAST, TU Berlin, Feb. 22-24, 1989.
Most of the contributions are concerned with the syntax-semantics
interface, which is among the hot topics' of present-day research in
(computational) linguistics. The topic is discussed from many different
points of view, ranging from linguistic phenomena and their syntactic
and semantic aspects to representation formalisms and their special
properties.
Contents: Unbounded Dependencies in Machine Translation (Balari, Bel,
and Gilboy); From FAS Representations to GPSG Structures (Busemann and
Hauenschild); Features for Determination and Plurality for NPs (Grabski);
A Logical Approach to Grammar (Keller); Semantic Emphasis and Case Frames
(Kunze); Functor-Argument-Structures for the Meaning of NL Sentences and
Their Formal Interpretation (Mahr and Umbach); Generalized Categorial
Logic: Lambek-Gentzen Sequent Calculi (Moortgat); The Syntax-Semantics
Interface in a Unification-Based Phrase Structure Grammar (Pollard);
Spurious Ambiguities - On the Syntax-Semantics Relation in C(U)G
(Wesche).
Ruediger Oehlmann
"First European Summer School on Machine Learning"
KIT-Report no. 73, May 1989, 60 pages
The report contains the lectures given at the First
European Summer School on Machine Learning (ES2ML).
The meeting was held in Les Arcs, France, from 18th to 28th July,
1988.
Kai von Luck:
"Repraesentation Assertionalen Wissens im BACK-System
- Eine Fallstudie - "
KIT-Report no. 72, May 1989, 150 pages
This work is concerned with some problems of knowledge representation
within the framework of Artificial Intelligence. Particular emphasis
is placed on semantically well-founded formalisms and the algorithms
employed to interpret them. In the last years, hybrid systems as part of
the research in this field have found increasing attention.
Taking the form of a case study, the construction of a semantically
motivated hybrid formalism and the consequences for an implementation
of this formalism are discussed, and practical solutions are provided.
Special attention is directed to the problem of keeping the represented
parts of a domain consistent; inference procedures are specified for
mechanically computing implications of assertions entered into the
system.
Properties and possible weakness of the BACK-system - as a representative
of logic based hybrid systems for knowledge representation in general
- are discussed and potential applications of such systems are
demonstrated.
Werner Emde, Ingo Keller, Joerg-Uwe Kietz, Katharina Morik,
Sabine Thieme, Stefan Wrobel :
"Wissenserwerb und Maschinelles Lernen"
- Final Report of the KIT-LERNER Project -
KIT-Report no. 71, April 1989, 287 pages
Acknowledge-To: <CISKIT@DB0TUI11>
------------------------------
To: [email protected]
>From: Robert Dale <rda%[email protected]>
Date: Thu, 16 Nov 89 17:32:32 GMT
Subject: RA Job -- Chart Parsing + Syntax Correction ...
University of Edinburgh
Centre for Cognitive Science/Human Communication Research Centre
Research Assistant
Applications are invited for an SERC supported post, tenable from 1st
January 1990 or as soon as possible thereafter. The appointment, for
a three-year period, primarily involves the development of chart-based
syntax-checking mechanisms for use in a rule-based system which
detects and corrects errors in real text. The project, entitled The
Editor's Assistant, is concerned with the application of rule-based
techniques to real text for the interactive correction of errors,
ranging from low-level house style issues through to more complex
syntactic and elementary semantic errors. The project, which is
joint-funded by the SERC and the DTI under the IED programme, also
involves two industrial collaborators, who will contribute the rule
base mechanisms and a language-sensitive text editor.
Candidates should ideally possess an MSc or have equivalent research
or industrial experience. Knowledge of Common Lisp would be an
advantage, as would some exposure to natural language processing
techniques. Salary is on the RA1B scale, in the range
\pounds9816--12381, dependent upon age, qualifications and experience.
Registration for a higher degree may be possible.
Further particulars may be obtained from
Dr Robert Dale
Human Communication Research Centre
University of Edinburgh
2 Buccleuch Place
Edinburgh EH8 9LW
Telephone (031) 667 1011 x6487
Email: [email protected]
with whom applications by letter including a curriculum vitae and the
names of two referees should be lodged not later than Friday 8th
December 1989.
- -------
Robert Dale Phone: +44 31 667 1011 x6470 | University of Edinburgh
UUCP: ...!uunet!mcvax!ukc!its63b!cogsci!rda | Centre for Cognitive Science
ARPA: rda%[email protected] | 2 Buccleuch Place
JANET: [email protected] | Edinburgh EH8 9LW Scotland
------------------------------
To: [email protected]
>From: [email protected] (S. R. Harnad)
Newsgroups: comp.ai,sci.logic,sci.math.symbolic
Subject: What is a Symbol System?
Keywords: computation, symbol manipulation, syntax, formality
Date: 20 Nov 89 04:39:12 GMT
What is a symbol system? From Newell (1980) Pylyshyn (1984), Fodor
(1987) and the classical work of Von Neumann, Turing, Goedel, Church,
etc.(see Kleene 1969) on the foundations of computation, we can
reconstruct the following definition:
A symbol system is:
(1) a set of arbitrary PHYSICAL TOKENS (scratches on paper, holes on
a tape, events in a digital computer, etc.) that are
(2) manipulated on the basis of EXPLICIT RULES that are
(3) likewise physical tokens and STRINGS of tokens. The rule-governed
symbol-token manipulation is based
(4) purely on the SHAPE of the symbol tokens (not their "meaning"),
i.e., it is purely SYNTACTIC, and consists of
(5) RULEFULLY COMBINING and recombining symbol tokens. There are
(6) primitive ATOMIC symbol tokens and
(7) COMPOSITE symbol-token strings. The entire system and all its parts
- - the atomic tokens, the composite tokens, the syntactic manipulations
(both actual and possible) and the rules -- are all
(8) SEMANTICALLY INTERPRETABLE: The syntax can be SYSTEMATICALLY
assigned a meaning (e.g., as standing for objects, as describing states
of affairs).
According to proponents of the symbolic model of mind such as Fodor
(1980) and Pylyshyn (1980, 1984), symbol-strings of this sort capture
what mental phenomena such as thoughts and beliefs are. Symbolists
emphasize that the symbolic level (for them, the mental level) is a
natural functional level of its own, with ruleful regularities that are
independent of their specific physical realizations. For symbolists,
this implementation-independence is the critical difference between
cognitive phenomena and ordinary physical phenomena and their
respective explanations. This concept of an autonomous symbolic level
also conforms to general foundational principles in the theory of
computation and applies to all the work being done in symbolic AI, the
branch of science that has so far been the most successful in
generating (hence explaining) intelligent behavior.
All eight of the properties listed above seem to be critical to this
definition of symbolic. Many phenomena have some of the properties, but
that does not entail that they are symbolic in this explicit, technical
sense. It is not enough, for example, for a phenomenon to be
INTERPRETABLE as rule-governed, for just about anything can be
interpreted as rule-governed. A thermostat may be interpreted as
following the rule: Turn on the furnace if the temperature goes below
70 degrees and turn it off if it goes above 70 degrees, yet nowhere in
the thermostat is that rule explicitly represented.
Wittgenstein (1953) emphasized the difference between EXPLICIT and
IMPLICIT rules: It is not the same thing to "follow" a rule
(explicitly) and merely to behave "in accordance with" a rule
(implicitly). The critical difference is in the compositeness (7) and
systematicity (8) criteria. The explicitly represented symbolic rule is
part of a formal system, it is decomposable (unless primitive), its
application and manipulation is purely formal (syntactic,
shape-dependent), and the entire system must be semantically
interpretable, not just the chunk in question. An isolated ("modular")
chunk cannot be symbolic; being symbolic is a combinatory, systematic
property.
So the mere fact that a behavior is "interpretable" as ruleful does not
mean that it is really governed by a symbolic rule. Semantic
interpretability must be coupled with explicit representation (2),
syntactic manipulability (4), and systematicity (8) in order to be
symbolic. None of these criteria is arbitrary, and, as far as I can
tell, if you weaken them, you lose the grip on what looks like a
natural category and you sever the links with the formal theory of
computation, leaving a sense of "symbolic" that is merely unexplicated
metaphor (and probably differs from speaker to speaker).
Any rival definitions, counterexamples or amplifications?
Excerpted from:
Harnad, S. (1990) The Symbol Grounding Problem. Physica D (in press)
- ----------------------------------------------------
References:
Fodor, J. A. (1975) The language of thought. New York: Thomas Y. Crowell
Fodor, J. A. (1987) Psychosemantics. Cambridge MA: MIT/Bradford.
Fodor, J. A. & Pylyshyn, Z. W. (1988) Connectionism and cognitive
architecture: A critical appraisal. Cognition 28: 3 - 71.
Harnad, S. (1989) Minds, Machines and Searle. Journal of Theoretical
and Experimental Artificial Intelligence 1: 5-25.
Kleene, S. C. (1969) Formalized recursive functionals and formalized
realizability. Providence, R.I.: American Mathematical Society.
Newell, A. (1980) Physical Symbol Systems. Cognitive Science 4: 135-83.
Pylyshyn, Z. W. (1980) Computation and cognition: Issues in the
foundations of cognitive science. Behavioral and Brain Sciences
3: 111-169.
Pylyshyn, Z. W. (1984) Computation and cognition. Cambridge MA:
MIT/Bradford
Turing, A. M. (1964) Computing machinery and intelligence. In: Minds
and machines, A.R. Anderson (ed.), Engelwood Cliffs NJ: Prentice Hall.
- -
Stevan Harnad INTERNET: [email protected] [email protected]
[email protected] [email protected] [email protected]
CSNET: harnad%[email protected]
BITNET: [email protected] [email protected] (609)-921-7771
------------------------------
To: [email protected]
>From: [email protected] (Drew McDermott)
Newsgroups: comp.ai
Subject: Re: What is a Symbol System?
Keywords: symbol manipulation, syntax, formality, semantics
Date: 20 Nov 89 18:44:01 GMT
I have two quibbles with this list:
(a) Items 2&3: I agree that the rules have to be explicit, but they are
usually written in a different notation from the one they manipulate.
Example: A theorem prover written in Lisp. Another example: The
weights in a neural net.
(b) Item 8: Why is it necessary that a symbol system have a semantics
in order to be a symbol system? I mean, you can define it any way
you like, but then most AI programs wouldn't be symbol systems in
your sense. I and others have spent some time arguing that symbol
systems *ought* to have a semantics, and it's odd to be told that I
was arguing in favor of a tautology. (Or that, now that I've changed
my mind, I believe a contradiction.)
Perhaps you have in mind that a system couldn't really think, or
couldn't really refer to the outside world without all of its symbols
being part of some seamless Tarskian framework. (Of course, *you*
don't think this, but you feel that charity demands you impute this
belief to your opponents.) I think you have to buy several extra
premises about the potency of knowledge representation to believe that
formal semantics is that crucial.
-- Drew McDermott
------------------------------
To: [email protected]
Date: Wed, 15 Nov 89 17:25:57 PST
>From: [email protected] (Ingrid Deiwiks)
Subject: Special talk by Hector Levesque
[[ This is late, but it happened. -CW ]]
BELIEF AND ABDUCTIVE REASONING
Hector J. Levesque
Department of Computer Science
University of Toronto
Thursday, 16 November 1989, 11:00
SRI International, Room AA298
While various models of belief have been proposed in the literature,
properties such as logical omniscience have been understood mainly in
terms of deductive reasoning. Here we examine the dependence of
abductive reasoning on the underlying model of belief. In particular,
we show that the ATMS as characterized by Reiter and de Kleer is
appropriate for the classical model of belief, but that a more limited
notion of belief leads to a more tractable form of abductive
reasoning. This talk is an expanded version of one presented at
IJCAI-89.
------------------------------
End of NL-KR Digest
*******************
|
| 125.16 | NL-KR Digest V6 No. 45 | HERON::ROACH | TANSTAAFL ! | Wed Dec 06 1989 15:13 | 586 |
| Printed by: Pat Roach Document Number: 009391
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 05-Dec-1989 10:49am CET
From: AI_INFO
AI_INFO@AIVTX@HERON@MRGATE@VALMTS@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V6 No. 45
Article 27 of comp.ai.nlang-know-rep
Path: shodha.dec.com!shlump.nac.dec.com!decuac!haven!udel!wuarchive!cs.utexas.edu!tut.cis.ohio-state.edu!ucbvax!cs.rpi.edu!nl-kr-request
From: [email protected] (NL-KR Moderator Chris Welty)
Newsgroups: comp.ai.nlang-know-rep
Subject: NL-KR Digest, Volume 6 No. 45
Message-ID: <[email protected]>
Date: 30 Nov 89 15:44:59 GMT
Sender: [email protected]
Reply-To: [email protected] (NL-KR Digest)
Organization: The Internet
Lines: 556
Approved: [email protected]
NL-KR Digest (Thu Nov 30 09:54:34 1989) Volume 6 No. 45
Today's Topics:
ATMS Implementation Query (Long)
AI Seminar
Finding Spatial Relations in the World ... (Unisys AI seminar)
CSLI Calendar, 30 November, vol. 5:10
Submissions: [email protected]
Requests, policy: [email protected]
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.
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.
[[ The Symbol Grounding Problem has once again become a hot topic
on comp.ai, and it does fall under the topics this list covers.
Because I have no way of objectively filtering the
discussion, I decided to include only the first two articles (which
were in the last issue) and point people interested in reading more
to comp.ai. For those who do not have USENET access, I am keeping
all the articles in that discussion. It is currently 52K of text and
still raging. The file is in nl-kr/sgp on the archive server. -CW ]]
-----------------------------------------------------------------
To: [email protected]
>From: [email protected] (Greg Bond)
Newsgroups: comp.ai,comp.ai.nlang-know-rep
Subject: ATMS Implementation Query (Long)
Date: 29 Nov 89 01:05:25 GMT
I'm in the midst of designing an ATMS and have run into difficulties
surmising implementation details of constraint consumers from deKleer's
third paper (Problem Solving with the ATMS). The explanation of my problem
is rather involved but I would appreciate any help I can get (in the form of
advice or pointers to papers, tech reports or books) because any solution to
the problem I can think of is rather kludgy - kludges do not belong in as
elegant a mechanism as the ATMS!
My difficulties can be illustrated with a simple example: suppose I wish to
add a constraint consumer for the problem solver constraint x=y+z. Using
deKleer's notation, this amounts to a set of conjunctive class consumers y,z
|-> {x=y+z}; x,y |-> {z=x-y}; x,z |-> {y=x-z} with a type C. Given that this
constraint consumer has been installed in the ATMS and the ATMS database is
initially empty (no nodes or justifications asserted), the following
scenario unfolds: first, a premise node with datum y=2 is asserted by the
problem solver - the returned node and its datum are entered in a problem
solver lookup table to prevent the assertion of multiple ATMS nodes with the
same datum; then a premise node with datum z=3 is asserted and its node is
entered in the lookup table. At this point the conjunctive class consumer
y,z |-> {x=y+z} is enqueued (by a problem solver-supplied enqueue procedure)
for execution (by a consumer execution procedure internal to the ATMS).
When executed, the consumer derives the datum x=5 and asserts a
corresponding node in the ATMS. The datum and its node are entered in the
problem solver lookup table and the node is returned to the consumer
execution procedure where a justification for the node is asserted - in this
case, the premises with datums y=2, z=3 are the antecedents and the node
with datum x=5 is the consequent. The justification informant indicates the
consequent being a result of a consumer of type C.
Herein lie the problems. At first, I thought that conjunctive class
consumers should be checked for applicability when a node is asserted. Thus,
when a node is asserted through the standard ATMS add-node interface
procedure, any conjunctive class consumers with domain classes corresponding
to that of the newly asserted node and any existing nodes in the ATMS
database are applicable. If the node conjuncts hold in consistent
environments then the consumer is enqueued. This technique works fine for
triggering the consumer in the given example: the node for y=2 belongs to
variable class y and the node for z=3 belongs to class z - conjunctive class
consumer y,z |-> {x=y+z} is therefore applicable.
However, when the consumer asserts the newly derived node for x=5 the
remaining two conjunctive class consumers will be found to be applicable.
Since the node label for x=5 is empty until it is justified the applicable
consumers cannot be enqueued. Instead, two dummy nodes are asserted with the
respective consumers attached to them. The dummy nodes are then justified
by the respective antecedent nodes: x=5,y=2 justifying the dummy node with
consumer x,y |-> {z=x-y} attached and x=5,z=3 justifying the dummy node with
consumer x,z |-> {y=x-z} attached. When the node for x=5 is justified by
the ATMS consumer execution procedure, both of the dummy nodes' labels are
updated to non-empty but neither of the attached consumers are enqueued
because their type is the same as that justifying the antecedent node for
x=5.
The problem is that these dummy nodes and their justifications should never
have been added to the ATMS in the first place because their attached
consumers will never run. The ATMS is left with a couple of extra nodes (in
this small example) whose labels are updated along with the other node
labels for no purpose whatsoever. How is this exception handled gracefully?
Is my current interpretation of the ATMS mixed up or is it simply a matter
of passing extra parameters around (flags -> yuk!)?
- -----------------------------------------------------------------
Greg Bond -----> [email protected]
Dept. of Systems and Computer Engineering, Carleton University
Ottawa, ON, Canada K1S 5B6
------------------------------
To: [email protected]
Date: Tue, 28 Nov 89 14:45 EDT
>From: [email protected]
Subject: AI Seminar
BBN STC Science Development Program
AI Seminar Series Lecture
SEMANTIC INTERPRETATION AND THE LEXICON:
WHAT MAKES SENSE?
Paul S. Jacobs
AI Program, GE Research
Schenectady, NY 12301 USA
[email protected]
BBN STC, 2nd Floor Conference Room
10 Moulton Street, Cambridge, Massachusetts
Tuesday, December 5, 10:30 am
Practical applications of natural language demand precision in
semantic interpretation, highlighting the problems of lexical ambiguity
and vagueness. The representation and discrimination of word meanings
is thus a key issue for language analysis, motivated especially by the
need for broad scale NL systems and by applications in information retrieval.
A successful method for distinguishing word senses, however coarsely,
could be a major contribution to natural language processing technology.
Past research does not point to a successful strategy for sense
discrimination, but it does reveal some naive approaches that won't work.
The most obvious of these is the simple search for intersections or
``lexical coherence'' among word sense categories. This twenty-year-old
approach is still popular and still destined to fail. Sense discrimination
depends on context, and context is more than the combination of the words
that appear together. Context comprises topic analysis, phrasal constructs,
complex events, and linguistic and conceptual structures. This research
focuses on accessing the power of these more complex contextual structures
in identifying word senses using a lexicon of over 10,000 roots. Semantic
and syntactic preferences, lexical relations, and other structural knowledge
combine in our approach to help with generic sense discrimination.
------------------------------
To: [email protected]
Date: Wed, 29 Nov 89 11:08:49 -0500
>From: [email protected]
Subject: Finding Spatial Relations in the World ... (Unisys AI seminar)
AI SEMINAR
UNISYS PAOLI RESEARCH CENTER
Finding Spatial Relations in the World
to Match our Prepositions
Annette Herskovits
Wellesley College and University of Pennsylvania
Lexical meanings are notoriously difficult to define. For any definition,
there seems to exist a counterexample. Focusing on spatial prepositions
("across", "at", "over", etc.), I will propose systematic, but quite
complex, interactions between word meaning and cognition to account for the
broad range of uses of a word.
I will assume a geometric schema associated with each spatial preposition,
but also active processes of fitting the schema onto real situations. Two
phenomena account for the flexibility of lexical use: first, the fitting
takes advantage of selections, groupings, idealizations, and tranformations
which are part and parcel of spatial cognition (rather than strictly
linguistic processes); second, approximate fits are acceptable, subject to
well-defined conditions.
However, this search for a best fitting schema cannot explain all
prepositional uses. In addition, there are some standard types of
situation, defined as functional interactions rather than strictly
spatially, for which the use of a particular preposition is required,
either by convention or because of salience.
I will discuss the consequences of this analysis for linguistics and
artificial intelligence.
11:00 pm Tuesday, December 5, 1989
BIC Conference Room
Unisys Paoli Research Center
Route 252 and Central Ave.
Paoli PA 19311
-- non-Unisys visitors who are interested in attending should --
-- send email to [email protected] or call 215-648-7446 --
------------------------------
To: [email protected]
Date: Wed, 29 Nov 89 13:43:04 PST
>From: [email protected] (Ingrid Deiwiks)
Subject: CSLI Calendar, 30 November, vol. 5:10
C S L I C A L E N D A R O F P U B L I C E V E N T S
- ----------------------------------------------------------------------------
30 November 1989 Stanford Vol. 5, No. 10
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 30 NOVEMBER 1989
12:00 noon TINLunch
Cordura 100 Stanford's Policies on Intellectual Property Rights
Jon Sandelin and David Charron, Licensing Associates
Jane McLean, Manager of the Software Distribution
Center (SDC)
Office of Technology Licensing (OTL)
Stanford University
([email protected])
Abstract in last Calendar
2:15 p.m. CSLI Seminar
Cordura 100 Models of Rational Agency 9
Michael Bratman, Martha Pollack, Stan Rosenschein
([email protected],
[email protected], [email protected])
Wrap-up session
Abstract in last Calendar
____________
ANNOUNCEMENT
Because of final exams and the winter break, there will be no Thursday
events and no Calendar on 7, 14, 21, and 28 December. The next
Calendar will be published on 4 January, and Thursday events will
resume on 11 January.
____________
SYMBOLIC SYSTEMS FORUM
Systematizing Our Commonsense Reasoning about Fictions
Ed Zalta
Friday, 1 December, 3:15, 60-61G
Consider this piece of reasoning:
(1) The ancient Greeks worshipped Dionysus.
(2) Dionysus is a mythical character.
(3) Mythical characters don't exist.
(4) Therefore, the ancient Greeks worshipped something that doesn't
exist.
Even though we are tempted to say that the Greeks certainly believed
that they were worshipping something that exists, if (2) and (3) are
true, what they were worshipping doesn't exist. How, then, do you
represent (4) using the resources of ordinary logic? How can you say
that there is something which doesn't exist and which the Greeks
worshipped? Haven't you contradicted yourself?
Moreover, it follows from the fact that Ponce de Leon searched for the
fountain of youth that Ponce de Leon searched for something. What is
the thing that makes "Ponce de Leon searched for something" true?
These are questions addressed in Friday's talk.
This talk is aimed at undergraduates with no assumed background.
Refreshments will be served.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
Warranted Assertibility and Truth: Dewey's Reply to Russell
Tom Burke
Department of Philosophy
([email protected])
Friday, 1 December, 3:15, 90-91A
Russell (1940) wants to say that a proposition expressed by the
formula `P(a)' is true just in case the object a denoted by `a' does
in fact have the property P denoted by `P'. True propositions simply
report facts. This assumes that a and P occur in the actual scheme of
things, hence the only real question as to the truth-value of the
proposition is whether or not a does in fact have property P. Russell
admits that this "involves us in metaphysics, and has difficulties
(not insuperable) in defining the correspondence which it requires for
the definition of `truth'."
Dewey assumes virtually nothing about "_the_ actual scheme of things,"
in which case a simple appeal to facts is pointless. Dewey
relativizes the propositional contents of statements to schemes of
individuation I brought to bear by agents in given situations s (to
use some current terminology). The proposition that a is of kind P
(modulo s,I) is true just in case (1) a and P belong to the
individuation scheme I brought to bear in situation s, and (2) the
activities perform _able_ in that situation to individuate object a
_would in the ideal limit_ reliably indicate that it meets the
specifications for being of kind P (whether or not those activities
are actually performed).
I will discuss several examples to motivate this pragmatist definition
of truth.
____________
COMMONSENSE AND NONMONOTONIC REASONING SEMINAR
A New Approach to Modal Operators
Matt Ginsberg
Department of Computer Science
Monday, 4 December, 3:15
Margaret Jacks Hall 252
We describe a new formalization of modal operators that views them not
in terms of Kripke's possible worlds, but as functions on an
underlying set of truth-values. Thus Moore's knowledge operator L,
where Lp means "I know that p," would correspond to a mapping taking
true into true (since we know p if we know it to be true) and taking
both false and unknown into false (since we do not know p if we either
know it to be false or know nothing about it at all). This new
approach has the following advantages over the conventional ones:
(1) intuitive simplicity;
(2) it provably generalizes both Kripke's construction and Moore's
autoepistemic logic, while making clear the distinctions between
them;
(3) it allows for easy further generalization to modal operators
that are related to temporal reasoning and to causality;
(4) the natural procedure for computing the truth-value of a sentence
involving these modal operators is "incremental" in the sense that
it computes approximate answers that "converge" to the correct one
in the large runtime limit.
This talk will concentrate on the first two of these properties; I
will discuss the third and fourth as completely as time allows.
____________
SPECIAL TALK
Nonwellfounded Sets and Their Applications
Jon Barwise
Monday, 11 December, 4:00
SRI International, Building A, Conference Room B
Nonwellfounded sets (for example, a stream of the form a = (1,(2,a)),
with the usual definition of ordered pair) were part of set theory in
the good old days, but were later banned since they were felt to be
implicated in the paradoxes. However, in recent years, they have been
slowly finding their way back into set theory, due in part to the work
of Peter Aczel (among others), who has shown that they are not
incoherent, and in part to applications that have been found for them
in modeling various kinds of circular phenomena in computer science,
AI, philosophy, and cognitive science. This talk will motivate
nonwellfounded sets by focusing on simple applications in computer
science. I will then give a summary of Aczel's work, and show how it
yields the desired applications. The talk is expository and should be
accessible to anyone familiar with basic set theory.
- --
Note for Visitors to SRI:
Please arrive at least ten minutes early in order to sign in and be
shown to the conference room.
SRI is located at 333 Ravenswood Avenue in Menlo Park. Visitors may
park in the visitors lot in front of Building A (red brick building at
333 Ravenswood Avenue, second driveway on the right, east of Laurel)
or in the conference parking area at the corner of Ravenswood and
Middlefield. The seminar room is in building A. Visitors should sign
in at the reception desk in the building A lobby.
IMPORTANT: Attendance is open, but visitors from certain countries
designated by the U.S. government must make arrangements in advance.
If you have not already made such arrangements before your arrival,
admission to the seminar will be denied. If you believe you may be
from one of these countries and if you wish to make arrangements to
attend, please call Judith Burgess at (415) 859-5924.
____________
CURRENT VISITORS AT CSLI
PETER AUSTIN, Senior Lecturer in Linguistics and Japanese Language
Coordinator, La Trobe University, Melbourne, Australia. Peter's main
research areas are syntax, semantics, and Australian Aboriginal
languages. He has published on morphosyntax, case marking, and
complex sentence constructions (including switch-reference) in
Australian languages. His most recent publication is _Complex Sentence
Constructions in Australian Aboriginal Languages_ (Benjamins, 1988).
Dates of visit: November 1989-January 1990.
SUK-JIN CHANG, Department of Linguistics, Seoul National University.
During his stay at CSLI, Suk-Jin will continue to work on developing
an information-based Korean discourse grammar (IKDG) that has been
conceived of and explored to some extent from the perspective of
natural-language processing and in the general theoretical framework
of relational theories of language as action. Specifically, he will
attempt to incorporate into IKDS the system of honorification, viewed
as a pragmatic agreement phenomenon between the discourse participants
and the information functions of topic and focus, distinct from
grammatical functions of subject and object, by keeping abreast of
ongoing studies in situation theory and situation semantics and
extending the semantic component of HPSG. Dates of visit: August
1989-July 1990.
HIROSHI KATO, Industrial Affiliates Program visiting researcher, C&C
Information Technology Laboratories, NEC Corporation, Japan. Since
1983, Hiroshi has been engaged in research and development of
educational systems, such as Computer-Based Instruction (CBI) systems
and Computer-Managed Instruction (CMI) systems. He is interested in
cognitive models of human learning and human interface. He is now
working on a research project with James Greeno on a learner's
understanding model of first-order logic through the CBI system
"Tarski's World." Dates of visit: August 1989-August 1990.
FINN KENSING, Associate Professor, Department of Computer Science,
Roskilde University Centre, Denmark. Finn is a coauther of
_Professional Systems Development: Experience, Ideas and Action_. The
book will be published by Prentice Hall this fall. While at CSLI,
Finn will be doing an inquiry into what can be learned from applying a
language/action approach on the design of systems to be used in human
work processes. He will be working closely with Terry Winograd.
Dates of visit: August 1989-February 1990.
BERNARD LINSKY, Associate Professor of Philosophy, University of
Alberta, Canada. Bernie is on sabbatical from Edmonton for the
academic year. He is here to learn about situation semantics and to
work on papers on the metaphysics of semantics, in particular, on
possible worlds and universals. Dates of visit: September 1989-August
1990.
HIDEO MIYOSHI, Industrial Affiliates Program visiting researcher,
Sharp Corporation, Japan. From 1982 to 1987, Hideo was involved in
natural-language processing as a researcher of ICOT (Japanese fifth
generation computer project), where he worked on the development of
BUP (bottom-up parser in Prolog), DUALS (an experimental
discourse-understanding system), and JPSG (Japanese Phrase-Structure
Grammar). At SHARP, he recently worked on the development of (1) a
text-retrieval system using flexible keywords, and (2) a support
system for generating controlled Japanese texts. Both projects were
sponsored by ICOT. Hideo is interested in the semantic analyses and
representations of the Japanese language. He is also interested in
the role and mechanism of knowledge in natural-language understanding.
He hopes that the STASS project will help him understand these better.
While at CSLI, he will be mainly involved in the STREP project. Dates
of visit: October 1989-October 1990.
STEPHEN NEALE, Assistant Professor of Philosophy, Princeton
University. Stephen is working on a new book on the interpretation of
plural noun phrases in natural language, and -- when time permits -- a
manuscript on free will. Dates of visit: May 1989-February 1990.
MASAYUKI NUMAO, Tokyo Institute of Technology. Masa's research topic
is: Learning in Situations. During the last few years, he's been
interested in "learning," especially program synthesis by using the
techniques of machine learning. Generally speaking, program synthesis
systems have only synthesized pure Lisp or pure Prolog programs that
do not cause "side effects," since researchers seek "general synthesis
schemes." In reality, procedural programs depend completely on each
situation, and program statements may depend on each other
unexpectedly, causing "frame problems." Masa would like to overcome
these difficulties by "analytic learning of situations."
The steps are as follows:
(1) Learning -- An abstracted environment is extracted by analyzing
the situation based on a given PASCAL interpreter, and memorized.
(2) Program Synthesis -- In similar situations, slightly modified
programs are synthesized.
Masa hopes that each situation can be given in natural language as
given in PASCAL tutorial books, but as the first step he will give it
directly. He thinks "learning" is a key factor when dealing with
"situatedness." Dates of visit: September 1989-August 1990.
GREG O'HAIR, Department of Philosophy, The Flinders University
of South Australia. Dates of visit: October 1989-June 1990.
RYO OCHITANI, Industrial Affiliates Program visiting researcher,
Fujitsu Laboratories Ltd., Japan. For the past five years, Ryo has
helped develop the machine-translation system ATLAS2 at Fujitsu
Laboratories. During the last year, he and several other people
started a new study on a quicker and easier system to classify
sentences based on the semantic view, for which they collected two
million Japanese text samples and classified several hundred sentences
manually. Ryo is interested in studying what kind of system would
utilize this information most efficiently. Dates of visit: April
1989-April 1990.
ICHIRO OHSAWA, Tokyo Institute of Technology, Japan. Ichiro's
interest is modeling on computers of intelligent and communicative
agents who can handle natural language. The two key facts about such
agents are perspectivity and situation-boundedness. That is, they
view the world and themselves from their points of view and the
information they get is given only in the situation they are in. His
current research has been aimed at a computational realization of an
agent who can interact in dialog with his own viewpoint. He looks
forward to active interactions with human intelligent agents at CSLI.
Dates of visit: September 1989-February 1990.
ELIN ROENBY PEDERSEN, Assistant Professor of Computer Science,
Department of Computer and Systems Sciences, Copenhagen School of
Business and Administration, Denmark. During her stay, Elin will
carry out a number of studies on the use of advanced work stations in
intellectual work, e.g., in system analysis and development and in
research. The aim of these studies is to get a firmer grip on the
dynamical influence of computerized tools on processes in which people
attempt to build and convey knowledge. One hypothesis is that the use
of computerized tools should be studied as a special case of the use
of strictly defined means for description, i.e., as an issue of the
psychology and philosophy of description. Elin will be working
closely with Terry Winograd and Lucy Suchman. Dates of visit:
June-December 1989.
ANDRE SCEDROV, University of Pennsylvania. For the past several
years, Andre has been working in Logical Foundations of Programming
Structures, an area that bears on logic, theoretical computer science,
and algebra and topology in mathematics. His most recent work in this
area is concerned with incorporating inheritance and other features of
object-oriented programming within type systems with static
type-checking. He is now working on refinements of type systems that
would express computational resource requirements as program
specifications. In this setting the compliance of a program with the
imposed resource bounds would be insured at compile-time. Dates of
visit: July 1989-August 1990.
HINRICH SCHUETZE, University of Stuttgart, Germany. Hinrich received
a Master's degree in Computer Science from Stuttgart University in
April 1989. His thesis deals with the treatment of plurals in
natural-language processing systems. At this time, semantics --
especially the semantics of plurals -- is his main interest. While at
CSLI, he will work on PROSIT (PROgramming in SItuation Theory), a new
programming language that has many features of situation theory built
in. He would like to extend PROSIT to a tool for the semantic
processing of natural-language input. Dates of visit: July
1989-August 1990.
HIDETOSI SIRAI, Associate Professor, Department of Psychology, Chukyo
University, Japan. Hidetosi's background is in computer science. He
has been working on Japanese Phrase-Structure Grammar (JPSG) and is
interested in Situation Semantics (SS) to describe semantic phenomena
in Japanese and English. During his stay at CSLI, he will work on
JPSG + SS + ? = NLU (Natural-Language Understanding). Dates of visit:
July 1989-February 1990.
BARBARA TVERSKY, Department of Psychology, Stanford University.
Barbara is on sabbatical this year. Dates of visit: AY 1989-90.
WILLIAM UZGALIS, Assistant Professor of Philosophy , Oregon State
University. Bill is interested in identity and individuation,
personal identity, and the debate between essentialists and
antiessentialists over such issues as the proper semantics for natural
kind terms. He works on issues in the philosophies of Locke and
Plato. Dates of visit: July 1988-August 1990.
------------------------------
End of NL-KR Digest
*******************
|
| 125.17 | NL-KR Digest V7.2 | HERON::ROACH | TANSTAAFL ! | Fri Feb 02 1990 11:34 | 656 |
| Printed by: Pat Roach Document Number: 010227
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 02-Feb-1990 11:32am CET
From: AI_INFO
AI_INFO@AIVTX@HERON@MRGATE@HUGHI@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V7.2
NL-KR Digest (Thu Jan 25 18:34:02 1990) Volume 7 No. 2
Today's Topics:
DAI Papers at AAAI-90
CALL FOR PAPERS: MINDS AND MACHINES
CFP: AI in Manufacturing
CFP: Neural nets in Manufacturing
CFP: ASIS '90 Workshop on Classification Research
BBN Seminar Announcement
ACSS Conference Announcement
Submissions: [email protected]
Requests, policy: [email protected]
Back issues are available from host archive.cs.rpi.edu [128.213.7.6] 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: [email protected]
Date: Wed, 10 Jan 90 15:04 CST
>From: Michael N. Huhns <[email protected]>
Subject: DAI Papers at AAAI-90
The call for papers for AAAI-90 requires each submitted paper to specify
a single topic from a given list of Content Areas. If you are planning
to submit a paper on distributed artificial intelligence (which,
unfortunately, is not one of the topics) please choose the topic
"Automated Reasoning" and include the additional keyword "DAI." This
will 1) make it easier for the papers to be sorted for review, 2) group
DAI papers together so that they can be reviewed uniformly, 3) enable
papers on DAI to be reviewed by people knowledgeable abut DAI, and 4)
make it easier to arrange conference sessions devoted to DAI. This
procedure has been agreed to by the AAAI-90 Program Chairs, Tom
Dietterich and Bill Swartout.
Note: papers must arrive by February 20, 1990 at
AAAI-90
American Association for Artificial Intelligence
445 Burgess Drive
Menlo Park, CA 94025-3496
Michael N. Huhns
MCC
------------------------------
To: [email protected]
Date: Tue, 23 Jan 90 13:24:32 EST
>From: [email protected] (William J. Rapaport)
Subject: CALL FOR PAPERS: MINDS AND MACHINES
========================================================================
CALL FOR PAPERS---CALL FOR PAPERS---CALL FOR PAPERS---CALL FOR PAPERS
========================================================================
Kluwer Academic Publishers announces
MINDS AND MACHINES
Journal for Artificial Intelligence, Philosophy, and Cognitive Science
ISSN 0924-6495
(previously announced as `Philosophy and Artificial Intelligence')
EDITORIAL FOCUS:
Machines and Mentality
Knowledge and its Representation
Epistemic Aspects of Computer Programming
Connectionist Conceptions
Artificial Intelligence and Epistemology
Computer Methodology
Computational Approaches to Philosophical Issues
Philosophy of Computer Science
Simulation and Modeling
Ethical Aspects of Artificial Intelligence
EDITOR:
James H. Fetzer, University of Minnesota, Duluth, MN, USA
BOOK REVIEW EDITOR:
William J. Rapaport, SUNY Buffalo, Buffalo, NY, USA
EDITORIAL BOARD (as of January 1990)
Jon Barwise Stanford University, USA
Andy Clark University of Sussex, UK
Robert Cummins University of Arizona, USA
Jerry Fodor Rutgers University, USA
Clark Glymour Carnegie-Mellon University, USA
John Haugeland University of Pittsburgh, USA
Jaakko Hintikka Florida State University, USA
David Israel SRI International, USA
Frank Keil Cornell University, USA
Henry Kyburg University of Rochester, USA
John McCarthy Stanford University, USA
Donald Nute University of Georgia, USA
Zenon Pylyshyn University of Western Ontario, Canada
Barry Richards Imperial College, London, UK
Roger C. Schank Northwestern University, USA
John Searle University of California, Berkeley, USA
Stephen Stich Rutgers University, USA
Terry Winograd Stanford University, USA
MINDS AND MACHINES affords an international forum for discussion and
debate of important and controversial issues concerning significant
developments within its areas of editorial focus. Well-reasoned
contributions from diverse theoretical perspectives are welcome, and
every effort will be made to insure their prompt publication. Among the
features that are intended to make this journal distinctive within the
field are these:
o Strong stands on controversial issues are specifically encouraged;
o Important articles exceeding normal journal length may appear;
o Special issues devoted to specific topics will be a regular feature;
o Review essays discussing current problem situations will appear;
o Critical responses to previously published pieces are also invited.
This journal is intended to foster a tradition of criticism within the
AI and philosophical communities on problems and issues of common
concern. Its scope explicitly encompasses philosophical aspects of
computer science. All submissions will be subject to review.
Publication will begin with a single volume of four issues per year.
The first issue will appear in January 1991.
Contributors should send 4 copies of their manuscript to:
James H. Fetzer, Editor
MINDS AND MACHINES
Department of Philosophy
University of Minnesota
Duluth, MN 55812
USA
[email protected]
[email protected]
Correspondence concerning books for review should be sent to:
William J. Rapaport, Book Review Editor
MINDS AND MACHINES
Center for Cognitive Science
Department of Computer Science
SUNY Buffalo
Buffalo, NY 14260
USA
[email protected]
[email protected]
Subscription information and sample copies will be available from:
Kluwer Academic Publishers Group
P.O. Box 322
3300 AH Dordrecht
The Netherlands
or
Kluwer Academic Publishers
101 Philip Drive
Norwell, MA 02061
USA
========================================================================
CALL FOR PAPERS---CALL FOR PAPERS---CALL FOR PAPERS---CALL FOR PAPERS
========================================================================
------------------------------
To: [email protected]
>From: [email protected]
Newsgroups: comp.ai.nlang-know-rep
Subject: CFP: AI in Manufacturing
Date: Tuesday, 23 Jan 1990 14:07:14 EST
*********************************************************************
****** *****
****** CALL FOR PAPERS *****
****** Applied Artificial Intelligence *****
****** An International Journal *****
****** Special Issue On *****
****** Artificial Intelligence In Manufacturing *****
****** *****
*********************************************************************
Guest Editor
Professor Soundar Kumara, Department of Industrial and Managament
Systems Engineering, The Pennsylvania State
University, University Park, PA 16802, U.S.A.
Professor Setsuo Ohsuga, Research Center for Advanced Science and
Technology, University of Tokyo, Tokyo, Japan
Professor Inyong Ham, Department of Industrial and Management
Systems Engineering, The Pennsylvania State
University, University Park, PA 16802, U.S.A.
This special issue is dedicated to the enhancement of advanced
manufacturing research through the exploration of Artificial Intelligence
techniques.
Topics of interest include, but are not limited to:
* Knowledge Representation Schemes
* Engineering Design
* Process Diagnostics
* Qualitative Reasoning in Manufacturing
* Manufacturing Control
* Robotics
* Process Planning
* Scheduling
* Automated Visual Inspection
* Geometric Reasoning
* AI in CAD/CAM
* Tutorial and Survey Articles
* Specialized Industrial Applications
Authors are encouraged to submit four copies of completed manuscripts to
Professor Soundar R. T. Kumara
Guest Co-Editor, AAI Special Issue on AI in Manufacturing
Department of Industrial and Management Systems Engineering
The Pennsylvania State University
207 Hammond Building
University Park, PA 16802, U.S.A
Manuscript Due Date: April 15, 1990
If any question , fell free to contact Professor Soundar Kumara
(814)863-2359
------------------------------
To: [email protected]
>From: [email protected]
Newsgroups: comp.ai.nlang-know-rep
Subject: CFP: Neural nets in Manufacturing
Date: Tuesday, 23 Jan 1990 16:41:05 EST
*********************************************************************
****** *****
****** CALL FOR PAPERS *****
****** Journal of Intelligent Manufacturing *****
****** SPECIAL ISSUE ON *****
****** Neural Networks In Manufacturing *****
****** *****
*********************************************************************
Guest Editors
Professor Soundar Kumara, Department of Industrial and Managament
Systems Engineering, The Pennsylvania State
University, University Park, PA 16802, U.S.A.
Professor Setsuo Ohsuga, Research Center for Advanced Science and
Technology, University of Tokyo, Tokyo, Japan
Professor Yung C. Shin, Department of Industrial and Managament
Systems Engineering, The Pennsylvania State
University, University Park, PA 16802, U.S.A.
This special issue is dedicated to the enhancement of advanced
manufacturing research through the exploration of the applicability of
Artificial Neural Networks.
Topics of interest include, but are not limited to:
* Survey and Tutorial based articles on Neural Networks and Their
Applicability to Manufacturing
* Neural Nets and Associative Memory in Engineering Design
* Knowledge Representation Via Neural Networks
* Neural Networks in Sensing and Sensor-Based Diagnostics
* Connectionist Architectures for manufacturing Control
* Neural Networks in Robotics
* Example Applications
Authors are encouraged to submit four copies of completed manuscripts to
Either
Professor Soundar R. T. Kumara OR
Professor Yung C. Shin
Guest Co-Editor, Journal of Intelligent Manufacturing
Department of Industrial and Management Systems Engineering
The Pennsylvania State University
207 Hammond Building
University Park, PA 16802, U.S.A
Manuscript Due Date: May 1, 1990
For further information please feel free to contact Soundar Kumara at
(814)863-2359
------------------------------
To: [email protected]
>From: [email protected] (Susanne M Humphrey)
Date: 24 Jan 90 21:25:47 GMT
Newsgroups: comp.ai.nlang-know-rep
Subject: CFP: ASIS '90 Workshop on Classification Research
Organization: National Library of Medicine, Bethesda, Md
ASIS '90 Workshop on Classification Research
Organized by ASIS Special Interest Group on Classification Research (SIG/CR)
Call for Papers
The American Society for Information Science Special Interest Group on
Classification Research (ASIS SIG/CR) invites submissions for the ASIS '90
Classification Research (CR) Workshop, to be held at the 53d Annual Meeting of
ASIS in Toronto, Canada. The Workshop will take place Sunday, November 4,
1990, 9am - 5pm. ASIS '90 continues through Thursday, November 8.
The Workshop is designed to be an exchange of research ideas by participants,
addressing creation, development, management, representation, display,
comparison, compatibility, theory, and application of classification schemes.
Emphasis will be semantic classification, in contrast to statistically-based
schemes. However, a topic like statistical techniques used for developing
explicit semantic classes, which in turn might be applied to databases, would
be in scope. Topics include, but are not limited to:
- Warrant for concepts in classification schemes.
- Concept acquisition.
- Basis for semantic classes.
- Automated techniques to assist in creating classification schemes.
- Knowledge representation systems.
- Relations and their properties.
- Inheritance and subsumption.
- Classification algorithms.
- Procedural knowledge in classification schemes.
- Reasoning with classification schemes.
- Software for managing classification schemes.
- Interfaces for displaying classification schemes.
- Data structures and programming languages for classification schemes.
- Comparison and compatibility between classification schemes.
- Applications such as subject analysis, natural language understanding,
information retrieval, expert systems
The CR Workshop welcomes submissions from various disciplines. Attendance
will be limited to authors of papers. Those interested in participating are
invited to submit short (2-3 single-space page) position papers, reflecting
substantive work that has been performed in the above areas or other areas
related to semantic classification schemes. Submissions may include
background papers as attachments. Position papers will be published in
proceedings to be distributed prior to the Workshop. Participants are
encouraged to distribute background papers at or prior to the Workshop. Lunch
will not be served; however, refreshments will be available during the day.
Workshop registration fee is $30.
Order of preference for mode of transmitting submissions: [1] Electronic mail
[2] Diskette accompanied by paper copy [3] Paper copy only (fax or postal).
Electronic submissions should be ASCII text; paper-only submissions should be
keyable as ASCII. Submissions should be sent to arrive by May 1, 1990, to:
Susanne Humphrey
Lister Hill National Center for Biomedical Communications
National Library of Medicine
Bldg 38A, Rm 9N903
Bethesda, MD 20894
Internet: [email protected]
Fax: 301-496-0673
Phone: 301-496-9300
For additional information, contact the CR Workshop Co-Chairs, Susanne
Humphrey, as above, or Barbara Kwasnik, School of Information Studies, 4-206
Center for Science and Technology, Syracuse University, Syracuse, NY
13244-4100, e-mail [email protected], fax 315-443-1954, telephone
351-443-4547 (direct office) or 351-443-2911 (department office).
------------------------------
To: [email protected]
Subject: BBN Seminar Announcement
>From: "Damaris M. Ayuso" <[email protected]>
Reply-To: [email protected]
Date: Wed, 24 Jan 90 10:04:19 EST
BBN STC Science Development Program
PLANNING TO LEARN
LAWRENCE HUNTER
National Library of Medicine
BBN STC, 3rd floor large conference room
10 Moulton St, Cambridge MA, 02138
Friday January 26th, 10:30 AM
Abstract:
By combining techniques from machine learning and robot planning, knowledge
acquisition planning provides a framework for automatically deploying diverse
and complex analytical tools to extremely large collections of data. KA
planning is the process of automatically combining inferential tools such as
induction, search, database lookup, and statistical analysis into methods for
addressing complex query statements. This process depends both on having a
domain model that supports subgoal decomposition, and a library of KA actions
annotated with the type and form of required input data, expected outcomes of
the action, estimates of computational resources needed, and so on. By
annotating analytical tools in this way, it is possible to automatically select
and deploy them and combine their results, even if they run on incompatible
platforms. Knowledge acquisition planning was first implemented in IVY, a
program that learned about diagnosing lung tumors. A larger implementation,
called INVESTIGATOR, is currently underway in the domain of molecular biology.
------------------------------
To: [email protected]
Date: 29 Dec 89 14:44:00 EST
>From: "LFA" <[email protected]>
Subject: ACSS Conference Announcement
ADVANCED COMPUTING FOR THE SOCIAL SCIENCES
A Conference
Sponsored by
The Energy Division of
Oak Ridge National Laboratory
and
The United States
Department of Commerce
Bureau of the Census
at
Williamsburg Hilton and National Conference Center
Williamsburg, Virginia
April 10-12, 1990
GOALS
This conference will serve as an ideal forum for industry, academia, and
government social scientists to exchange ideas about the current trends,
future directions, and applications that center around the rapidly
advancing capabilities of electronic data capture, computation, analysis,
and information processing. The conference will focus upon endeavors in
social sciences that either advance or exploit the development of current
computing technology.
SPECIAL WORKSHOP
Jerry Mechling (Director of Strategic Computing and Telecommunications in
the Public Sector, Kennedy School of Government, Harvard University) will
lead off the conference with a special workshop. He will present thought-
provoking statements about advanced computing in the Social Sciences.
Conference participants will record their thoughts and reactions on a
survey. Dr. Mechling will conclude the conference with a presentation of
the survey results.
TUTORIALS
This conference will offer seven half-day tutorials which reflect advanced
computing technology issues. The offerings are: Knowledge Engineering,
Hypertext, CD-ROM, Networking Technologies, Parallel Computation, Machine
Learning, and Qualitative Analysis. This is an excellent opportunity to
learn more about these current topics and meet with individuals who work in
these fields.
S U M M A R Y O F A G E N D A
TUESDAY, April 10, 1990 - Morning
8:00 - 7:30pm REGISTRATION
CONCURRENT TUTORIALS
8:30 - 11:30 TUTORIAL 1: KNOWLEDGE ENGINEERING
Bruce Buchanan (University of Pittsburgh)
8:30 - 11:30 TUTORIAL 2: HYPERTEXT
Catherine Plaisant (University of Maryland)
8:30 - 11:30 TUTORIAL 3: CD-ROM
James Clark (Bureau of the Census)
TUESDAY, April 10, 1990 - Afternoon
PLENARY SESSION
1:00 - 1:30 OPENING REMARKS
Robert Hammond (Bureau of the Census)
Bruce Tonn (Oak Ridge National Laboratory)
1:30 - 3:00 PANEL 1: STATE OF SOCIAL SCIENCE COMPUTING
3:00 - 3:30 BREAK
3:30 - 4:30 SURVEY 1: CONFERENCE PARTICIPANT SURVEY ON SOCIAL SCIENCE
COMPUTING
Jerry Mechling (Harvard University)
CONCURRENT SESSIONS
4:30 - 6:00 SESSION 1: NATIONAL PROBLEMS SOLVED BY ADVANCED COMPUTING
4:30 - 6:00 SESSION 2: REASONING SYSTEMS
4:30 - 7:30 VENDOR EXHIBITION
TUESDAY, April 10, 1990 - Evening
6:30 - 7:30 RECEPTION
4:30 - 7:30 VENDOR EXHIBITION (continued)
WEDNESDAY, April 11, 1990 - Morning
8:00 - 5:00 REGISTRATION
8:30 - 5:00 VENDOR EXHIBITION
CONCURRENT SESSIONS AND TUTORIAL
8:15 - 11:00 TUTORIAL 4: NETWORKING TECHNOLOGIES
Darlene Fisher (National Science Foundation)
8:15 - 9:45 SESSION 3 (INVITED): 1990 DECENNIAL CENSUS: FACTS AND
FIGURES
8:15 - 9:45 SESSION 4: ARTIFICIAL INTELLIGENCE APPLICATIONS
9:45 - 10:15 BREAK
10:15 - Noon SESSION 5 (INVITED): COMPUTER-ASSISTED MARKET INSTITUTIONS
10:15 - Noon SESSION 6: GEOGRAPHIC INFORMATION SYSTEMS
Noon - 1:30 LUNCH AND SPEAKER
"And What Foul Beast? Of Prospects and Problems in Data
Management and Access," Ken Thibodeau (Director of the
Center for Electronic Records, U.S. National Archives,
Washington, District of Columbia)
WEDNESDAY, April 11, 1990 - Afternoon
8:30 - 5:00 VENDOR EXHIBITION (continued)
CONCURRENT SESSIONS AND TUTORIAL
1:30 - 4:30 TUTORIAL 5: PARALLEL COMPUTATION
Charles Romine and George Ostrouchov (Oak Ridge National
Laboratory)
1:30 - 3:00 TECHNICAL DEMONSTRATIONS
Demonstrations will be presented by presenters and vendors
in repeating 30 minute blocks.
1:30 - 3:00 PANEL 2: NETWORK SIMULATION
3:00 - 3:30 BREAK
3:30 - 5:00 TECHNICAL DEMONSTRATIONS (continued)
3:30 - 5:00 SESSION 7: ADVANCED PC SYSTEMS
CONCURRENT SESSION AND PANEL
5:00 - 6:30 SESSION 8: ADVANCED ARCHITECTURE APPLICATIONS
5:00 - 6:30 PANEL 3: FORMATION OF THE AMERICAN ASSOCIATION FOR SOCIAL
SCIENCE COMPUTING
G. David Garson (North Carolina State University)
WEDNESDAY, April 11, 1990 - Evening
7:00 - 8:30 DINNER AND SPEAKER
"Future Trends in Advanced Computing," Larry Smarr (Director
of the National Center for Supercomupter Applications,
University of Illinois)
THURSDAY April 12, 1990 - Morning
8:00 - Noon REGISTRATION
8:00 - Noon VENDOR EXHIBITION
CONCURRENT SESSIONS, PANEL, AND TUTORIALS
8:00 - 11:00 TUTORIAL 6: MACHINE LEARNING
Gunar Liepins (Oak Ridge National Laboratory)
8:00 - 11:00 TUTORIAL 7: QUALITATIVE ANALYSIS PROGRAMS
Renata Tesch (Qualitative Research Management)
8:00 - 11:00 SESSION 9: ADVANCED COMPUTING AND CENSUS-RELATED
APPLICATIONS
8:00 - 9:15 PANEL 4: COMPUTING FOR LAND USE AND TRANSPORTATION ANALYSIS
9:15 - 9:30 BREAK
9:30 - 11:00 SESSION 10: ADVANCED COMPUTING APPLICATIONS
9:30 -11:00 SESSION 11: DATA ACQUISITION/ELICITATION APPLICATIONS
CONCURRENT SESSION AND PANEL
11:00 - 12:15 PANEL 5: ETHICS AND LARGE DATABASES
11:00 - 12:15 SESSION 12: EXPERT AND TEACHING SYSTEMS
PLENARY SESSION
12:15 - 1:00 SURVEY 2: RESULTS OF CONFERENCE PARTICIPANT SURVEY ON
SOCIAL SCIENCE COMPUTING
Jerry Mechling (Harvard University)
END OF CONFERENCE
CONFERENCE FEES: The registration fee for the Advance Computing for the
Social Sciences conference is $295 if your registration is received on or
before March 2, 1990. Registration after March 2, 1990 will be $345. This
includes admission to all technical sessions, panels, one copy of the
proceedings, refreshments during breaks, lunch on Wednesday, the reception
on Tuesday evening, dinner on Wednesday evening, and admission to the
vendor and demonstration exhibit areas. Lodging is NOT included in the
conference registration fee. Full-time student registration will be $75.00
and includes admission only to all technical sessions and the vendor
demonstration exhibit areas. You will need to present your full-time
student ID at the conference to pick up your registration materials.
TUTORIAL FEES: The registration fee is $150 for each tutorial you choose
to attend. You may register for the tutorials on the pre-registration form
found in the middle of this brochure. Class size is limited and will be
filled on a first-come, first-served basis.
For a complete conference agenda, send an e-mail message to
Lloyd F. ARROWOOD
Oak Ridge National Laboratory
Oak Ridge, Tennessee 37831-6207
LFA @ ORNLSTC.BITNET or LFA @ STC10.CTD.ORNL.GOV
------------------------------
End of NL-KR Digest
*******************
|
| 125.18 | NL-KR Digest V7.3 | HERON::ROACH | TANSTAAFL ! | Fri Feb 02 1990 13:38 | 564 |
| Printed by: Pat Roach Document Number: 010229
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 02-Feb-1990 01:18pm CET
From: AI_INFO
AI_INFO@AIVTX@HERON@MRGATE@HUGHI@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V7.3
NL-KR Digest (Mon Jan 29 09:18:30 1990) Volume 7 No. 3
Today's Topics:
NEW JOURNAL: PHILOSOPHY & AI
Corpus-based MT
NEW BOOK: METATAXIS IN PRACTICE
Meeting Announcement: 2nd Midwest AI + CogSci Conf.
ACL Conference Information
Submissions: [email protected]
Requests, policy: [email protected]
Back issues are available from host archive.cs.rpi.edu [128.213.7.6] 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: [email protected]
Date: Thu, 7 Dec 89 10:41:32 -0500
>From: [email protected] (William J. Rapaport)
Subject: NEW JOURNAL: PHILOSOPHY & AI
Kluwer Academic Publishers announces
PHILOSOPHY AND ARTIFICIAL INTELLIGENCE
An International Journal
Editorial Focus:
Machines and Mentality
Knowledge and its Representation
Epistemic Aspects of Computer Programming
Connectionist Conceptions
Artificial Intelligence and Epistemology
Computer Methodology
Computational Approaches to Philosophical Issues
Philosophy of Computer Science
Simulation and Modeling
Ethical Aspects of Artificial Intelligence
Editor: James H. Fetzer, University of Minnesota, Duluth, MN, USA
Book Review Editor: William J. Rapaport, SUNY Buffalo, Buffalo, NY, USA
PHILOSOPHY AND ARTIFICIAL INTELLIGENCE affords an international forum
for discussion and debate of important and controversial issues concern-
ing significant developments within its areas of editorial focus.
Well-reasoned contributions from diverse theoretical perspectives are
welcome, and every effort will be made to insure their prompt publica-
tion. Among the features that are intended to make this journal dis-
tinctive within the field are these:
o Strong stands on controversial issues are specifically encouraged;
o Important articles exceeding normal journal length may appear;
o Special issues devoted to specific topics will be a regular feature;
o Review essays discussing current problem situations will appear;
o Critical responses to previously published pieces are also invited.
This journal is intended to foster a tradition of criticism within the
AI and philosophical communities on problems and issues of common con-
cern. Its scope explicitly encompasses philosophical aspects of com-
puter science. All submissions will be subject to review. Publication
will begin with a single volume of four issues per year. The first
issue will appear in January 1991.
Contributors should send 4 copies of their manuscript to:
James H. Fetzer, Editor
PHILOSOPHY AND ARTIFICIAL INTELLIGENCE
Department of Philosophy
University of Minnesota
Duluth, MN 55812
USA
[email protected]
Correspondence concerning books for review should be sent to:
William J. Rapaport, Book Review Editor
PHILOSOPHY AND ARTIFICIAL INTELLIGENCE
Center for Cognitive Science
Department of Computer Science
SUNY Buffalo
Buffalo, NY 14260
USA
[email protected]
[email protected]
Subscription information and sample copies will be available from:
Kluwer Academic Publishers Group
P.O. Box 322
3300 AH Dordrecht
The Netherlands
or
Kluwer Academic Publishers
101 Philip Drive
Assinippi Park
Norwell, MA 02061-1667
USA
------------------------------
To: [email protected]
Date: Wed, 17 Jan 90 12:20:02 +0100
>From: Klaus Schubert <[email protected]>
Phone: +31 30 911911
Fax: +31 30 944048
Telex: 40342 bso nl
Subject: Corpus-based MT
******* NEW BOOK ******* NEW BOOK ******* NEW BOOK ******* NEW BOOK ******* NE
Just published:
Victor Sadler:
WORKING WITH ANALOGICAL SEMANTICS:
Disambiguation techniques in DLT.
(= Distributed Language Translation 5)
Dordrecht/Providence: Foris Publications 1989, 256 pp.
67,- guilders softbound
The book can be bought in bookshops or ordered directly from the publisher:
Foris Publications
Postbus 509
NL-3300 AM Dordrecht
Netherlands
Foris Publications USA
P. O. Box 5904
Providence RI 02903
USA
Distributor for Japan:
Toppan Company
Sufunotomo Bldg.
1-6 Kanda Surugadai
Chiyoda-ku
Tokyo 101
Japan
- ------------------------------------------------------------------------------
How can a computer system select the appropriate meaning for a given word,
phrase or sentence in context? More precisely, where machine translation is
concerned, how can the computer select the appropriate expression in the
target language to convey the meaning identified for the source language
expression? And, in the worst case, how can it choose between a number of
virtual synonyms in the target language: e.g. between English "fast, quick,
rapid" and "swift" for the French "rapide"?
The knowledge required for solving such problems ranges all the way from
an acquaintance with language-specific collocations (a "troop" of monkeys,
but a "pride" of lions), to specialized knowledge of the subject matter,
independent of the language in which it is expressed.
Spurred by the ambitious goal of achieving high-quality machine translation
without post-editing, the author adopts an innovative approach based on the
principle of analogy: the expression in focus is matched, in its context,
against candidate examples, also in their context, in a textual knowledge
bank, and the best available match determines the translation.
This book, the second on semantics in the Distributed Language Translation
series, draws heavily on the practical experience of building the prototype
DLT system, completed in 1988. After an exhaustive survey of the various
types of ambiguity, it explains and evaluates the techniques applied in the
prototype system and goes on to offer a detailed design for the production
stage. This design introduces a powerful concept new to machine translation:
the corpus-based Bilingual Knowledge Bank, which integrates in a single
dynamic data structure (a source text linked with its translation) both the
machine dictionary and the representation of the linguistic and
extra-linguistic knowledge necessary for disambiguation.
- ------------------------------------------------------------------------------
Table of Contents
Acknowledgements
Introduction
Part I: Prototype R&D
Chapter 1.
The field: Types of ambiguity relevant to machine translation
1.1 Types and terms
1.1.1 Lexical ambiguity
1.1.2 Relational ambiguity
1.2 The scale of difficulty
Chapter 2.
The background: Development of the prototype architecture
2.1 Dumb syntax, smart semantics
2.2 The knowledge sources
2.2.1 Potential sources
2.2.2 Knowledge sources in the prototype
Chapter 3.
The theory: Assessing plausibility
3.1 What constitutes plausibility?
3.2 Methods of assessing plausibility
3.2.1 The conventional approach: features and primitives
3.2.2 The DLT prototype: collecting the evidence
3.2.3 The first DLT prototype: making meaning explicit
3.2.4 The second DLT prototype: leaving meaning implicit
Chapter 4.
The techniques: Reasoning by analogy
4.1 The word match
4.2 Disambiguating the source language
4.2.1 Lexical choice: the word pair match
4.2.2 The Y match
4.2.3 The X match
4.2.4 Combining the X and Y matches
4.2.5 Combining word pair matches
4.2.6 Resolving relational ambiguities
4.2.7 The disambiguation dialogue
4.3 Disambiguating the intermediate language
4.3.1 Contextual cues in the bilingual dictionary
4.3.2 Word match and expectancy match
4.3.3 Method of the expectancy match
4.3.4 Combining the match scores
4.3.5 Functional disambiguation
Chapter 5.
The evaluation: Tests and limitations
5.1 Some tests of \s-2SWESIL\s+2
5.1.1 Testing the word match function
5.1.2 Testing the word pair match function
5.1.3 The Meijby Test
5.1.4 Applications for referential disambiguation
5.2 The limitations of \s-2SWESIL\s+2
5.2.1 Strategic problems
5.2.2 Limitations on existing functions
5.2.3 Adding new functions
Part II: Design for a production system
Chapter 6.
The Bilingual Knowledge Bank: An integrated knowledge source for
machine translation
6.1 Rationale for a BKB
6.1.1 Objectivity: the corpus as primary knowledge resource
6.1.2 Dictionary building: the need for a bilingual corpus
6.1.3 Reversibility: the use of bilingual context
6.1.4 Consistency: discarding the LKB
6.1.5 Quantity: structuring the corpus
6.1.6 Scope: increasing the breadth of knowledge
6.1.7 Specificity: processing encyclopaedic knowledge
6.1.8 Sensitivity: distinguishing word senses
6.1.9 Productivity: towards full alignment
6.1.10 Dynamicity: updating the knowledge sources
6.1.11 Probability: relativising the frequencies
6.1.12 The conclusion: the need for an on-line corpus
6.1.13 Comparison with other research
6.2 Constructing the BKB
6.2.1 Structural disambiguation
6.2.2 Identifying translation units
6.2.3 Identifying referents
6.3 Advantages and spin-offs of the BKB approach
6.3.1 Basic advantages
6.3.2 The spin-offs
6.3.3 Possible objections
Chapter 7.
Disambiguation with a BKB: Something old and something new, something
borrowed...
7.1 Towards a new process architecture
7.1.1 Selecting the translation units
7.1.2 Challenging the selections
7.1.3 Backtracking
7.2 Examples of (simulated) BKB-based disambiguation
7.2.1 An example of lexical disambiguation
7.2.2 Choosing between TL synonyms
7.2.3 Structural disambiguation
7.2.4 Functional disambiguation
7.2.5 Referential disambiguation
7.3 Principles and techniques
7.3.1 TU selection by the Metataxor
7.3.2 Semantic coherence and the Examiner
7.3.3 Evaluating referential relations
7.3.4 Evaluating functional relations
7.3.5 Backtracking and semantic feedback
7.4 A new look at the disambiguation dialogue
7.4.1 Structural ambiguity
7.4.2 Referential ambiguity
7.4.3 Functional ambiguity
7.4.4 Lexical ambiguity
Chapter 8.
Towards intelligent disambiguation: Inferencing over the BKB
8.1 Inferring indirect referential relations
8.1.1 Inference based on explicit references
8.1.2 Inference in the absence of explicit references
8.2 Recognizing contradictions and inconsistencies
8.3 Exploring deeper implications
8.4 The BKB as a basis for inference procedures
8.4.1 Discovering inference rules
8.4.2 Applying inference rules
8.4.3 The knowledge representation
Chapter 9.
Spin-off: BKBs, MKBs and other animals...
9.1 Other translation environments
9.2 Monolingual knowledge banks
9.3 Database applications
In conclusion
References
Index
*****************************************************************************
------------------------------
To: [email protected]
Date: Mon, 8 Jan 90 13:00:11 +0100
>From: Klaus Schubert <[email protected]>
Phone: +31 30 911911
Fax: +31 30 944048
Telex: 40342 bso nl
Subject: NEW BOOK: METATAXIS IN PRACTICE
******* NEW BOOK ******* NEW BOOK ******* NEW BOOK ******* NEW BOOK ******* NE
Just published:
METATAXIS IN PRACTICE
Dependency syntax for multilingual machine translation
(= Distributed Language Translation 6)
Ed. Dan Maxwell / Klaus Schubert.
Dordrecht/Providence: Foris Publications 1989, 323 pp.
52,- guilders softbound
The book can be bought in bookshops or ordered directly from the publisher:
Foris Publictions
Postbus 509
NL-3300 AM Dordrecht
Netherlands
Foris Publications USA
P. O. Box 5904
Providence RI 02903
USA
Distributor for Japan:
Toppan Company
Sufunotomo Bldg.
1-6 Kanda Surugadai
Chiyoda-ku
Tokyo 101
Japan
- ------------------------------------------------------------------------------
Dependency theory focuses primarily on those grammatical functions that are
directly relevant to translation rather than deriving functions indirectly
from form descriptions. Metataxis is a model for dependency-based transfer
from a source to a target language, which has been implemented in current
prototype versions of the multilingual DLT machine translation system.
Theoretical linguists are sometimes criticized for showing too little
interest in frequent and normal properties of everyday written language and
for being too exclusively preoccupied with rare and marginal phenomena of the
language system. This book is an attempt to take a different perspective.
In the first part of the book, a number of authors from research centres in
Europe and Asia apply the DLT model of dependency syntax to a variety of
structurally diverse languages, thus providing evidence for the
cross-linguistic feasibility of DLT's approach. Indo-European as well as
non-Indo-European languages are described. The emphasis is on a thorough
coverage of the constructions encountered in present-day non-literary texts.
In the second part, two metataxes (transfer syntaxes) that are currently
being used in the DLT machine translation system are described. This part
includes also a contribution dealing with aspects of computational
formalization and implementation of a metataxis system.
- ------------------------------------------------------------------------------
CONTENTS
PART I
Klaus Schubert: Dependency syntax for parsing and generation
Henning Lobin: A dependency syntax of German
Ingrid Schubert: A dependency syntax of Danish
Marek 'Swidzi'nski: A dependency syntax of Polish
Probal Dasgupta: A dependency syntax of Bangla
Kalevi Tarvainen: A dependency syntax of Finnish
G'abor Pr'osz'eky / Ilona Koutny / Bal'azs Wacha: A dependency syntax of
Hungarian
Shigeru Sato: A dependency syntax of Japanese
Klaus Schubert: A dependency syntax of Esperanto
PART II
Klaus Schubert: The theory and practice of metataxis
Dorine Tamis: Esperanto-French metataxis
Dan Maxwell: English-Esperanto metataxis
Job M. van Zuijlen: Aspects of metataxis formalization
Index
*******************************************************************************
------------------------------
To: [email protected]
Date: Thu, 25 Jan 1990 14:05:43 PST
>From: Tim Koschmann <[email protected]>
Subject: Meeting Announcement: 2nd Midwest AI + CogSci Conf.
March 30-April 1
2nd Midwest Artificial Intelligence and
Cognitive Science Society Conference
Contact:
John Dinsmore
Dept. of Computer Science
Southern Illinois University at Carbondale
Carbondale, IL 62901
614/536-2327
e-mail: [email protected]
------------------------------
To: [email protected]
Date: Fri, 26 Jan 90 14:22:45 EST
>From: [email protected] (Don Walker)
Subject: ACL Conference Information
Association for Computational Linguistics
ACL CONFERENCE INFORMATION
January 1990
PREPARATIONS FOR ACL-90 WELL UNDER WAY; 145 PAPERS SUBMITTED
The 28th Annual Meeting of the ACL will be held 6-9 June 1990 at
the University of Pittsburgh. The physical accommodations are
particularly attractive and convenient, with talks, exhibits, and
registration all in close proximity. Program and registration
information will be mailed in late February. The Program Committee
is being chaired by Bob Berwick [MIT AI Laboratory, Room 838, 545
Technology Square, Cambridge, MA 02139 USA; (+1 617) 253-8918;
[email protected]]. Local Arrangements, including exhibits
and demonstrations, are being handled by Rich Thomason [Intelligent
Systems Program, Cathedral of Learning 1004, University of Pittsburgh,
Pittsburgh, PA 15260, USA; (+1 412) 624-5791; [email protected]].
Tutorials are being organized by Dan Flickinger [Hewlett-Packard
Research Laboratories, 1501 Page Mill Road, Palo Alto, CA 94304,
USA; (+1 415) 857-8789; [email protected]].
COLING-90 IN HELSINKI THIS AUGUST; NEW PROGRAM STRUCTURE
COLING-90, the 13th International Conference on Computational
Linguistics will take place in Helsinki, Finland, 20-24 August
1990. The conference will be divided into topical papers on crucial
issues in computational linguistics and brief reports with software
demonstrations. A strong emphasis is placed on controversial
proposals and their resolution. Equal time will be given to
presenting papers and discussing them. A description of the
philosophy of the Program Committee is featured in the forthcoming
issue of The FINITE STRING (Volume 15, Number 4) by the Program
Chair, Hans Karlgren [KVAL, Skeppsbron 26, S-111 30 Stockholm,
SWEDEN; (+46 8) 7896683; coling@ qzcom.bitnet or [email protected]].
Fred Karlsson is responsible for Local Arrangements [Dept of General
Linguistics, University of Helsinki, Hallituskatu 11, SF-00100
Helsinki, FINLAND; (+358 0) 1911; (+358 0) 656591; [email protected]].
Conference management will be handled through Riitta Ojanen [Kaleva
Travel Agency Ltd, Congress Service, Box 312, SF-00121 Helsinki,
FINLAND; (+358 0) 602711; (+358 0) 629019 fax]. Registration
information should be requested directly from Ojanen or Karlsson.
Proceedings will be available through the ACL Office after the
conference.
5TH EUROPEAN CHAPTER IN EAST GERMANY IN APRIL 1991
The Fifth Conference of the European Chapter of the ACL will be
held 9-11 April 1991 in East Berlin. The Program and Local
Arrangements Committees will be chaired by Juergen Kunze and Dorothee
Reimann [Akademie der Wissenschaften der DDR, Zentralinstitut fuer
Sprachwissenschaft, Prenzlauer Promenade 149-152, DDR-1100 Berlin,
GERMAN DEMOCRATIC REPUBLIC; (+37 2) 47 97 153 or 47 97 168; telex:
114713].
BERKELEY SITE SELECTED FOR ACL-91
The 29th Annual Meeting of the ACL will be held 18-21 June 1991 at
the University of California in Berkeley. The Program Committee
will be chaired by Doug Appelt [Artificial Intelligence Center,
SRI International, 333 Ravenswood Road, Menlo Park, CA 94025, USA;
(+1 415) 859-6150; [email protected]]. Responsibility for Local
Arrangements will be shared by Peter Norvig [Division of Computer
Science, University of California, 573 Evans Hall, Berkeley, CA
94720, USA; (+1 415) 642-9533; [email protected]] and Bob
Wilensky [Division of Computer Science, University of California,
571 Evans Hall, Berkeley, CA 94720, USA; (+1 415) 642-7034;
wilensky@teak. berkeley.edu].
3RD APPLIED CONFERENCE SET FOR APRIL 1992 IN ITALY
The 3rd Conference on Applied Natural Language Processing of the
ACL will be held 1-3 April 1992 in Trento, Italy. Oliviero Stock
is Program CoChair and will be responsible for Local Arrangements
[IRST: Istituto per la Ricerca Scientifica e Tecnologica, I-38100
Trento, Loc. Pante di Povo, ITALY; (+39 461) 810105;
stock%[email protected]]. Lyn Bates will be Program CoChair [BBN
Systems & Technologies Corporation, 10 Moulton Street, Cambridge,
MA 02238, USA; (+1 617) 873-3634; [email protected]].
------------------------------
End of NL-KR Digest
*******************
|
| 125.19 | NL-KR Digest V7.1 | HERON::ROACH | TANSTAAFL ! | Fri Feb 02 1990 15:37 | 516 |
| Printed by: Pat Roach Document Number: 010233
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 02-Feb-1990 02:48pm CET
From: AI_INFO
AI_INFO@AIVTX@HERON@MRGATE@HUGHI@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V7.1
NL-KR Digest (Thu Jan 25 12:18:58 1990) Volume 7 No. 1
Today's Topics:
Call for Papers: NATO Conference
Call for papers for CR Workshop
CFP: Pragmatics in AI
Call For Papers - Uncertainty in AI
Submissions: [email protected]
Requests, policy: [email protected]
Back issues are available from host archive.cs.rpi.edu [128.213.7.6] 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.
[[ Welcome to the first late issue of 1990. The next few issues will appear
all at once as I flush out the vacation postings. Apologies for anything
that was late, I have so much backlog I'm not posting things that have
past. I am sending digests out in groups, this issue and the next are
dedicated to CFPs. Note the change in the Internet Address of the
NL-KR archive server. - CW ]]
-----------------------------------------------------------------
To: [email protected]
Date: Tue, 19 Dec 89 23:25:37 EST
>From: [email protected] (David Mark)
Subject: Call for Papers: NATO Conference
Call for Participants:
NATO ADVANCED STUDY INSTITUTE
"COGNITIVE AND LINGUISTIC ASPECTS OF GEOGRAPHIC SPACE"
July 8-20, 1989
Las Navas del Marques, Spain
The Scientific Affairs Division of the North Atlantic Treaty Organization
(NATO) has awarded a grant to support an Advanced Study Institute (ASI)
on the topic of "Cognitive and Linguistic Aspects of Geographic
Space". Subject to final confirmation, this ASI will be conducted
July 8-20, 1990, at Castillo-Palacio "Magalia" in Las Navas del Marques,
Provincia de Avila, Spain. The Director of the ASI is David M. Mark, of the
National Center for Geographic Information and Analysis (NCGIA), Buffalo,
New York, USA; the Associate Director of the Institute is Andrew Frank,
NCGIA, Orono, Maine, USA. The NCGIA is a co-Sponsor of the meeting, and
the official language of the ASI will be English.
The objective of the ASI is to provide high-level instruction and
discussion in areas of cognitive science, linguistics, mathematics, artificial
intelligence, computer science, cartography, anthropology, and behavioral
geography to scholars wishing to improve geographic information systems,
or to use GISs in their basic research on various topics. The ASI also will
provide a forum to extend the research agenda on the topic. Human
geography has a long tradition of concern for spatial cognition, and for the
ways in which mental representations of geographic space influence spatial
behavior. Spatial cognition is also of central concern to cognitive science.
Implementation of cognitively-sound models should lead to improved
geographic information systems (GIS) interfaces, spatial query languages,
and spatial inference methods, and will require application of topology,
geometry, and artificial intelligence. Such models will be crucial in the
removal of impediments to cross-linguistic transfer of GIS technology.
The ASI will begin with introductory lectures on the workshop topic
and on Geographic Information Systems (GIS). Then, invited Lecturers will
present on specific topics. Confirmed lecturers for the ASI include: Mark
Blades, (Psychology, University of Sheffield, England); Maria Catedra Tomas
(Antropologia Social, Universidad Complutense Madrid, Spain); C. Grant Head
(Geography, Wilfrid Laurier University, Canada); John Herring
(Mathematician, Intergraph Corporation, USA); Ewald Lang (Linguistics,
University of Wuppertal, Federal Republic of Germany ); and Amilcar
Sernadas (Departamento de Matematica, Instituto Superior Tecnico,
Portugal). We have tentative indications that the following will also be
lecturers: Jean-Gabriel Ganascia (Universite de Paris Sud, Orsay , France);
Reginald Golledge, (Geography, University of California, Santa Barbara, USA);
Annette Herskovits (Computer Science, Wellesley College, Massachusetts,
USA); George Lakoff (Linguistics & Cognitive Science, University of
California, Berkeley, USA); Zenon Pylyshyn (Psychology, University of
Western Ontario, Canada); and Leonard Talmy (Cognitive Science, University
of California, Berkeley, USA).
Because of the capacity of the site, this ASI is limited to a maximum
of 60 "student" participants. (The term "student" is used by NATO to describe
all ASI participants who are neither invited lecturers nor organizers.)
Ideally, NATO prefers that ASI "students" be of recent post-Doctoral status;
however, they may include senior scholars, current post-graduate students,
or employees of government or private agencies. ASIs are governed by
NATO rules. Among these is a requirement that no more than 20 percent of
the total number of "students" may come from countries outside of NATO,
and no more than 25 percent may come from any particular NATO country.
(For NATO ASI purposes, a person's "country" is defined by current place of
residence and work or study, and not by citizenship.) Thus, we have a quota
of at most 15 additional participants from each NATO country, meaning that
competition for places among potential participants from some NATO
countries will be high. We also have a limited ability to provide financial
support (mainly in the form of living expenses) to participants from NATO
countries. There will be no registration fee for the meeting.
Because places in the ASI are strictly limited, we are proposing a
rigorous application procedure. Anyone wishing to attend the ASI should
submit an application in writing (by electronic mail, FAX, or post), so as to
arrive in Buffalo on or before February 28, 1990. Applications must contain
the following information:
(1) a one page resume or abbreviated curriculum vitae, emphasizing
experience or training relevant to the ASI topic, and including current
country of residence and highest academic degree earned, with year; and
(2) a one page statement of interest, indicating the reason for wishing to
attend the ASI, and the applicant's potential contribution to the ASI.
Persons wishing to present a research paper, which will be rigorously peer-
reviewed for possible inclusion in the ASI Proceedings, should submit with
their application:
(3) a paper title, and a one page abstract or proposal.
However, this is optional, and willingness to present a paper will NOT be a
condition for acceptance into the ASI.
Estimated living costs at "Magalia" for the 13 days of the ASI are $US 655,
including all meals. Since funds from the ASI for participants are limited,
applicants should apply for travel and living expenses other sources.
Persons wishing financial assistance directly from the organizers of the ASI
must submit with their application:
(4) a one page (or less) request for funds, with justification.
For further information, contact David M. Mark at the addresses below. Also,
submit applications to these same addresses:
Electronic Mail: [email protected]
or [email protected]
TeleFAX: 716 636 2329
Telephone: 716 636 2283
Post: David M. Mark
National Center for Geographic Information and Analysis
Department of Geography
415 Fronczak Hall
State University of New York at Buffalo
Buffalo, New York 14260 USA
------------------------------
To: [email protected]
Date: Sun, 24 Dec 89 19:20:58 EST
>From: [email protected] (Susanne M Humphrey)
Subject: Call for papers for CR Workshop
ASIS '90 Workshop on Classification Research
Organized by ASIS Special Interest Group on Classification Research (SIG/CR)
Call for Papers
The American Society for Information Science Special Interest Group on
Classification Research (ASIS SIG/CR) invites submissions for the ASIS '90
Classification Research (CR) Workshop, to be held at the 53d Annual Meeting of
ASIS in Toronto, Canada. The Workshop will take place Sunday, November 4,
1990, 9am - 5pm. ASIS '90 continues through Thursday, November 8.
The Workshop is designed to be an exchange of research ideas by participants,
addressing creation, development, management, representation, display,
comparison, compatibility, theory, and application of classification schemes.
Emphasis will be semantic classification, in contrast to statistically-based
schemes. However, a topic like statistical techniques used for developing
explicit semantic classes, which in turn might be applied to databases, would
be in scope. Topics include, but are not limited to:
- Warrant for concepts in classification schemes.
- Concept acquisition.
- Basis for semantic classes.
- Automated techniques to assist in creating classification schemes.
- Knowledge representation systems.
- Relations and their properties.
- Inheritance and subsumption.
- Classification algorithms.
- Procedural knowledge in classification schemes.
- Reasoning with classification schemes.
- Software for managing classification schemes.
- Interfaces for displaying classification schemes.
- Data structures and programming languages for classification schemes.
- Comparison and compatibility between classification schemes.
- Applications such as subject analysis, natural language understanding,
information retrieval, expert systems
The CR Workshop welcomes submissions from various disciplines. Attendance
will be limited to authors of papers. Those interested in participating are
invited to submit short (2-3 single-space page) position papers, reflecting
substantive work that has been performed in the above areas or other areas
related to semantic classification schemes. Submissions may include
background papers as attachments. Position papers will be published in
proceedings to be distributed prior to the Workshop. Participants are
encouraged to distribute background papers at or prior to the Workshop. Lunch
will not be served; however, refreshments will be available during the day.
Workshop registration fee is $30.
Order of preference for mode of transmitting submissions: [1] Electronic mail
[2] Diskette accompanied by paper copy [3] Paper copy only (fax or postal).
Electronic submissions should be ASCII text; paper-only submissions should be
keyable as ASCII. Submissions should be sent to arrive by May 1, 1990, to:
Susanne Humphrey
Lister Hill National Center for Biomedical Communications
National Library of Medicine
Bldg 38A, Rm 9N903
Bethesda, MD 20894
Internet: [email protected]
Fax: 301-496-0673
Phone: 301-496-9300
For additional information, contact the CR Workshop Co-Chairs, Susanne
Humphrey, as above, or Barbara Kwasnik, School of Information Studies, 4-206
Center for Science and Technology, Syracuse University, Syracuse, NY
13244-4100, e-mail [email protected], fax 315-443-1954, telephone
351-443-4547 (direct office) or 351-443-2911 (department office).
------------------------------
To: [email protected]
>From: [email protected]
Date: Tue, 9 Jan 90 23:00:42 MST
Subject: CFP: Pragmatics in AI
[[ This is a revised version of the CFP posted in V6N44 - CW ]]
CALL FOR PAPERS
Pragmatics in Artificial Intelligence
5th Rocky Mountain Conference on Artificial Intelligence (RMCAI-90)
Las Cruces, New Mexico, USA, June 28-30, 1990
PRAGMATICS PROBLEM:
The problem of pragmatics in AI is one of developing theories, models,
and implementations of systems that make effective use of contextual
information to solve problems in changing environments.
CONFERENCE GOAL:
This conference will provide a forum for researchers from all
subfields of AI to discuss the problem of pragmatics in AI.
The implications that each area has for the others in tackling
this problem are of particular interest.
COOPERATION:
American Association for Artificial Intelligence (AAAI)
Association for Computing Machinery (ACM)
Special Interest Group in Artificial Intelligence (SIGART)
IEEE Computer Society
U S WEST Advanced Technologies and the Rocky Mountain Society
for Artificial Intelligence (RMSAI)
SPONSORSHIP:
Association for Computing Machinery (ACM)
Special Interest Group in Artificial Intelligence (SIGART)
U S WEST Advanced Technologies and the Rocky Mountain Society
for Artificial Intelligence (RMSAI)
INVITED SPEAKERS:
The following researchers have agreed to present papers
at the conference:
*Martin Casdagli, Los Alamos National Laboratory, Los Alamos USA
*Arthur Cater, University College Dublin, Ireland EC
*Jerry Feldman, University of California at Berkeley, Berkeley USA
& International Computer Science Institute, Berkeley USA
*Barbara Grosz, Harvard University, Cambridge USA
*James Martin, University of Colorado at Boulder, Boulder USA
*Derek Partridge, University of Exeter, United Kingdom EC
*Philip Stenton, Hewlett Packard, United Kingdom EC
*Robert Wilensky, University of California at Berkeley Berkeley USA
THE LAND OF ENCHANTMENT:
Las Cruces, lies in THE LAND OF ENCHANTMENT (New Mexico),
USA and is situated in the Rio Grande Corridor with the scenic
Organ Mountains overlooking the city. The city is
close to Mexico, Carlsbad Caverns, and White Sands National Monument.
There are a number of Indian Reservations and Pueblos in the Land Of
Enchantment and the cultural and scenic cities of Taos and Santa Fe
lie to the north. New Mexico has an interesting mixture of Indian, Mexican
and Spanish culture. There is quite a variation of Mexican and New
Mexican food to be found here too.
GENERAL INFORMATION:
The Rocky Mountain Conference on Artificial Intelligence is a major
regional forum in the USA for scientific exchange and presentation
of AI research.
The conference emphasizes discussion and informal interaction
as well as presentations.
The conference encourages the presentation of completed research,
ongoing research, and preliminary investigations.
Researchers from both within and outside the region
are invited to participate.
Some travel awards will be available for qualified applicants.
FORMAT FOR PAPERS:
Submitted papers should be double spaced and no more than 5 pages
long. E-mail versions will not be accepted. Papers will be published
in the proceedings and there is the possibility of a published book.
Send 3 copies of your paper to:
Paul Mc Kevitt,
Program Chairperson, RMCAI-90,
Computing Research Laboratory (CRL),
Dept. 3CRL, Box 30001,
New Mexico State University,
Las Cruces, NM 88003-0001, USA.
DEADLINES:
Paper submission: April 1st, 1990
Pre-registration: April 1st, 1990
Notice of acceptance: May 1st, 1990
Final papers due: June 1st, 1990
LOCAL ARRANGEMENTS:
Local Arrangements Chairperson, RMCAI-90.
(same postal address as above).
INQUIRIES:
Inquiries regarding conference brochure and registration form
should be addressed to the Local Arrangements Chairperson.
Inquiries regarding the conference program should be addressed
to the Program Chairperson.
Local Arrangements Chairperson: E-mail: INTERNET: [email protected]
Phone: (+ 1 505)-646-5466
Fax: (+ 1 505)-646-6218.
Program Chairperson: E-mail: INTERNET: [email protected]
Phone: (+ 1 505)-646-5109
Fax: (+ 1 505)-646-6218.
TOPICS OF INTEREST:
You are invited to submit a research paper addressing Pragmatics
in AI, with any of the following orientations:
Philosophy, Foundations and Methodology
Knowledge Representation
Neural Networks and Connectionism
Genetic Algorithms, Emergent Computation, Nonlinear Systems
Natural Language and Speech Understanding
Problem Solving, Planning, Reasoning
Machine Learning
Vision and Robotics
Applications
PROGRAM COMMITTEE:
*John Barnden, New Mexico State University
(Connectionism, Beliefs, Metaphor processing)
*Hans Brunner, U S WEST Advanced Technologies
(Natural language interfaces, Dialogue interfaces)
*Martin Casdagli, Los Alamos National Laboratory
(Dynamical systems, Artificial neural networks, Applications)
*Mike Coombs, New Mexico State University
(Problem solving, Adaptive systems, Planning)
*Thomas Eskridge, Lockheed Missile and Space Co.
(Analogy, Problem solving)
*Chris Fields, New Mexico State University
(Neural networks, Nonlinear systems, Applications)
*Roger Hartley, New Mexico State University
(Knowledge Representation, Planning, Problem Solving)
*Victor Johnson, New Mexico State University
(Genetic Algorithms)
*Paul Mc Kevitt, New Mexico State University
(Natural language interfaces, Dialogue modeling)
*Joe Pfeiffer, New Mexico State University
(Computer Vision, Parallel architectures)
*Keith Phillips, University of Colorado at Colorado Springs
(Computer vision, Mathematical modelling)
*Yorick Wilks, New Mexico State University
(Natural language processing, Knowledge representation)
*Scott Wolff, U S WEST Advanced Technologies
(Intelligent tutoring, User interface design, Cognitive modeling)
REGISTRATION:
Pre-Registration: Professionals: $50.00; Students $30.00
(Pre-Registration cutoff date is April 1st 1990)
Registration: Professionals: $70.00; Students $50.00
(Copied proof of student status is required).
Registration form (IN BLOCK CAPITALS).
Enclose payment made out to New Mexico State University.
(ONLY checks in US dollars will be accepted).
Send to the following address (MARKED REGISTRATION):
Local Arrangements Chairperson, RMCAI-90
Computing Research Laboratory
Dept. 3CRL, Box 30001, NMSU
Las Cruces, NM 88003-0001, USA.
Name:_______________________________ E-mail_____________________________
Phone__________________________
Affiliation: ____________________________________________________
Fax: ____________________________________________________
Address: ____________________________________________________
____________________________________________________
____________________________________________________
COUNTRY__________________________________________
Organizing Committee RMCAI-90:
Paul Mc Kevitt Yorick Wilks
Research Scientist Director
CRL CRL
cut------------------------------------------------------------------------
------------------------------
To: [email protected]
Subject: Call For Papers - Uncertainty in AI
Reply-To: [email protected]
Date: Wed, 10 Jan 90 11:44:22 PST
>From: [email protected]
CALL FOR PAPERS:
SIXTH CONFERENCE ON UNCERTAINTY IN AI
Cambridge, Mass.,
July 27th-29th, 1990
(preceding the AAAI-90 Conference)
DEADLINE: MARCH 12, 1990
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
The sixth annual Conference on Uncertainty in AI is concerned with the
full gamut of approaches to automated and interactive reasoning and
decision making under uncertainty, including both quantitative and
qualitative methods.
We invite original contributions on fundamental theoretical issues, on
the development of software tools embedding approximate reasoning
theories, and on the validation of such theories and technologies on
challenging applications. Topics of particular interest include:
- - Semantics of qualitative and quantitative uncertainty representations
- - The role of uncertainty in deductive, abductive, defeasible, or
analogical (case-based) reasoning
- - Control of reasoning; planning under uncertainty
- - Comparison and integration of qualitative and quantitative schemes
- - Knowledge engineering tools and techniques for building approximate
reasoning systems
- - User Interface: explanation and summarization of uncertain infromation
- - Applications of approximate reasoning techniques
Papers will be carefully refereed. All accepted papers will be
included in the proceedings, which will be available at the
conference. Papers may be accepted for presentation in plenary
sessions or poster sessions.
Four copies of each paper should be sent to the Program Chair by March
12, 1990. Acceptance will be sent by May 4, 1990. Final
camera-ready papers, incorporating reviewers' comments, will be due by
May 31, 1990. There will be an eight page limit on the camera-ready
copy (with a few extra pages available for a nominal fee.)
- ---------------------------------------------------------------------------
Program Chair: General Chair:
Piero P. Bonissone, UAI-90 Max Henrion,
General Electric Rockwell Science Center,
Corporate Research and Development, Palo Alto Facility,
1 River Rd., Bldg. K1-5C32A, 444 High Street,
Schenectady, NY 12301 Palo Alto, Ca 94301
(518) 387-5155 (415) 325-1892
[email protected] [email protected]
Program Committee: Peter Cheeseman, Paul Cohen, Laveen Kanal, Henry Kyburg,
John Lemmer, Tod Levitt, Ramesh Patil, Judea Pearl, Enrique Ruspini,
Glenn Shafer, Lofti Zadeh
------------------------------
End of NL-KR Digest
*******************
|
| 125.20 | NL-KR Digest V7.4 | HERON::ROACH | TANSTAAFL ! | Fri Feb 02 1990 16:16 | 555 |
| Printed by: Pat Roach Document Number: 010235
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 02-Feb-1990 04:03pm CET
From: AI_INFO
AI_INFO@AIVTX@HERON@MRGATE@HUGHI@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V7.4
NL-KR Digest (Tue Jan 30 09:53:35 1990) Volume 7 No. 4
Today's Topics:
CORRECTION: Minds and Machines CFP
Obtaining Brown's Corpus on-line or otherwise
Research Assistantships available
Request for stem forms of English words.
extracting design information from CAD databases into knowledge editor
word frequencies
Chart-Parsers/Feature based grammars
refs on bach-peters sentences
Help: NLP, parsing, benchmarks wanted
Diagnosis Workshop
Submissions: [email protected]
Requests, policy: [email protected]
Back issues are available from host archive.cs.rpi.edu [128.213.7.6] 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: [email protected]
Date: Mon, 29 Jan 90 09:58:09 EST
>From: [email protected] (William J. Rapaport)
Subject: CORRECTION: Minds and Machines CFP
[[ Seems I published two announcements (both sent by WJR) about Kluwer's
new journal, but I published the earlier, incorrect, version AFTER
the later, correct one! This is the correct one - CW ]]
========================================================================
CALL FOR PAPERS---CALL FOR PAPERS---CALL FOR PAPERS---CALL FOR PAPERS
========================================================================
Kluwer Academic Publishers announces
MINDS AND MACHINES
Journal for Artificial Intelligence, Philosophy, and Cognitive Science
ISSN 0924-6495
(previously announced as `Philosophy and Artificial Intelligence')
EDITORIAL FOCUS:
Machines and Mentality
Knowledge and its Representation
Epistemic Aspects of Computer Programming
Connectionist Conceptions
Artificial Intelligence and Epistemology
Computer Methodology
Computational Approaches to Philosophical Issues
Philosophy of Computer Science
Simulation and Modeling
Ethical Aspects of Artificial Intelligence
EDITOR:
James H. Fetzer, University of Minnesota, Duluth, MN, USA
BOOK REVIEW EDITOR:
William J. Rapaport, SUNY Buffalo, Buffalo, NY, USA
EDITORIAL BOARD (as of January 1990)
Jon Barwise Stanford University, USA
Andy Clark University of Sussex, UK
Robert Cummins University of Arizona, USA
Jerry Fodor Rutgers University, USA
Clark Glymour Carnegie-Mellon University, USA
John Haugeland University of Pittsburgh, USA
Jaakko Hintikka Florida State University, USA
David Israel SRI International, USA
Frank Keil Cornell University, USA
Henry Kyburg University of Rochester, USA
John McCarthy Stanford University, USA
Donald Nute University of Georgia, USA
Zenon Pylyshyn University of Western Ontario, Canada
Barry Richards Imperial College, London, UK
Roger C. Schank Northwestern University, USA
John Searle University of California, Berkeley, USA
Stephen Stich Rutgers University, USA
Terry Winograd Stanford University, USA
MINDS AND MACHINES affords an international forum for discussion and
debate of important and controversial issues concerning significant
developments within its areas of editorial focus. Well-reasoned
contributions from diverse theoretical perspectives are welcome, and
every effort will be made to insure their prompt publication. Among the
features that are intended to make this journal distinctive within the
field are these:
o Strong stands on controversial issues are specifically encouraged;
o Important articles exceeding normal journal length may appear;
o Special issues devoted to specific topics will be a regular feature;
o Review essays discussing current problem situations will appear;
o Critical responses to previously published pieces are also invited.
This journal is intended to foster a tradition of criticism within the
AI and philosophical communities on problems and issues of common
concern. Its scope explicitly encompasses philosophical aspects of
computer science. All submissions will be subject to review.
Publication will begin with a single volume of four issues per year.
The first issue will appear in January 1991.
Contributors should send 4 copies of their manuscript to:
James H. Fetzer, Editor
MINDS AND MACHINES
Department of Philosophy
University of Minnesota
Duluth, MN 55812
USA
[email protected]
[email protected]
Correspondence concerning books for review should be sent to:
William J. Rapaport, Book Review Editor
MINDS AND MACHINES
Center for Cognitive Science
Department of Computer Science
SUNY Buffalo
Buffalo, NY 14260
USA
[email protected]
[email protected]
Subscription information and sample copies will be available from:
Kluwer Academic Publishers Group
P.O. Box 322
3300 AH Dordrecht
The Netherlands
or
Kluwer Academic Publishers
101 Philip Drive
Norwell, MA 02061
USA
========================================================================
CALL FOR PAPERS---CALL FOR PAPERS---CALL FOR PAPERS---CALL FOR PAPERS
========================================================================
------------------------------
To: [email protected]
Date: Thu, 7 Dec 89 10:33:12 PST
>From: [email protected] (Michelle K. Gross)
Subject: Obtaining Brown's Corpus on-line or otherwise
Using a wide variety of printed sources, Francis and Kucera did work on the
frequency of occurrence of English words. I am unable to find a version
of this available in electronic format. I am also unable to locate the
copyright holder, if any, of their work, known as Brown's Corpus. A group of
us might be willing to create an electronic version of this if we knew it was
otherwise unavailable.
If you know who has the copyright or where to find an on-line version of
Brown's corpus, please contact me. Thanks,
Michelle Gross (619) 553-4953
Naval Ocean Systems Center
Code 854
San Diego, Ca 92152-5000
[email protected]
------------------------------
To: [email protected]
>From: [email protected]
Subject: Research Assistantships available
Date: Wed, 27 Dec 89 14:46:44 EST
Several research assistantships are available in the Intelligent Engineering
Systems Laboratory in the Department of Civil Engineering at M.I.T. Research
areas include: Real time AI, Cooperative Product Development,
Computer-Aided Presentation (Multi-Media), Large Object Oriented
Knowledge/Databases, Parallel Computing. Applicants should have a background in
engineering and computer science and should have interest in pursuing a Ph.D.
Interested persons should contact:
Prof. Logcher
Intelligent Engineering Systems Laboratory
Dept of Civil Engineering
M.I.T., Cambridge, MA 02139
e-mail: [email protected]
------------------------------
To: [email protected]
>From: [email protected] (H.Shrikumar{[email protected]})
Newsgroups: comp.ai.nlang-know-rep
Subject: Request for stem forms of English words.
Keywords: stem forms, nlp, natural language
Date: 12 Jan 90 21:48:28 GMT
Reply-To: [email protected] ( [email protected] )
I guess that this newsgroup concerns itself with Natural Language
Understanding, Computational Linguistics, AI etc etc If not, I would
appriciate directions to other newsgroups/mailing lists.
My colleagues at the NCST, Bombay, India are looking for a list of the
stem forms of general english words. (estimated to be 4000-5000).
Here's a request from them.
- -----:<-----
Hi folks.
We are a group of people working on two projects in NL. at
National Centre for Software Technology, Bombay, India; which is
involved in AI research.
Are you working on large corpuses within a NLP project? If so,
could you kindly provide, if possible, the list of the most
useful set of STEM forms of general English words which can be
utilized in a reasonably large scale NL system.(eg Information
Retrieval, Machine Translation).
We can be contacted on E-mail at
[email protected]
Please reply by E-mail only. Thanks a lot.
- -----:<-----
They *do* have e-mail access, but not access to netnews. Please
respond to them at the address given above, or to me - I will be glad
to help out/forward your mail to them. I do have access to the Internet
(FTP etc.) so such info is also welcome.
Thanx in advance.
- - shrikumar ( [email protected], [email protected] )
------------------------------
To: [email protected]
Date: Wed, 17 Jan 90 09:35 EST
>From: VENTURA%[email protected]
Subject: extracting design information from CAD databases into knowledge editor
Is anyone working on extracting design information from CAD
databases for automatic/semi-automatic import into a knowledge editor?
Any information on this topic would be greatly appreciated.
Cheryl Ventura Conway
[email protected]
------------------------------
To: [email protected]
>From: [email protected] (Ross Wilkinson)
Newsgroups: comp.ai.nlang-know-rep
Subject: word frequencies
Date: 18 Jan 90 04:13:47 GMT
Does anyone know of a source of frequencies of words in a very large
corpus of ordinary English? They would be useful in some research I am
conducting in information retrieval. Thanks for any help.
Ross Wilkinson, Computer Science, ACSnet:[email protected]
R.M.I.T. ARPA: ross%[email protected]
GPO BOX 2476 V, CSNET: ross%goanna.cs.rmit.oz.au@australia
Melbourne, 3001, AUSTRALIA UUCP: ...!uunet!goanna.cs.rmit.oz.au!ross
------------------------------
To: [email protected]
Date: Tue, 23 Jan 90 11:15:40 GMT
>From: Jorag Forster
<forster%[email protected]>
Subject: Chart-Parsers/Feature based grammars
We are in the process of developing a chart parser using a feature based
grammar. Our parser is implemented in C which makes it fairly small, portable
and fast. In order to achieve this speed, we have had to impose certain
limitations; the most important of which is that the features are pre-defined
and atomic. But, we do allow negation of features (person:~first would allow
person:second and person:third but not person:first) and LHS-recursive rules.
To assess our parser, we are interested in some type of benchmarks. What we
want are run time results for several chart parsers all using the same small
grammar and test sentences. This would give us a grammar-independent rating
for our parser. We would then like to compare this with the results of having
them use their own grammars to parse identical sentences.
We are thankful for all suggestions in this matter and would
appreciate contact with others in this field.
Jorg Forster
Department of Computing Science
University of Aberdeen
Aberdeen, AB9 2UB
Scotland
Email: JANET: [email protected]
Internet: forster%[email protected]
EARN/BITNET: forster%cs.aberdeen.ac.uk@UKACRL
UUCP: forster%[email protected]
------------------------------
To: [email protected]
>From: [email protected] (Dan Hardt)
Newsgroups: comp.ai.nlang-know-rep
Subject: refs on bach-peters sentences
Date: 23 Jan 90 23:35:55 GMT
Reply-To: [email protected] (Dan Hardt)
I am looking for references on "Bach-Peters" sentences, eg,
"The man who deserved it got the prize he wanted." As I
understand it, the defining feature of such sentences is
that they have two NPs which are referentially dependent upon
each other.
Any information would be appreciated.
dan
------------------------------
To: [email protected]
>From: vandyke <@sun.acs.udel.edu:[email protected] (Julie A Vandyke)>
Newsgroups: sci.lang,misc.wanted,comp.ai,comp.misc,comp.ai.nlang-know-rep
Subject: Help: NLP, parsing, benchmarks wanted
Date: 25 Jan 90 17:01:25 GMT
Hello.
I am looking for a benchmark or an accepted standard group of
sentences that a parser should parse (if a parser could parse parses... Oops,
sorry.) to be considered adequate. Does such a thing exist? Could anyone
out there direct me to information on theis? Email prefered, but not
necessary. Thanx in advance for all the help.
- - Julie Van Dyke
e-mail to [email protected]
------------------------------
To: [email protected]
>From: [email protected]
Date: Fri, 26 Jan 90 14:02:26 MST
_________________________________________________________________________
The following are abstracts of papers appearing in the fourth issue
of the Journal of Experimental and Theoretical Artificial
Intelligence, which appeared in November, 1989. The next issue, 2(1),
will be published in March, 1990.
For submission information, please contact either of the editors:
Eric Dietrich Chris Fields
PACSS - Department of Philosophy Box 30001/3CRL
SUNY Binghamton New Mexico State University
Binghamton, NY 13901 Las Cruces, NM 88003-0001
[email protected] [email protected]
JETAI is published by Taylor & Francis, Ltd., London, New York, Philadelphia
_________________________________________________________________________
Problem solving architecture at the knowledge level.
Jon Sticklen, AI/KBS Group, CPS Department, Michigan State University,
East Lansine, MI 48824, USA
The concept of an identifiable "knowledge level" has proven to be
important by shifting emphasis from purely representational issues to
implementation-free decsriptions of problem solving. The knowledge
level proposal enables retrospective analysis of existing
problem-solving agents, but sheds little light on how theories of
problem solving can make predictive statements while remaining aloof
from implementation details. In this report, we discuss the knowledge
level architecture, a proposal which extends the concepts of Newell
and which enables verifiable prediction. The only prerequisite for
application of our approach is that a problem solving agent must be
decomposable to the cooperative actions of a number of more primitive
subagents. Implications for our work are in two areas. First, at the
practical level, our framework provides a means for guiding the
development of AI systems which embody previously-understood
problem-solving methods. Second, at the foundations of AI level, our
results provide a focal point about which a number of pivotal ideas of
AI are merged to yield a new perspective on knowledge-based problem
solving. We conclude with a discussion of how our proposal relates to
other threads of current research.
With commentaries by:
William Clancy: "Commentary on Jon Stcklen's 'Problem solving
architecture at the knowledge level'".
James Hendler: "Below the knowledge level architecture".
Brian Slator: "Decomposing meat: A commentary on Sticklen's 'Problem
solving architecture at the knowledge level'".
and Sticklen's response.
__________________________________________________________________________
Natural language analysis by stochastic optimization: A progress
report on Project APRIL
Geoffrey Sampson, Robin Haigh, and Eric Atwell, Centre for Computer
Analysis of Language and Speech, Department of Linguistics &
Phonetics, University of Leeds, Leeds LS2 9JT, UK.
Parsing techniques based on rules defining grammaticality are
difficult to use with authentic natural-language inputs, which are
often grammatically messy. Instead, the APRIL systems seeks a
labelled tree structure which maximizes a numerical measure of
conformity to statistical norms derived from a sample of parsed text.
No distinction between legal and illegal trees arises: any labelled
tree has a value. Because the search space is large and has an
irregular geometry, APRIL seeks the best tree using simulated
annealing, a stochastic optmization technique. Beginning with an
arbitrary tree, many randomly-generated local modifications are
considered and adopted or rejected according to their effect on
tree-value: acceptance decisions are made probabilistically, subject
to a bias against adverse moves which is very weak at the outset but
is made to increase as the random walk through the search space
continues. This enables the system to converge on the global optimum
without getting trapped in local optima. Performance of an early
verson of the APRIL system on authentic inputs had been yielding
analyses with a mean accuracy of 75%, using a schedule which increases
processing linearly with sentence length; modifications currently
being implemented should eliminate many of the remaining errors.
_________________________________________________________________________
On designing a visual system
(Towards a Gibsonian computational model of vision)
Aaron Sloman, School of Cognitive and Computing Sciences, University
of Sussex, Brighton, BN1 9QN, UK
This paper contrasts the standard (in AI) "modular" theory of the
nature of vision with a more general theory of vision as involving
multiple functions and multiple relationships with other subsystems of
an intelligent system. The modular theory (e.g. as expounded by Marr)
treats vision as entirely, and permanently, concerned with the
production of a limited range of descriptions of visual surfaces, for
a central database; while the "labyrithine" design allows any
output that a visual system can be trained to associate reliably with
features of an optic array and allows forms of learning that set up
new communication channels. The labyrithine theory turns out to have
much in common with J. J. Gibson's theory of affordances, while not
eschewing information processing as he did. It also seems to fit
better than the modular theory with neurophysiological evidence of
rich interconnectivity within and between subsystems in the brain.
Some of the trade-offs between different designs are discussed in
order to provide a unifying framework for future empirical
investigations and engineering design studies. However, the paper is
more about requirements than detailed designs.
________________________________________________________________________
------------------------------
To: [email protected]
Date: Mon, 8 Jan 90 09:54 PST
>From: Walter Hamscher <[email protected]>
Subject: Diagnosis Workshop
International Workshop on Principles of Diagnosis
Menlo Park, California, July 23-24-25, 1990
Call for Papers
This workshop encourages intensive and high quality interaction
and cooperation among researchers with a diversity of artificial
intelligence approaches to diagnosis. Attendance will be
limited to thirty participants, with fifteen presentations
spread over three days. Substantial time will be reserved for
discussion.
To attend, participants should submit extended abstracts or
short papers to be reviewed by the committee. Submissions are
welcomed in the areas of:
- Approaches to modeling and diagnosing both engineered and
natural systems, especially analog and large scale systems
- Theoretical aspects of deductive and abductive diagnosis
- Strategies for controlling diagnostic reasoning to prevent
combinatorial explosion
Please limit your submissions to 3000 words. Accepted papers
can be revised and expanded for compilation and distribution to
the workshop participants. Although work published elsewhere is
acceptable, new original work is preferred.
Please send four copies of each submission to the chairman at
the postal address below. Please include several ways of
contacting the principal author in addition to a postal address:
electronic mail addresses, FAX, and telephone numbers are
preferred, in that order. Please indicate with your submission
whether you wish to make a presentation or only to attend; in
the case of multiple authors please indicate which authors wish
to participate.
Submissions received after 30 March 1990 will not be considered.
The decisions of the committee will be mailed 25 May 1990.
Chairman: Walter Hamscher
Price Waterhouse Technology Centre
68 Willow Road, Menlo Park, CA 94025
E-mail: [email protected] or [email protected]
Telephone: (415) 688-6669
Committee: Randall Davis (MIT), Johan de Kleer (Xerox), Judea
Pearl (UCLA), Olivier Raiman (IBM), James Reggia
(U of Maryland), Ray Reiter (U of Toronto), Peter
Struss (Siemens), Peter Szolovits (MIT), and Brian
Williams (Xerox).
This workshop is sponsored by AAAI and Price Waterhouse.
------------------------------
End of NL-KR Digest
*******************
|
| 125.21 | NL-KR Digest V7.5 | HERON::ROACH | TANSTAAFL ! | Tue Feb 06 1990 14:15 | 536 |
| Printed by: Pat Roach Document Number: 010238
--------------------------------------------------------------------------------
I N T E R O F F I C E M E M O R A N D U M
Date: 02-Feb-1990 05:35pm CET
From: AI_INFO
AI_INFO@AIVTX@HERON@MRGATE@HUGHI@VBO
Dept:
Tel No:
TO: ROACH@A1NSTC
Subject: NL-KR Digest V7.5
NL-KR Digest (Tue Jan 30 12:36:20 1990) Volume 7 No. 5
Today's Topics:
Special CSLI Issue of NL-KR
New Visitor
New Visitor
Language Acquisition Interest Group Meetings
Abstracts for Workshop on 14 December 1989
Seminar on Computers, Design, and Work - Wed, 31 Jan, 12:15
CSLI Calendar, 25 January, vol. 5:14
Submissions: [email protected]
Requests, policy: [email protected]
Back issues are available from host archive.cs.rpi.edu [128.213.7.6] 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: [email protected]
Date: Thu, 7 Dec 89 09:51:46 PST
>From: [email protected] (Ingrid Deiwiks)
Subject: New Visitor
CAROL NEIDLE
BOSTON UNIVERSITY
Carol Neidle is visiting Xerox PARC and CSLI for six months. She is
on sabbatical leave from Boston University, where she is Associate
Professor and Director of the Program in Applied Linguistics. Her
interests include Russian syntax (she is author of _The Role of Case
in Russian Syntax_, D. Reidel, 1988) and computational tools for
linguistic analysis. At Xerox, she will be working on problems related
to machine translation between English and French. She can be reached
at [email protected] or (415) 494-4726.
------------------------------
To: [email protected]
Date: Mon, 8 Jan 90 15:09:33 PST
>From: [email protected] (Ingrid Deiwiks)
Subject: New Visitor
MICHIO ISODA
Industrial Affiliates Program Visiting Researcher
WACOM Co. Ltd., Japan
Dates of visit: January 1990-December 1990
Michio is interested in machine(-aided) translation (MAT) and lexical
knowledge base (LKB). While at CSLI, he would like to import the
results of contemporary linguistics theories into MAT and LKB in order
to build simpler, more flexible systems. His research interests also
include related topics, such as language-knowledge acquisition and the
application of techniques that have been developed in the context of
research on MAT.
------------------------------
To: [email protected]
Date: Fri, 19 Jan 90 11:35:48 PST
>From: [email protected] (Ingrid Deiwiks)
Subject: Language Acquisition Interest Group Meetings
LANGUAGE ACQUISITION INTEREST GROUP
At noon on the dates below
Building 100, Greenberg Room
Tue, 23 Jan Acquisitional Principles in Lexical Development
Eve Clark
Tue, 6 Feb Workshop on Steve Pinker's Theory of the Acquisition
of Argument Structures
Jess Gropen
Readings:
(1) Pinker, S. 1987. Resolving a Learnability
Paradox in the Acquisition of the Verb Lexicon.
Lexicon Project Working Paper, 17. (Cambridge,
Mass.: MIT Center for Cognitive Science.)
(2) Pinker, S. 1989. Learnability and Cognition.
Tue, 20 Feb Temporality in Untutored Adult Second Language
Acquisition: Functional Approach to Data Analysis
Marya Teutsch-Dwyer
Tue, 6 Mar To be announced
EVERYONE IS WELCOME!
If you have any questions or have a paper you'd like to present,
please send email to m.mahout@macbeth.
------------------------------
To: [email protected]
Date: Wed, 13 Dec 89 16:07:10 PST
>From: [email protected] (Ingrid Deiwiks)
Subject: Abstracts for Workshop on 14 December 1989
MINI-WORKSHOP ON "THERE" CONSTRUCTIONS IN GERMANIC LANGUAGES
Thursday, 14 December 1989
9:30 a.m. to 1:00 p.m.
CSLI, Cordura 100
ABSTRACTS
The Yiddish Correlate of THERE-Sentences
Ellen Prince
Alongside of canonical sentences like (1), Yiddish has sentences like (2):
(1) oykh di yamen hobn breges
also the seas have shores
(2) es hobn breges oykh di yamen (S. Kaczerginski)
it have shores also the seas
This paper investigates the discourse functions of sentences like (2),
i.e., sentences with postposed subjects and with a dummy in initial
position. The study is based on a corpus of over 9000 naturally
occurring clauses. It is argued that such sentences are used when the
subject does not represent an entity that is already evoked in the
current discourse-stretch. That is, (2) may occur just in case "the
seas" is not a member of the set of Forward-looking centers (Grosz,
Joshi, and Weinstein 1987, Kameyama 1985) of the previous
discourse-segment. Thus, definites may occur, as above, in contrast
to cognate sentences in many other Germanic languages (e.g., Eng.),
where subjects must not represent entities assumed to be known to the
hearer and are therefore indefinite, and where the verb is limited to
existential and presentational types (Milsark 1976, Perlmutter and
Zaenen 1984; pace Safir 1985). Thus we see that the syntactic form of
an utterance can be exploited -- in different ways in different
languages -- to guide the hearer in the referential processing of a
text.
Lexical Restrictions on Existentials
Joan Maling
Brandeis University
The purpose of this paper is to investigate the mapping between verbal
arguments and the syntax in existential sentences in Swedish and
Icelandic. The focus is how to characterize the well-known syntactic
restriction barring transitive verbs from existential sentences in
Swedish (and English) but not in Icelandic (or German). This
difference correlates with the syntactic status of the dummy pronoun
(Platzack 1983): since the dummy is a grammatical subject in Swedish,
it blocks the mapping of any verbal argument to the SUBJ function. I
will show that the restriction against transitive verbs cannot be
formulated in terms of the number of NP-arguments per se, since there
exist monadic predicates that are not allowed, and dyadic predicates
that are allowed. The intransitive verb classes that occur in the
existential construction in Swedish are reminiscent of those that
undergo Locative Inversion in Chichewa (Bresnan and Kanerva 1989):
e.g., verbs of motion, unaccusatives, and passives. In essence, the
dummy det is compatible with those verbs containing an argument that
can be mapped onto S/O (typically a theme). In Icelandic, since the
dummy pronoun is not itself a grammatical subject, the SUBJ function
is available; however, the same distinctions are seen in terms of
which arguments must be realized external to the VP. Theme arguments
appear to violate the Subject Condition in Icelandic: they can always
be assigned to OBJ even when they are the highest (or only) thematic
role. The data supports the view that the mapping between thematic
roles and the syntax is mediated by grammatical functions, and bears
on the analysis of double object verbs in Germanic languages.
Noninitial Subject in Dutch
Annie Zaenen
In this talk, I will argue that the agreeing NP is the subject and
that er is a locative dummy stuck in topic position.
------------------------------
To: [email protected]
Date: Mon, 29 Jan 90 10:10:20 PST
>From: [email protected] (Ingrid Deiwiks)
Subject: Seminar on Computers, Design, and Work - Wed, 31 Jan, 12:15
SEMINAR ON COMPUTERS, DESIGN, AND WORK
Embedded Values, Moral Delegates, and Expert Systems:
Toward a Political Anthropology of Computing Technology
Bryan Pfaffenberger
Wednesday, 31 January, 12:15
Ventura 17
Many technical systems incorporate what Bruno Latour calls a delegate:
a technical feature that is intended to force people to conform to
moral norms. Such systems are not merely instrumental. They are also
systems of moral authority, and comprehending their social impact
requires more than a political sociology; it requires a political
anthropology, which is capable of comprehending the social impact and
meaning of an imposed system of moral and judicial authority. This
point is illustrated through an examination of the debate concerning a
recent attempt to capture the rules of the British Nationality Act
(1981) in an expert system.
Bio
Assistant Professor of Humanities, School of Engineering and Applied
Science, University of Virginia. Ph.D.: social and cultural
anthropology, University of California, Berkeley. Current interests:
social history of personal computing, social construction and social
impact of expert system technology, technology transfer to Third World.
**********************************************************************
To the degree that he masters his tools, he can invest the world with
his meaning; to the degree that he is mastered by his tools, the shape
of the tool determines his own self-image. --- Ivan Illich
**********************************************************************
Bryan Pfaffenberger XB.p07@STANFORD
**********************************************************************
------------------------------
To: [email protected]
Date: Wed, 24 Jan 90 15:49:06 PST
>From: [email protected] (Ingrid Deiwiks)
Subject: CSLI Calendar, 25 January, vol. 5:14
C S L I C A L E N D A R O F P U B L I C E V E N T S
- ----------------------------------------------------------------------------
25 January 1990 Stanford Vol. 5, No. 14
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 25 JANUARY 1990
12:00 noon TINLunch
Cordura 100 The Role of Central Conceptual Structures in the
Development of Scientific and Mathematical Thought
Robbie Case
School of Education
Stanford University
([email protected])
Abstract in last week's Calendar
2:15 p.m.
Cordura 100 CSLI Seminar
HPSG from Afar
Paul John King
CSLI Postdoctoral Fellow
([email protected])
Abstract in last week's Calendar
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 1 FEBRUARY 1990
12:00 noon TINLunch
Cordura 100 Reading: A Logical Model of Machine Learning:
A Study of Vague Predicates
by Wlodek Zadrozny and Mieczyslaw Kokar
Discussion led by Jerry Hobbs
([email protected])
Abstract below
2:15 p.m. CSLI Seminar
Cordura 100 Some Aspects of Word-Retrieval Errors in the
Speech of Aphasic Adults
Audrey Holland
Professor of Otolaryngology and Communication
and Associate Professor of Psychiatry
Director of the Division of Speech, Language,
and Voice Pathology, School of Medicine
University of Pittsburgh
([email protected])
Abstract below
____________
NEXT WEEK'S TINLUNCH
A Logical Model of Machine Learning:
A Study of Vague Predicates
by Wlodek Zadrozny and Mieczyslaw Kokar
Discussion led by Jerry Hobbs
In this paper, we apply a logical framework to the problem of
recognizing vague predicates. We formulate a rule of abduction and
apply it in identifying objects; we formally account for the context
sensitivity of recognition observed by W. Labov. We show how multiple
theories of "cup" can be combined in a new theory of the concept.
Finally, we conjecture that operationality in explanation-based
learning is related to the cost of abduction.
The logical theory we use assumes that reasoning and learning take
place in an interaction of theories on three levels: methodological
level, object level, and referential level. An object level theory
describes the current situation; the referential level encodes
background knowledge; while the methodological level is responsible
for choosing methods of reasoning and ways of constructing models.
____________
NEXT WEEK'S CSLI SEMINAR
Some Aspects of Word-Retrieval Errors in the
Speech of Aphasic Adults
Audrey Holland
The talk will include a brief sample of a videotaped interaction with
an aphasic man who has a moderate conduction aphasia, frequent
phonemic paraphasic errors, and word-retrieval deficits. How the
patient's speech production deficits are modified as a result of the
feedback with which he is provided, how such deficits and their
resolutions are classified and coded, and some difficulties in
description of word-retrieval deficits will be the focus of the talk.
I will try to relate some of the realities of speech production
deficits to problems of building computer models of aphasia, at least
briefly.
____________
SEMINAR ON ISSUES IN LOGICAL THEORY
Philosophy 396
Approaches to the Liar Paradox, Part II
John Etchemendy
([email protected])
Thursday, 25 January, 3:45-5:30
Cordura 100
In the logic seminar this week, John Etchemendy will talk about the
treatment of the liar paradox in Barwise and his book {\it The Liar}.
Next week, Bernie Linsky will present material from "General
Intensional Logic" by C. Anthony Anderson (chapter II.7 of the
_Handbook of Philosophical Logic_). Copies will be made available at
this week's meeting.
____________
SYMBOLIC SYSTEMS FORUM
Conversations with Apes: Reflections on the
Scientific Study of Language
John Dupre
Department of Philosophy
([email protected])
Thursday, 25 January, 4:15
Building 60, Room 62G
(Please note room change!)
In this talk, John Dupre will look at some of the different attempts
that have been made to teach symbolic systems, including American sign
language, to various apes. He'll also discuss the main criticisms
that have been directed against these attempts. He will argue that
these criticisms reveal serious conflicts between assumptions about
correct scientific methodology and the very possibility of the kind of
research project envisaged by the ape language researchers. Finally,
he will offer a few suggestions about why this research and its
evaluation has seemed so important to some people.
At the next Forum (1 February), Annie Zaenen will talk. Title: Verb
Varieties: Syntax or Semantics?
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
Dependency Relations and Syntactic Functions:
Heads and Bases
Arnold M. Zwicky
Ohio State University and Stanford University
Friday, 26 January, 3:30
Cordura 100
A particularly simple approach to syntactic functions/relations would
treat them as located within a hierarchy (or perhaps within several
overlapping hierarchies) arising from the split between the dependency
relations HEAD-OF and DEPENDENT-OF, from the split of DEPENDENT-OF
into ARGUMENT-OF and MODIFIER-OF (and the corresponding split of
HEAD-OF into the converse relations OPERATOR-ON and MODIFIED-BY,
respectively), and from the split of ARGUMENT-OF into syntactic
functions like Subject and Direct-Object and of MODIFIER-OF into
syntactic functions like Adjectival and Adverbial.
There are well-known problems with one part of this view, involving
arguments that clearly have the syntactic functions (and sometimes the
syntactic categories as well) normally associated with modifiers: for
example, the locational dependent of the verb PUT in I PUT THE BOX ON
THE TABLE and the manner dependent of the verb WORD in WE WORDED OUR
RESPONSE CAUTIOUSLY. Phenomena like these argue for a dissociation of
the dependency relations from syntactic functions; an Adverbial is
standardly a MODIFIER-OF a nonnominal head, and the standard
non-Subject ARGUMENT-OF a verb head is a Direct-Object or an
Indirect-Object NP, but these are merely the default alignments, not
invariable associations. On the one hand, then, we have dependency
relations like ARGUMENT-OF and MODIFIER-OF, while on the other hand we
have an inventory (perhaps very large, and perhaps very complexly
organized) of syntactic functions like Subject, Adverbial, Predicator,
and so on, each with its own default associations with syntactic
categories (NP for Subject, AdvP and PP for Adverbial, V for
Predicator, and so on).
Granting dissociations that will allow (for instance) an Adverbial PP
to serve as an ARGUMENT-OF a Predicator V, we should also expect
nonstandard pairings of OPERATOR-ON and MODIFIER-OF with syntactic
functions. I propose that one of these dissociations is in fact
abundantly exemplified, when an Adverbial or Adjectival constituent C1
serves as OPERATOR-ON another constituent C2. In such a construct C0,
we would expect C1 to exhibit some of the properties of the "head"
within C0; as an OPERATOR-ON C2, C1 should be expected (following
Keenan-style generalizations) to act as agreement target with respect
to the agreement trigger C2, and as government trigger with respect to
the government target C2, and it should be expected (following the
default inheritance generalizations in most current approaches to
phrase structure) to be the locus of morphosyntactic marking for
properties belonging to C0 as a whole (unless the rule for this
construction specifically stipulates that these are marked elsewhere,
for instance on an edge of C0). But we should also expect C2 to
exhibit some of the properties of the "head" of C0; as an Adverbial or
Adjectival, C1 should be expected to be optional, and C2 should be
expected to be the "syntactic determinant," the constituent that
predicts the external distribution type of C0.
This is the split of properties that often occurs for combinations of
an auxiliary verb with its complement; for combinations of a
complementizer with a clause; for combinations of a "grammatically
used" adposition with its object NP; and for combinations of a
determiner with a nominal constituent. The syntactic literature on
these matters -- as in the _Journal of Linguistics_ exchange between
Zwicky and Hudson, or in Abney's dissertation -- is largely taken up
with attempting to argue that one or the other of the two constituents
involved *really* is the head, though there are those (Warner in
Linguistics, Fenchel in WCCFL) who propose to side-step the problem by
declaring *both* constituents to be heads. I maintain that there is
no problem, since there are two conceptually distinct entities here,
for one of which I reserve the label "head," for the other of which I
suggest the label "base."
This is not yet a theoretical proposal. Rather, I am elucidating a
distinction that I believe will have a reflex in any adequate theory
of syntax, without at the moment taking a stand on how the distinction
should be realized in a particular theory.
____________
COMMONSENSE AND NONMONOTONIC REASONING SEMINAR
Formalizing Various Intuitions About Inheritance
in Logic Programs
Fangzhen Lin
Stanford University
Monday, 29 January, 2:30
Margaret Jacks Hall 301
(Please note room change for this meeting only!)
Reasoning about inheritance is one of the earliest applications of
nonmonotonic logics. It is also one of the motivations for developing
such logics. Unfortunately, so far attempts at formalizing
inheritance hierarchies using general purpose nonmonotonic logics,
like default logic and circumscription, seem not as successful as the
ones using ad hoc methods, like the ones used by Touretzky and the
Horty trio. This raises an important question: Are these nonmonotonic
logics appropriate for the job? In this paper, we'll show that for
default and autoepistemic logics, the answer is positive.
Specifically, we'll propose a methodology for formalizing various
intuitions about inheritance in logic programs with negation as
failure (a subclass of default and autoepistemic theories). We'll
prove that one of our formalizations includes Horty's skeptical theory
as a special case. Among other things, the methodology is remarkably
simple and very similar to the ones used by McCarthy and others.
____________
SEMINAR ON COMPUTERS, DESIGN, AND WORK
Social Aspects of Expert Systems
Bryan Pfaffenberger
Wednesday, 31 January, 12:15
Ventura 17
No abstract available.
____________
NEW CSLI POSTDOCTORAL FELLOW
Paul John King
([email protected])
Manchester University, England
Dates of visit: January 1990-January 1991
Graduating from London University with a mathematics degree, Paul
studied for a mathematical logic Ph.D. under Peter Aczel at Manchester
University. Drawn to him for his work on nonwellfounded sets, Aczel
soon introduced him to Barwise and Etchemendy's _The Liar_, helping
him to write a dissertation that simplified some of the maths behind
their work. Fueled by this and other dealings with situation
semantics, Aczel encouraged Paul to learn a little about linguistics.
This culminated in his Ph.D. dissertation, which dealt with the
mathematical foundations of Pollard and Sag's _Information-based
Syntax and Semantics_. Having, seemingly, developed a habit for
putting mathematical "meat" on CSLI "bones," Paul hopes to deepen this
habit while here by working alongside the situationists and/or
unification-based grammarians (whoever wants him most!) as a sort of
mathematical "janitor"!
____________
NEW CSLI VISITOR
Hiroshi Nakagawa
([email protected])
Professor of Electrical and Computer Engineering
Yokohama National University, Japan
Dates of visit: January 1990-January 1991
Hiroshi is interested in commonsense-knowledge representation and
situation theory. While at CSLI, he would like to represent
commonsense knowledge using situation theory. In trying to do this,
he also hopes to find out which parts of situation theory are useful
and/or what kinds of logical devices we should add to situation
theory. He thinks there are at least two ways in situation theory
that will allow him to do this. One is the "situation first" way,
i.e., defining operations on situations or situation types. The other
is the "infon first" way, i.e., defining operations on infons or
so-called infon algebra. Hiroshi feels he is now wandering between
these two ways.
____________
------------------------------
End of NL-KR Digest
*******************
|