Copy Link
Add to Bookmark
Report

AIList Digest Volume 2 Issue 098

eZine's profile picture
Published in 
AIList Digest
 · 15 Nov 2023

AIList Digest           Wednesday, 1 Aug 1984      Volume 2 : Issue 98 

Today's Topics:
Expert Systems - Archaeology and PROSPECTOR,
Image Processing - Request for Algorithms,
Logic Programming - Public-Domain Theorem Provers,
AI Languages - Frame-Based Languages,
AI Hardware - Facom Alpha,
LISP - Georgia Tech Lisp & Aztec C & Franz on P-E 3230,
Seminar - Nonmonotonic Reasoning Using Dempster's Rule
----------------------------------------------------------------------

Date: 26 Jul 84 9:09:00-PDT (Thu)
From: pur-ee!uiucdcs!uiucuxc!chandra @ Ucb-Vax.arpa
Subject: Req: Info on Archaeological Expert - (nf)
Article-I.D.: uiucuxc.28900002

Help!!!
I am a Graduate student trying to build an Archeologist's
assistant. This program is supposed to contain knowledge about human
habitation patterns, anthroplogical aspects etc.

This note is a request for any info on the application of a
knowledge based programs to archeological surveying. I faintly remember
having seen a reference on this topic long ago.

I am currently thinking of using some of the ideas used in
PROSPECTOR.

Any Ideas, Comments, cues?

Thanks,
Navin Chandra

(outside Illinois) Phone 1-800-872-2375 (extention 413)
(in Illinois) Phone 1-800-252-7122 (extention 413)

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

Date: Sun 29 Jul 84 10:34:30-PDT
From: Ken Laws <Laws@SRI-AI.ARPA>
Subject: Archaeology and PROSPECTOR

PROSPECTOR is a pretty fair hierarchical inference system, but
be advised that it provides no spatial reasoning mechanisms. The
basic consultation mode asks questions about geologic conditions
at a single position or "site". In map mode, it uses map data
to provide the same information independently for every point on
the map -- there is no spatial analysis or carry-over from one
point to the next. You can add decisions based on criteria such
as being "near a fault", but the reasoning mechanisms have no
way of determining "nearness" automatically unless you provide
a "nearness map"; neither can they reason about one site being
nearer than its neighbors. These deficiencies could be fixed, but
the existing PROSPECTOR is not a spatial reasoning system.

-- Ken Laws

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

Date: 27 Jul 84 11:44:30-PDT (Fri)
From: ihnp4!drutx!zir @ Ucb-Vax.arpa
Subject: image processing
Article-I.D.: drutx.763


I am trying to track down source code for image
processing routines, such as digital filters, noise
filters, dithering filters, shape recognition and
visual database design. Any and all responses will be
appreciated. I will post results in Net.sources if there
is sufficient interest.

Thanks for your time,
Mark Zirinsky
AT&TIS, Denver 31d48
(303) 538- 1063

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

Date: 30 Jul 1984 13:36-PDT
From: dietz%USC-CSE@USC-ECL.ARPA
Subject: Public Domain Theorem Provers


I'm trying to find out what's available in the public domain in the way
of theorem proving programs and subroutine packages. If you have such
please send a note to:

Paul Dietz
dietz%usc-cse@usc-ecl

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

Date: Sun, 29 Jul 84 22:01 EDT
From: Tim Finin <Tim%upenn.csnet@csnet-relay.arpa>
Subject: Frame-Based Languages


I am investigating some implementation techniques for frame-base
representation languages with inheritance. Most such languages do
inheritance at "access time" and may or may not keep a local copy of the
inherited data. I am trying to determine which languages and/or
implementations of languages have instead done the inheritance at
"definition time" by making some kind of explicit local copy or pointer to
the inherited information. I am particularly interested in finding out if
any languages have done this in a general way that would allow changes in
the attributes of a generic object to be properly inherited by its current
descendants.

Tim

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

