Copy Link
Add to Bookmark
Report

AIList Digest Volume 8 Issue 003

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

AIList Digest            Tuesday, 12 Jul 1988       Volume 8 : Issue 3 

Today's Topics:

Queries:

Spiegelhalter's causal graphs
PROLOG Compiler
Frames System
KEE
Blackboard Systems
Scheduling systems with preferential attributes
LISP implementations
A grammar for English

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

Date: Mon, 4 Jul 88 08:42:48 PDT
From: mcvax!dutrun!duttnphg!hans@uunet.UU.NET (Hans Buurman)
Subject: Spiegelhalter's causal graph's

I'm interested in using a causal model as described in:

Spiegelhalter, D.J., "Probabilistic Reasoning in Predictive Ex-
pert Systems," in: Uncertainty in Artificial Intelligence,
ed. L.N. Kanal, J.F. Lemmer, pp. 47-67, North-Holland, Am-
sterdam, 1986.

Spiegelhalter represents his model in a graph to which he applies
probabilistic theory under a Markov assumption. Could anybody give
me pointers in literature to applications or criticism of this
model ? I've seen some work by Pearl but I wonder how much there
is. Any help would be very much appreciated.

Thanks in advance,

Hans Buurman
Pattern Recognition Group
Faculty of Applied Physics
Delft University of Technology

UUCP: ..!mcvax!dutrun!duttnphg!hans
BITNET: tnphhbu@hdetud1

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

Date: 5 Jul 88 19:05:51 GMT
From: hanrahan@bingvaxu.cc.binghamton.edu (Bill Hanrahan)
Subject: Request PROLOG Compiler

Hello all,
I'm looking for the source for a Prolog compiler written by Lou Odette.
It was written up in 'AI EXPERT', August 1987, p.48. Apparently it was
posted to this board at one time, but I don't have access to purged
files (fliles > two weeks old).

Anyone with any idea of how I might get a hold of this?
Please respond to my ID, Thanks!
--
========================================================================
:Bill Hanrahan Relax, don't worry...have a homebrew
:Programmer/Analyst SUNY Binghamton
:hanrahan@bingvaxu.cc.binghamton.edu

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

Date: 5 Jul 88 19:58:39 GMT
From: ndsuvax!ncthangi@uunet.uu.net (sam r. thangiah)
Subject: Need a Frames System


I wish to use a frame system for my Ph.D dissertation. Could someone give
me pointers as to where I could obtain one, public domain or otherwise that
is considerably efficent and maintainable.
(We do not have a fortune to spend on obtaining one.)


Thanks in advance

Sam
--
Sam R. Thangiah, North Dakota State University.
300 Minard Hall UUCP: ...!uunet!plains.nodak.edu!ncthangi
NDSU, Fargo BITNET: ncthangi@plains.nodak.edu.bitnet
ND 58105 ARPA,CSNET: ncthangi%plains.nodak.edu.bitnet@cunyvm.cuny.edu

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

Date: Tue, 05 Jul 88 20:53:34
From: Ramachandran Iyer <60874863%WSUVM1.BITNET@MITVMA.MIT.EDU>
Subject: References on KEE wanted

I am looking for references on the knowledge representation tool
Knowledge Engineering Environment (KEE).

Any suggestions are most welcome.

-Ramachandran

Email: 60874863%wsuvm1.BITNET@cunyvm.cuny.edu

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

Date: 6 Jul 88 21:08:12 GMT
From: mcvax!inria!crin!laasri@uunet.uu.net (Hassan LAASRI)
Subject: To Blackboard Systems Designers

Originally, a blackboard-based system designed an AI system which is
composed of a set of independent computational agents known as knowledge
sources (KSs) interacting and communicating via a global database called the
blackboard, under the management of a controller that can be also an AI
system.

