LAWS@SRI-AI.ARPA (01/27/85)
From: AIList Moderator Kenneth Laws <AIList-REQUEST@SRI-AI.ARPA>
AIList Digest Sunday, 27 Jan 1985 Volume 3 : Issue 9
Today's Topics:
Application - Expert Systems for Control Applications,
AI Tools - Tree Display Algorithms,
Theory - Problem-solving Classifications,
Symbolic Algebra - Computer_Algebra_List_P,
AI Tools - MULTILISP,
News - IMPAK Newsletter & Recent Reports,
Humor - Lying Computers,
Seminars - Knowledge in Interactive Proofs (UCB) &
Recursion Transformation (CMU)
----------------------------------------------------------------------
Date: Fri, 25 Jan 85 10:45 EST
From: Araman@HIS-BILLERICA-MULTICS.ARPA
Subject: EXPERT SYSTEMS FOR CONTROL APPLICATIONS
I am looking for pointers or references on Expert Systems which have
been built in Command and Control situations or just control situations.
Do such systems exist or are efforts under way in building such
knowledge based application systems in non-military situations.. I am
sure research done in command and control situations in military
situations could be translated to problems in commercial situations such
as process control, production control and inventory control
thanks in advance
sankar (Araman -at HI-MULTICS or Araman%his-billerica-multics -at
cisl-service-multics.arpa)
------------------------------
Date: Fri, 25 Jan 85 16:38 EST
From: Hannah Blau <Hannah%upenn.csnet@csnet-relay.arpa>
Subject: inquiry about tree display algorithms
Inquiry -- Tree Display Algorithms
I am writing a program for the Lisp Machine to produce a graphical display of
tree structures with labelled nodes. There is no a priori limit on the
complexity of the tree, and the node labels vary in width. I am trying to
develop an algorithm to adjust the layout of the nodes and edges in accordance
with the dimensions of the window in which the tree is to be displayed. When
drawing a big tree in a small window, I want to take advantage of the space
available without distorting the structure of the tree.
I would greatly appreciate hearing from anyone who has tackled this problem in
the past or can refer me to relevant literature. Thank you very much.
Hannah Blau
HANNAH%upenn.csnet@CSNET-RELAY
Department of Computer and Information Science
University of Pennsylvania
Philadelphia, Pennsylvania 19104
------------------------------
Date: Sat, 26 Jan 85 18:08:26 pst
From: Cindy Mason <mason@lll-crg.ARPA>
Subject: Problem-solving Classifications
I was recently writing an article on representations in AI when I came
across some confusing literature, and I'm hoping some of the people who
are experienced with this topic will comment on it.
I've noticed that there are QUITE A FEW different classifications for
problem solving paradigms. The AI Handbook (Vol. I, Sec. IIB) sees problem
representations in terms of State-space representations and Problem-reduction
representations, while Nilsson (1971) sees the classification in terms
of State-space, Problem-reduction, and Theorom-proving. Hunt (1975)
divides problem-solving into State-space, Problem-reduction, Enumeration,
and String Rewriting. Winston's classification (1984) includes State-space,
Constraints, Generate and Test, the Rule-based paradigm, etc.
It seems to me that some of these paradigms (like Theorom-proving and
Rules) are special cases of State-space. I'm wondering why there is
such a variety of opinion on what constitutes a classification of Problem
Solving representations. If anyone cares to comment on this, I'd be interested
to hear what you have to say.
------------------------------
Date: Thursday, 24-Jan-85 12:01:51-GMT
From: GORDON JOLY (on ERCC DEC-10) <GCJ%edxa@ucl-cs.arpa>
Subject: Computer_Algebra_List_P ?
Thanks for adding my request to AIList. For your information:
I would be happy to add your name to the fowarding list for net.math.symbolic.
This is a USENET new group devoted to symbolic algebra. Systems frequently
referenced Reduce, Macsyma and Maple. We are supporting this interface as
part of the Reduce project at Rand, Santa Monica, CA. -- lseward@randgr
------------------------------
Date: Thu, 24 Jan 85 15:20:40 PST
From: David Alpern <ALPERN%SJRLVM4.BITNET@WISCVM.ARPA>
Subject: Re: MULTILISP
As of a couple of years ago, Bert Halstead and others around
Tech Square (MIT LCS) were talking about a MULTILISP implementation
for the CONCERT multiprocessor system. You might want to contact
Bert (rhh%mit-vax@mit-mc) and see what developed.
- Dave
David Alpern
IBM San Jose Research Laboratory, K65/282
5600 Cottle Road, San Jose, CA 95193
Phone: (408) 284-6521
Internet: Alpern%IBM-SJ@CSnet-Relay.ARPA
Alpern@SJRLVM4.BITNET
------------------------------
Date: Sun 27 Jan 85 10:34:15-PST
From: Ken Laws <Laws@SRI-AI.ARPA>
Subject: IMPAK Newsletter
For those of you not getting enough AI news, there's another new
newsletter dedicated to AI, expert systems, robotics, smart graphics,
etc. This one is IMPAK, 1902 Joliette Court, P.O. Box 7148,
Alexandria, VA 22307-9990. Twelve issues are $147 ($97 academic).
-- Ken Laws
------------------------------
Date: Fri, 25 Jan 85 13:45:40 cst
From: Laurence Leff <leff%smu.csnet@csnet-relay.arpa>
Subject: Recent Reports
Technical Report - University of Wisconsin Madison
TR 560 Mechanisms for Concurrency Control and Recovery in Prolog - A
Proposal
Michael J. Carey David J. DeWitt Goetz Graefe October 1984
UCLA CS Department Technical Reports
Order from Ms. Brenda Ramsey
UCLA Computer Science Department
3732 Boelter Hall
Los Angeles, CA 90024
An Intelligent Router for VLSI Design
Pierre Bouchon, Tulin Mangir, and Jacques Vidal
CSD 840058 $5.00
Rule Based Generation of Test Structures for VLSI
Grace Chen-Ellis and Tulin Mangir
CSD-840059 $1.50
The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation
Rina Cachter and Judea Pearl
CSD-840063 $1.00
Generalized Best-First Search Strategies and the Optimality of A*
Rina Dechter and Judea Pearl
CSD-840068
A Distributed Expert System for Space Shuttle Flight Control
John Joseph Helly, Jr. Jacques Vidal, Chair
CSD-840038 $6.75
Convince: A Conversational Inference Consolidation Engine
Jin Hyung Kim
CSD-840067 $8.50
Control Structures in a Prolog-Based Production System
Tulin E. Mangir & Basuki Soetarman
CSD-840054 $1.50
Recursive Random Games: A Probabilistic Model for Perfect Information Games
Gerard Phillippe Michon Judea Pearl, Chair
CSD-840029 $7.50
Pattern Recognition and Array Processing for Pollution Source Identification in
Water Pollution Systems
Yoshitaka Shibata Walter J. Karplus, Chair
CSD-840062 $17.75
------------------------------
Date: Friday, 25-Jan-85 10:23:18-GMT
From: GORDON JOLY (on ERCC DEC-10) <GCJ%edxa@ucl-cs.arpa>
Subject: A Thought.
Computers that are intelligent will probably want to lie about their age.
------------------------------
Date: Wed, 23 Jan 85 11:51:25 pst
From: khojesta%ucbernie@Berkeley (Khojesta Beverleigh)
Subject: Seminar - Knowledge in Interactive Proofs (UCB)
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
HOW TO GET A PROOF FROM THE DEVIL
THURSDAY 1-24-85 AT 11:00 A.M. IN ROOM 597 EVANS HALL
How much knowledge should a proof of a theorem T contain?
Certainly enough to see that T is true. Usually much more.
We derive an upper bound (expressed in bits) for the amount
of knowledge that a recipient (with polynomially bounded resources)
can compute from an interactive proof of T.
For some number theoretic Ts. we show how someone who has
enough information, henceforth, called "Devil", can prove to a
skeptical man that T is true without releasing ANY additional knowledge.
The faculty sponsor is Manuel Blum.
------------------------------
Date: 25 Jan 1985 0827-EST
From: Lydia Defilippo <DEFILIPPO@CMU-CS-C.ARPA>
Subject: Seminar - Recursion Transformation (CMU)
[Forwarded from the CMU bboard by Laws@SRI-AI.]
APPLIED LOGIC SEMINAR
Speaker: Angelika Zobel
Date: Wednesday, January 30, 1985
Time: 2:00 - 3:15
Place: 2105 Doherty Hall
Title: Transferring Recursions into Iterations
Though recursion is a powerful tool in program specification, efficiency
makes it desirable to have a way of transforming these recursions into
equivalent iterations. In this talk I shall present one such transformation
of certain mutual recursions into equivalent iterative programs. The
correctness of this transformation will be proved using generalized invariants
which in a nice way capture the characteristics of the computation tree. We
shall see how intuitive this correctness proof can be.
------------------------------
End of AIList Digest
********************