Copy Link
Add to Bookmark
Report

AIList Digest Volume 1 Issue 022

eZine's profile picture
Published in 
AIList Digest
 · 1 year ago

AIList Digest            Tuesday, 19 Jul 1983      Volume 1 : Issue 22 

Today's Topics:
A Note from the Moderator
Response to Extensible Editor Request
How Many Prologs Are There ?
Grammar Correction
Machine Learning Workshop Proceedings
Upcoming Conferences
Computers in the Media ...
CSCSI-84 Call for Papers
----------------------------------------------------------------------

Date: Mon 18 Jul 83 09:10:36-PDT
From: AIList-Request@SRI-AI <Laws@SRI-AI.ARPA>
Subject: A Note from the Moderator

This issue of AIList depends heavily on reprints from several BBoards.
Such reporting is important, but should not be the only function of
this "discussion list". Lets have a little audience participation.

-- Ken Laws

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

Date: 25 Jun 1983 1247-EDT
From: Chris Ryland <CPR@MIT-XX>
Subject: Response to Extensible Editor Request

[Reprinted from the Editor-People discussion list.]

Let me point out that T, the Yale Scheme derivative, has been ported
to the Apollo, VAX/Unix, VAX/VMS, and, soon, the 370 family, from what
I hear. It appears to be the most efficient and portable Lisp to
appear on the market. John O'Donnell at Yale (Odonnell@YALE) is the T
project leader.

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

Date: 2 Jul 83 13:11:36 EDT (Sat)
From: Bruce T. Smith <BTS.UNC@UDel-Relay>
Subject: How Many Prologs Are There ?

[Reprinted from the Prolog Digest.]

Here's Randy Harr's latest list of Prolog systems. He's away
from CWRU for the summer, and he asked me to keep up the list for him.
Since there have been several requests for information on finding a
Prolog lately, I've recently submitted it to net.lang.prolog. The
info on MU-Prolog is the only thing I've added this summer, from a
recent mailing from the U. of Melbourne. (Now, if I could only find
$100, I would like to try it...)

--Bruce T. Smith, UNC-CH
duke!unc!bts (USENET)
bts.unc@udel-relay (lesser NETworks)


list compiled by: Randolph E. Harr
Case Western Reserve University
decvax!cwruecmp!harr
harr.Case@UDEL-RELAY

{ the list can be FTP'd as [SU-SCORE]PS:<PROLOG>Prolog.Availability.
SU-SCORE observes Anonymous Login convention. If you cannot FTP,
I have a limited number of hard copies I could mail. -ed }

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

Date: Mon 18 Jul 83 09:14:25-PDT
From: AIList-Request@SRI-AI <Laws@SRI-AI.ARPA>
Subject: Grammar Correction

The July issue of High Technology has an article titled "Software
Tackles Grammar"
. It includes very brief discussions of the Bell Labs
Writer's Workbench and the IBM EPISTLE systems.

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

Date: 15 Jul 83 09:25:36 EDT
From: GABINELLI@RUTGERS.ARPA
Subject: Machine Learning Workshop Proceedings

[Reprinted from the Rutgers BBoard.]

Anyone wishing to order the Proceedings from the MLW can do so by
sending a check made out to the University of Illinois, in the amount
of $27.88 ($25 for Proceedings, $2.88 for postage) to:

Ms.June Wingler
Department of Computer Science
1304 W. Springfield
University of Illinois
Urbana, Illinois 61801

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

Date: Fri 15 Jul 83 11:40:41-PDT
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Upcoming Conferences

[Reprinted from SU-BBoard.]

1983 ACM Sigmetrics Conference on Measurement and Modeling of Computer
Systems August 29_31, 1983 Minneapolis, Minn. To register mail to
Registrar, Nolte Center, 315 Pillsbury Drive. S.E. Minneapolis, MN.
55455-0118. For information contact Steven Bruell CS Dept. Univ. MN
123a Lind Hall 612-376-3958

2nd ACM Sigact-Sigops Symposium on Principles of Distributed Computing
at Le Parc Regent, 3625 Avenue du Parc, Montreal, Quebec, Canada
August 17-19, 1983. Pre register by July 31, PODC Registration,
%Edward G. H. Smith, The Laurier Group, 275 Slater Street, Suite 1404
Ottawa, Ontario K1P 5H9 Canada.

HL

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

Date: 16 Jul 83 1610 PDT
From: Jim Davidson <JED@SU-AI>
Subject: Computers in the Media ...

[Reprinted from SU-BBoard.]

The August issue of Science Digest has an interview with Joseph
Weizenbaum.

He starts off by saying that the current popularity for personal
computers is something of a fad. He claims that many of the uses of
PC's, such as storing recipes or recording appointments, are tasks
that are better done manually.