Recently, a proliferation of "distributed blackboard systems" (or
distributed control in blackboard systems) definitions were employed in
knowledge-based systems such as the UMass SCHEMA system or the CMU Navlab
system...In these systems, one read that, because the controller component
can be a system bottleneck, the systems designers prefer to distribute the
control between the KSs, so each KS is able to decide when and how it can
contribute to the problem solving process. Unfortunately there is not enough
documentations about their controllers.

We would like to have some highlights on these questions :

1. In a distributed control model, once two or more KSs are triggered to
activate, how do they negotiate between them to solve the conflict problem of
the blackboard accesses, i.e. how they find the best order in which they
will be executed ? do they use the contract net model or some thing like
that ?

2. Does each KS evaluate its contributions to the problem solving evolvement
and return a priority value, then the system executes the KS with the
highest priority ? in this case, this control type will be only a subset of
the original "centralised" control model used in systems such HEARSAY-II,
BB-1, HASP/SIAP, ATOME, GBB,...

P.S. We have decided to put this demand in this News group, after trying to
contact the concerned researchers. Unfortunately, we didn't have any
response to our requests.


-----------------------------------------------------
Mr. Hassan LAASRI and Miss. Brigitte MAITRE
CRIN/INRIA-Lorraine
Pattern Recognition and Artificial Intelligence Lab.
Blackboard Group
Campus Scientifique - B.P. 239
54506 VANDOEUVRE-LES-NANCY CEDEX
FRANCE

E-mail : laasri@crin.crin.fr or maitre@crin.crin.fr
Phone : (+33) 83-91-20-00 Post 30-05

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

Date: 8 Jul 88 03:38:41 GMT
From: munnari!charlie.oz.au!root@uunet.UU.NET (Just call me SUPER)
Reply-to: lukose@aragorn.OZ (Dickson Lukose)
Subject: Pointers on Scheduling systems with preferential attributes

Dear Colleagues,
Are you aware of any scheduling systems (real world or
academical prototype) that includes personal preferential attributes
when it is performing the scheduling process.

EG: Scheduling for assignment of workers to assembly lines in plants,
which takes into account:-
(1) individual preference of supervisor
(2) " " " workmate[s]
(3) " " " type of assembly line[s]
(4) " " " tool[s]
etc,....

Any pointers will be much appreciated

thanks in advance
------------------------------------------------------------------
Dickson Lukose | UUCP: ...!seismo!munnari!aragorn.oz!lukose
Div. Comp. & Maths | ....!decvax!mulga!aragorn.oz!lukose
Deakin University |
Victoria, 3217 | ARPA: munnari!aragorn.oz!lukose@SEISMO.ARPA
Australia | ACSNET: lukose@aragorn

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

Date: Fri, 8 Jul 88 21:19:04 CDT
From: drl@backup (David R. Linn)
Subject: LISP implementations

Does anyone have any experience with a LISP implementation that does
not rely on an interpreter? I know of none such but before I state (in
my master's thesis) or even imply that LISP is *always* implemented with
an interpreter, I thought I'd solicit confirmation (or counterexample)
from the readers of AILIST(/comp.ai?). Please reply directly to me as this
is not likely to be of interest to most of the readership; "if there is
evidence of sufficient interest, I will summarize to the list/newsgroup."

NB: my mailer is broken; reply to the address below - not to the address
in the header. (The postmaster is busy working on his master's thesis.)

David Linn - System Manager/Postmaster
Vanderbilt University School of Engineering
drl@vuse.vanderbilt.edu -or- ...!uunet!vuse!drl

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

Date: 11 Jul 88 13:37:19 GMT
From: mailrus!uflorida!novavax!proxftl!bill@husc6.harvard.edu (T.
William Wells)
Subject: Wanted: a grammar for English

I am looking for grammars for English. I'd prefer ones written
as a context free rules with restrictions.

I am currently looking through the references I picked up at the
recent ACL conference and am investigating a number of other
items I have picked up. However, I'd appreciate any references
thrown my way.

Please respond by E-mail, and if there is enough interest I will
summarize to the net.

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

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