Copy Link
Add to Bookmark
Report

NL-KR Digest Volume 06 No. 31

eZine's profile picture
Published in 
NL KR Digest
 · 10 months ago

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: nl-kr@cs.rpi.edu
Requests, policy: nl-kr-request@cs.rpi.edu
Back issues are available from host archive.cs.rpi.edu [128.213.1.10] in
the files nl-kr/Vxx/Nyy (ie nl-kr/V01/N01 for V1#1), mail requests will
not be promptly satisfied. If you can't reach `cs.rpi.edu' you may want
to use `turing.cs.rpi.edu' instead.

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

To: nl-kr@cs.rpi.edu
Date: Fri, 7 Jul 89 22:21:47 -0400
From: finin@PRC.Unisys.COM
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: HONG@IBM.COM
FAX: (914)-945-2141
TELEX: 910-240-0632

Submit Tutorial Proposals to:

Donald Kosy
Robotics Institute
Carnegie Mellon University
Pittsburgh, Pennsylvania 15213

Phone: 412-268-8814
ARPANET: kosy@cs.cmu.edu

CONFERENCE COMMITTEES

General Chair
Mark S. Fox, Carnegie-Mellon University

Publicity Chair
Jeff Pepper, Carnegie Group Inc

Tutorial Chair
Donald Kosy, Carnegie Mellon University

Program Committee
Chair Se June Hong, IBM Research
At-large Jan Aikins, AION Corp.
John Gero, University of Sidney
Robert E. Filman, IntelliCorp
Gary Kahn, Carnegie Group
John Mc Dermott, DEC
Engineering/Manufacturing Track
Chair Chris Tong, Rutgers University (Visiting IBM)
Sanjaya Addanki, IBM Research
Alice Agogino, UC Berkeley
Miro Benda, Boeing Computer Services
Sanjay Mittal, Xerox PARC
Duvurru Sriram, MIT
Business/Decision Support Track
Chair Peter Hart, Syntelligence
Chidanand Apte, IBM Research
Vasant Dhar, New York University
Richard Fikes, Price-Waterhouse
Timothy Finin, Unisys Paoli Research Center
Daniel O'Leary, University of Southern California
Enabling Technology Track
Chair Howard Shrobe, Symbolics
Lee Erman, CIMFLEX-Teknowledge
Brian Gaines, University of Calgary
Eric Mays, IBM Research
Kathy McKeown, Columbia University
Katia Sycara, Carnegie-Mellon University

Additional Information

For registration and additional conference information,
contact:

CAIA-90
The Computer Society of the IEEE
1730 Massachusetts Avenue, NW
Washington, DC 20036-1903
Phone: 202-371-0101

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

To: nl-kr@cs.rpi.edu
Date: Mon, 17 Jul 89 09:25:34 EDT
From: dewitt@caen.engin.umich.edu (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: nl-kr@cs.rpi.edu
From: kropf@i81s1.ira.uka.de
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: kropf@i81s1.ira.uka.de ()
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 kropf@ira.uka.de

Thomas Kropf
Institute of Computer Design and Fault Tolerance
University of Karlsruhe
West-Germany

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

To: nl-kr@cs.rpi.edu
From: halley!san@cs.utexas.edu (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- halley!san@cs.utexas.edu
------------------------------
End of NL-KR Digest
*******************


← previous
next →
loading
sending ...
New to Neperos ? Sign Up for free
download Neperos App from Google Play
install Neperos as PWA

Let's discover also

Recent Articles

Recent Comments

Neperos cookies
This website uses cookies to store your preferences and improve the service. Cookies authorization will allow me and / or my partners to process personal data such as browsing behaviour.

By pressing OK you agree to the Terms of Service and acknowledge the Privacy Policy

By pressing REJECT you will be able to continue to use Neperos (like read articles or write comments) but some important cookies will not be set. This may affect certain features and functions of the platform.
OK
REJECT