Copy Link
Add to Bookmark
Report
AIList Digest Volume 1 Issue 103
AIList Digest Friday, 25 Nov 1983 Volume 1 : Issue 103
Today's Topics:
Alert - Neural Network Simulations & Weizenbaum on The Fifth Generation,
AI Jargon - Why AI is Hard to Read,
AI and Automation - Economic Effects & Reliability,
Conference - Logic Programming Symposium
----------------------------------------------------------------------
Date: Sun, 20 Nov 83 18:05 PST
From: Allen VanGelder <avg@diablo>
Subject: Those interested in AI might want to read ...
[Reprinted from the SU-SCORE bboard.]
[Those interested in AI might want to read ...]
the article in November *Psychology Today* about Francis Crick and Graeme
Michison's neural network simulations. Title is "The Dream Machine", p. 22.
------------------------------
Date: Sun 20 Nov 83 18:50:27-PST
From: David Rogers <DRogers@SUMEX-AIM.ARPA>
Subject: Re: Those interested in AI might want to read...
[Reprinted from the SU-SCORE bboard.]
I would guess that the "Psychology Today" article is a simplified form of the
Crick & Michelson paper which came out in "Nature" about 2 months ago. Can't
comment on the Psychology Today article, but the Nature article was
stimulating and provocative. The same issue of Nature has a paper (referred to
by Crick) of a simulation which was even better than the Crick paper
(sorry, Francis!).
------------------------------
Date: Mon 21 Nov 83 09:58:04-PST
From: Benjamin Grosof <GROSOF@SUMEX-AIM.ARPA>
Subject: Weizenbaum review of "The Fifth Generation": hot stuff!
[Reprinted from the SU-SCORE bboard.]
The current issue of the NY REview of Books contains a review by Joseph
Weizenbaum of MIT (Author of "Computer Power and Human Reason", I think)
of Feigenbaum and McCorduck's "The Fifth Generation". Warning: it is
scathing and controversial, hence great reading. --Benjamin
------------------------------
Date: Wed 23 Nov 83 14:38:38-PST
From: Wilkins <WILKINS@SRI-AI.ARPA>
Subject: why AI is hard to read
There is one reason much AI literature is hard to read. It is common for
authors to invent a whole new set of jargon to describe their system, instead
of desribing it in some common language (e.g., first order logic) or relating
it to previous well-understood systems or principles. In recent years
there has been an increased awareness of this problem, and hopefully things
are improving and will continue to do so. There are also a lot more
submissions now to IJCAI, etc, so higher standards end up being applied.
Keep truckin'
David Wilkins
------------------------------
Date: 21 Nov 1983 10:54-PST
From: dietz%usc-cse%USC-ECL@SRI-NIC
Reply-to: dietz%USC-ECL@SRI-NIC
Subject: Economic effects of automation
Reply to Marcel Schoppers (AIList 1:101):
I agree that "computers will eliminate some jobs but create others" is
a feeble excuse. There's not much evidence for it. Even if it's true,
those whose jobs skills are devalued will be losers.
But why should this bother me? I don't buy manufactured goods to
employ factory workers, I buy them to gratify my own desires. As a
computer scientist I will not be laid off; indeed, automation will
increase the demand for computer professionals. I will benefit from
the higher quality and lower prices of manufactured goods. Automation
is entirely in my interest. I need no excuse to support it.
... I very much appreciated the idea ... that we should be building
expert systems in economics to help us plan and control the effects of
our research.
This sounds like an awful waste of time to me. We have no idea how to
predict the economic effects of much of anything except at the most
rudimentary levels, and there is no evidence that we will anytime soon
(witness the failure of econometrics). There would be no way to test
the systems. Building expert systems is not a substitute for
understanding.
Automating medicine and law: a much better idea is to eliminate or
scale back the licensing requirements that allow doctors and lawyers to
restrict entry into their fields. This would probably be necessary to
get much benefit from expert systems anyway.
------------------------------
Date: 22 Nov 83 11:27:05-PST (Tue)
From: decvax!genrad!security!linus!utzoo!dciem!mmt @ Ucb-Vax
Subject: Re: just a reminder... - (nf)
Article-I.D.: dciem.501
It seems a little dangerous "to send machines where doctors won't go" -
you'll get the machines treating the poor, and human experts for the
privileged few.
If the machines were good enough, I wouldn't mind being underpriveleged.
I'd rather be flown into a foggy airport by autopilot than human pilot.
Martin Taylor
{allegra,linus,ihnp4,uw-beaver,floyd,ubc-vision}!utcsrgv!dciem!mmt
------------------------------
Date: 22 Nov 1983 13:06:13-EST (Tuesday)
From: Doug DeGroot <Degroot.YKTVMV.IBM@Rand-Relay>
Subject: Logic Programming Symposium (long message)
[Excerpt from a notice in the Prolog Digest.]
1984 International Symposium on Logic Programming
February 6-9, 1984
Atlantic City, New Jersey
BALLY'S PARK PLACE CASINO
Sponsored by the IEEE Computer Society
For more information contact PERIERA@SRI-AI or:
Registration - 1984 ISLP
Doug DeGroot, Program Chairman
IBM Thomas J. Watson Research Center
P.O. Box 218
Yorktown Heights, NY 10598
STATUS Conference Tutorial
Member, IEEE __ $155 __ $110
Non-member __ $180 __ $125
____________________________________________________________
Conference Overview
Opening Address:
Prof. J.A. (Alan) Robinson
Syracuse University
Guest Speaker:
Prof. Alain Colmerauer
Univeristy of Aix-Marseille II
Marseille, France
Keynote Speaker:
Dr. Ralph E. Gomory,
IBM Vice President & Director of Research,
IBM Thomas J. Watson Research Center
Tutorial: An Introduction to Prolog
Ken Bowen, Syracuse University
35 Papers, 11 Sessions (11 Countries, 4 Continents)
Preliminary Conference Program
Session 1: Architectures I
__________________________
1. Parallel Prolog Using Stack Segments on Shared-memory
Multiprocessors
Peter Borgwardt (Univ. Minn)
2. Executing Distributed Prolog Programs on a Broadcast Network
David Scott Warren (SUNY Stony Brook, NY)
3. AND Parallel Prolog in Divided Assertion Set
Hiroshi Nakagawa (Yokohama Nat'l Univ, Japan)
4. Towards a Pipelined Prolog Processor
Evan Tick (Stanford Univ,CA) and David Warren
Session 2: Architectures II
___________________________
1. Implementing Parallel Prolog on a Multiprocessor Machine
Naoyuki Tamura and Yukio Kaneda (Kobe Univ, Japan)
2. Control of Activities in the OR-Parallel Token Machine
Andrzej Ciepielewski and Seif Haridi (Royal Inst. of
Tech, Sweden)
3. Logic Programming Using Parallel Associative Operations
Steve Taylor, Andy Lowry, Gerald Maguire, Jr., and Sal
Stolfo (Columbia Univ,NY)
Session 3: Parallel Language Issues
___________________________________
1. Negation as Failure and Parallelism
Tom Khabaza (Univ. of Sussex, England)
2. A Note on Systems Programming in Concurrent Prolog
David Gelertner (Yale Univ,CT)
3. Fair, Biased, and Self-Balancing Merge Operators in
Concurrent Prolog
Ehud Shaipro (Weizmann Inst. of Tech, Israel)
Session 4: Applications in Prolog
_________________________________
1. Editing First-Order Proofs: Programmed Rules vs. Derived Rules
Maria Aponte, Jose Fernandez, and Phillipe Roussel (Simon
Bolivar Univ, Venezuela)
2. Implementing Parallel Algorithms in Concurrent Prolog:
The MAXFLOW Experience
Lisa Hellerstein (MIT,MA) and Ehud Shapiro (Weizmann
Inst. of Tech, Israel)
Session 5: Knowledge Representation and Data Bases
__________________________________________________
1. A Knowledge Assimilation Method for Logic Databases
T. Miyachi, S. Kunifuji, H. Kitakami, K. Furukawa, A.
Takeuchi, and H. Yokota (ICOT, Japan)
2. Knowledge Representation in Prolog/KR
Hideyuki Nakashima (Electrotechnical Laboratory, Japan)
3. A Methodology for Implementation of a Knowledge
Acquisition System
H. Kitakami, S. Kunifuji, T. Miyachi, and K. Furukawa
(ICOT, Japan)
Session 6: Logic Programming plus Functional Programming - I
____________________________________________________________
1. FUNLOG = Functions + Logic: A Computational Model
Integrating Functional and Logical Programming
P.A. Subrahmanyam and J.-H. You (Univ of Utah)
2. On Implementing Prolog in Functional Programming
Mats Carlsson (Uppsala Univ, Sweden)
3. On the Integration of Logic Programming and Functional Programming
R. Barbuti, M. Bellia, G. Levi, and M. Martelli (Univ. of
Pisa and CNUCE-CNR, Italy)
Session 7: Logic Programming plus Functional Programming- II
____________________________________________________________
1. Stream-Based Execution of Logic Programs
Gary Lindstrom and Prakash Panangaden (Univ of Utah)
2. Logic Programming on an FFP Machine
Bruce Smith (Univ. of North Carolina at Chapel Hill)
3. Transformation of Logic Programs into Functional Programs
Uday S. Reddy (Univ of Utah)
Session 8: Logic Programming Implementation Issues
__________________________________________________
1. Efficient Prolog Memory Management for Flexible Control Strategies
David Scott Warren (SUNY at Stony Brook, NY)
2. Indexing Prolog Clauses via Superimposed Code Words and
Field Encoded Words
Michael J. Wise and David M.W. Powers, (Univ of New South
Wales, Australia)
3. A Prolog Technology Theorem Prover
Mark E. Stickel, (SRI, CA)
Session 9: Grammars and Parsing
_______________________________
1. A Bottom-up Parser Based on Predicate Logic: A Survey of
the Formalism and Its Implementation Technique
K. Uehara, R. Ochitani, O. Kakusho, and J. Toyoda (Osaka
Univ, Japan)
2. Natural Language Semantics: A Logic Programming Approach
Antonio Porto and Miguel Filgueiras (Univ Nova de Lisboa,
Portugal)
3. Definite Clause Translation Grammars
Harvey Abramson, (Univ. of British Columbia, Canada)
Session 10: Aspects of Logic Programming Languages
__________________________________________________
1. A Primitive for the Control of Logic Programs
Kenneth M. Kahn (Uppsala Univ, Sweden)
2. LUCID-style Programming in Logic
Derek Brough (Imperial College, England) and Maarten H.
van Emden (Univ. of Waterloo, Canada)
3. Semantics of a Logic Programming Language with a
Reducibility Predicate
Hisao Tamaki (Ibaraki Univ, Japan)
4. Object-Oriented Programming in Prolog
Carlo Zaniolo (Bell Labs, New Jersey)
Session 11: Theory of Logic Programming
_______________________________________
1. The Occur-check Problem in Prolog
David Plaisted (Univ of Illinois)
2. Stepwise Development of Operational and Denotational
Semantics for Prolog
Neil D. Jones (Datalogisk Inst, Denmark) and Alan Mycroft
(Edinburgh Univ, Scotland)
___________________________________________________________
An Introduction to Prolog
A Tutorial by Dr. Ken Bowen
Outline of the Tutorial
- AN OVERVIEW OF PROLOG
- Facts, Databases, Queries, and Rules in Prolog
- Variables, Matching, and Unification
- Search Spaces and Program Execution
- Non-determinism and Control of Program Execution
- Natural Language Processing with Prolog
- Compiler Writing with Prolog
- An Overview of Available Prologs
Who Should Take the Tutorial
The tutorial is intended for both managers and programmers
interested in understanding the basics of logic programming
and especially the language Prolog. The course will focus on
direct applications of Prolog, such as natural language
processing and compiler writing, in order to show the power
of logic programming. Several different commercially
available Prologs will be discussed and compared.
About the Instructor
Dr. Ken Bowen is a member of the Logic Programming Research
Group at Syracuse University in New York, where he is also a
Professor in the School of Computer and Information
Sciences. He has authored many papers in the field of logic
and logic programming. He is considered to be an expert on
the Prolog programming language.
------------------------------
End of AIList Digest
********************