Date: Mon 30 Jul 84 18:23:17-EDT
From: Wayne McGuire <MDC.WAYNE%MIT-OZ@MIT-MC.ARPA>
Subject: Facom Alpha

MIS Week for 8/1/84 (p. 18) reports the following:

''Fujitsu Ltd. last week announced shipment next March of Japan's
first Lisp machine, named Facom Alpha, claiming it is four times
faster than the Symbolics 3600 in executing artificial intelligence
programs such as expert systems.

''The Alpha, carrying a price tag of $90,930, was said to be a
back-end processor connectable with a Fujitsu mainframe or the
company's S-3000 super minicomputer. It runs 'Utilisp,' a local
version of Lisp language developed by Tokyo University.''

What catches one's eye is the claim that the Facom Alpha is four
times faster than the Symbolics 3600.

Reading the popular computer press these days could easily give
one the impression that Japan is about to trounce the U.S. in the
development of both supercomputers and AI systems. Does anyone on
AIList know whether this claim about the Facom Alpha's speed has any
grounding in reality?

-- Wayne McGuire --

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

Date: Mon 30 Jul 84 17:34:23-CDT
From: CMP.BARC@UTEXAS-20.ARPA
Subject: Yet Another Lisp Dialect?

I recently received a rather indirect inquiry concerning a Lisp dialect called
"Georgia Tech Lisp". Could anyone out there provide or direct me to some
information about this variant and its idiosyncrasies?

Dallas Webster (CMP.BARC@UTexas-20)

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

Date: 31 Jul 84 10:09:44-PDT (Tue)
From: hplabs!pesnta!lpi3230!steve @ Ucb-Vax.arpa
Subject: Franz Lisp running on Perkin Elmer 3230 Unix
Article-I.D.: lpi3230.142


Franz Lisp (Opus 38.79) is now running on a Perkin Elmer 3230 under
their version 2.4 Unix (a V7 version). Soon after PE delivers their
promised System 5.2, it will be ported to that system. For the many
of you who have never heard of Perkin Elmer, They used to be called
Interdata and an Interdata machine was the first machine to which
Unix was ported in the mid seventies. The 3230 has about 90% of the
speed of a VAX-780 for the price of a 750.

For the few of you who actually HAVE a PE machine and want to use Franz
Lisp, send me mail. We haven't yet decided under what terms to make it
available. The port was too time consuming and expensive to just give
it away, but we aren't in business and do not have the manpower to really
market and support it. Maybe PE will distribute it on a third party
basis at a reasonable cost.

Steve Burbeck
Linus Pauling Institute
440 Page Mill Road
Palo Alto, CA 94306 (415)327-4064
hplabs!{analog,pesnta}!lpi3230!steve

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

Date: 28 Jul 1984 2132-CDT
From: Usadacs at STL-HOST1.ARPA
Subject: LISP in Aztec C, Public Domain

Ref: AI Digest, V2 #90 "LISP in Aztec C", is avaliable from
SIMTEL20 via FTP. MICRO:<SIGM.VOL118>

A.C. McIntosh, USADACS@STL-HOST1.

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

Date: Mon 30 Jul 84 15:14:35-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: Seminar - Nonmonotonic Reasoning Using Dempster's Rule

[Forwarded from the Stanford SIGLUNCH distribution by Laws@SRI-AI.]


DATE: Friday, August 3, 1984
LOCATION: Chemistry Gazebo, between Physical & Organic Chemistry
TIME: 12:05

SPEAKER: Matt Ginsberg
Heuristic Programming Project
Stanford University

TOPIC: Non-monotonic Reasoning Using Dempster's Rule

Rich's suggestion that the arcs of semantic nets be labeled so as to
reflect confidence in the properties they represent is investigated in
greater detail. If these confidences are thought of as ranges of
acceptable probabilities, existing statistical methods can be used
effectively to combine them. The framework developed also seems to be
a natural one in which to describe higher levels of deduction, such as
"reasoning about reasoning".

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

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