Then the discussion turns to AI:

Science Digest: You know, many of the computer's biggest promoters are
university computer scientists themselves, particularly in the more
exotic areas of computer science, like artificial intelligence. Roger
Schank of Yale has set up a company, Cognitive Systems, that hopes to
market computer investment counselors, computer will-writers,
computers that can actually mimic a human's performance of a job.
[JED--but they have real trouble locating Bibb County.] What do you
think of artificial intelligence entering the market place?

Joseph Weizenbaum: I suppose first of all that the word "mimicking" is
fairly significant. These machines are not realizing human thought
processes; they're mimicking them. And I think what's being worked on
these days resembles the language, understanding and production of
human beings only very superficially. By the way, who needs a
computer will-maker?

SD: Some people can't afford a lawyer.

JW: The poor will be grateful to Dr. Schank for thinking of them...

...

SD: Yet, you know Dr. Schank's firm is videotaping humans in the hope
that by this means it can create a program which closely models the
expertise of the individual.

JW: That attitude displays such a degree of arrogance, such hubris
and, furthermore, a great deal of contempt for human beings. To think
that one can take a very wise teacher, for example, and by observing
her capture the essence of that person to any significant degree is
simply absurd. I'd say people who have that ambition, people who that
that it's going to be that easy or possible at all, are simply
deluded.

...

SD: Does it bother you that other computer scientists are marketing
artificial intelligence?

JW: Yes, it bothers me. It bothers me to the extent that these
commercial efforts are characterized at the same time as disinterested
science, the search for knowledge for knowledge's sake. And it isn't.
It's done for money. These people are spending the only capital
science has to offer: its good name. And once we lose that we've
lost everything.

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

Date: 14 Jul 83 11:10:07-PDT (Thu)
From: decvax!linus!utzoo!utcsrgv!tsotsos @ Ucb-Vax
Subject: CSCSI-84 Call for Papers
Article-I.D.: utcsrgv.1754

CALL FOR PAPERS

C S C S I - 8 4

Canadian Society for
Computational Studies of Intelligence

University of Western Ontario
London, Ontario
May 18-20, 1984

The Fifth National Conference of the CSCSI will be held at the
University of Western Ontario in London, Canada. Papers are requested
in all areas of AI research, particularly those listed below. The
Program Committee members responsible for these areas are included.

Knowledge Representation:
Ron Brachman (Fairchild R & D), John Mylopoulos (U of Toronto)
Learning:
Tom Mitchell (Rutgers U), Jaime Carbonell (CMU)
Natural Language:
Bonnie Weber (U of Pennsylvania), Ray Perrault (SRI)
Computer Vision:
Bob Woodham (U of British Columbia), Allen Hanson (U Mass)
Robotics:
Takeo Kanade (CMU), John Hollerbach (MIT)
Expert Systems and Applications:
Harry Pople (U of Pittsburgh), Victor Lesser (U Mass)
Logic Programming:
Randy Goebel (U of Waterloo), Veronica Dahl (Simon Fraser U)
Cognitive Modelling:
Zenon Pylyshyn, Ed Stabler (U of Western Ontario)
Problem Solving and Planning:
Stan Rosenschein (SRI), Drew McDermott (Yale)

Authors are requested to prepare Full papers, of no more than
4000 words in length, or Short papers of no more than 2000 words in
length. A full page of clear diagrams counts as 1000 words. When
submitting, authors must supply the word count as well as the area in
which they wish their paper reviewed. (Combinations of the above
areas are acceptable). The Full paper classification is intended for
well-developed ideas, with significant demonstration of validity,
while the Short paper classification is intended for descriptions of
research in progress. Authors must ensure that their papers
describe original contributions to or novel applications of
Artificial Intelligence, regardless of length classification, and
that the research is properly compared and contrasted with relevant
literature.
Three copies of each submitted paper must be in the hands of the
Program Chairman by December 7, 1983. Papers arriving after that date
will be returned unopened, and papers lacking word count and
classifications will also be returned. Papers will be fully reviewed
by appropriate members of the program committee. Notice of acceptance
will be sent on February 28, 1984, and final camera ready versions are
due on March 31, 1984. All accepted papers will appear in the
conference proceedings.

Correspondence should be addressed to either the General Chairman
or the Program Chairman, as appropriate.

General Chairman Program Chairman

Ted Elcock, John K. Tsotsos
Dept. of Computer Science, Dept. of Computer Science,
Engineering and Mathematical 10 King's College Rd.,
Sciences Bldg., University of Toronto,
University of Western Ontario Toronto, Ontario, Canada,
London, Ontario, Canada M5S 1A4
N6A 5B9 (416)-978-3619
(519)-679-3567

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

End of AIList 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