HDTenEightyP/NetNews huggingface dataset:
From: ken@iat.holonet.net (Ken Easlon)
Subject: Re: Drawing the entity/environment boundary
Organization: HoloNet National Internet Access BBS: 510-704-1058/modem
Date: Fri, 18 Dec 1992 07:31:58 GMT


In article <BzDMF2.FAx@spss.com> ,
markrose@spss.com (Mark Rosenfelder) writes:


>Whoa!  You're begging the question, by calling one object in your scenario
>an AI *system*.  The question is how you know what *is* a system.  The
>ideal would be to have some criteria we could use to decide whether the
>S/E cluster is part of system or external to it. 

Excuuuuuse me.  I didn't realize I was treading on sensitive ground here. 
Strike the word "system" and use the concept of undisputed entity-ness.

Let's suppose the question is simply whether or not to include the S/E
cluster as part of the definition of entity.  Let's say (for the sake of
this argument) that we have agreed on what the entity is (CPU+program+
employment contract, whatever) all except for this naggling little
question, where does the S/E cluster fit in.

My point is that there are criteria for deciding where to draw the line
other than minimum information exchange, criteria such as function. Just
how does the entity act on the environment, and how does the environment
act on the entity.

>I also don't know what you mean by a "standard interface".  It suggests 
>that some information processing is going on in the sensory unit; it's not 
>obvious to me that this processing too doesn't belong to the system. 

That's my point exactly.  A little processing power in the S/E cluster
could reduce the bandwidth of the information exchange with the undisputed
entity, to the point where the linkage could be over a standard narrow band
interface like RS-232.  This narrow band interface could very easily be the
point of minimum information exchange, without being the obvious place for
drawing the line between entity and environment.

>This question of what a system is isn't merely my own hobbyhorse; it  
>underlies the famous Systems Reply as well. 

Not famous enough.  References?
--
Ken Easlon
ken@holonet.net


Newsgroups: comp.ai.philosophy
From: avrom@Csli.Stanford.EDU (Avrom Faderman)
Subject: Re: brains in a vat
Organization: Stanford University CSLI
Date: Tue, 15 Dec 1992 23:14:14 GMT

In article <1992Dec2.030619.103@clark.edu> t22@clark.edu (Karen M Reagan) 
wirtes:

| In article # 8734 Ken Ealson (ken@holonet.net) said:
|> In thinking about artificial consciousness, the idea of 
|> emulating human consciousness is bound to come up.
|
| Of course.  Is there some other consciousness that we have 
| any idea how to simulate?  Has another form of awareness
| been discovered that I am not conscious of? (:-))
|    If this is an uneducated question feel free to flame me 
| off the screen.

I wouldn't say it's an uneducated question (It's one that at least Searle 
and Dreyfus, and probably many others, have asked with the same skeptical 
tone), but I'm not sure the answer to it is as obviously "no" as you seem 
to be suggesting.

There are certain features about humans that are obviously essential to 
their consciousness.  The least controversial of these that I can think of 
is that we have representations of various possible situations of the world. 
(This surely isn't sufficient, but what is necessary beyond it is a matter 
of the vigorous debate--in fact most of the posts to this newsgroup are 
part of this debate).

This is a separate question from, "How do we humans go about the monumental 
task of being conscious?"  An answer to _this_ question will undoubtedly 
have something to do with eyes and neurons and variations on Perceptron 
learning procedures--none of which, it seems, are really conceptually 
part of consciousness itself.

It may be the case that the simplest way to produce consciousness on a
computer is to make it simulate a human.  Then again, it may not be--
perhaps traditional symbolic architectures will have a resurgence of 
popularity and lead to the construction of the first real AI.  Time 
will tell.


-- 
Avrom I. Faderman                  |  "...a sufferer is not one who hands
avrom@csli.stanford.edu            |    you his suffering, that you may 
Stanford University                |    touch it, weigh it, bite it like a
CSLI and Dept. of Philosophy       |    coin..."  -Stanislaw Lem
From: sahle@csgrad.cs.vt.edu (Eskinder Sahle)
Newsgroups: comp.ai.edu
Subject: Help--NLP Refs....
Date: 17 Dec 92 19:24:43 GMT
Organization: VPI&SU Computer Science Department, Blacksburg, VA


Hello all:

Could anyone refer me to some Natural Language Processing survey
sources, where a history of the NLP field, etc., are given? I would
really appreciate it,

Thanks,
Ahmed
Newsgroups: comp.ai.edu
Subject: Re: LISP in survey AI course
From: pondy@comp.vuw.ac.nz (Peter Andreae)
Date: Mon, 14 Dec 1992 05:17:52 GMT
Organization: Dept. of Computer Science, Victoria Uni. of Wellington, NZ.

We use Prolog, mainly because the person who taught the course before was a
prolog person more than a lisp person (though he had programmed extensively on
lisp machines also). He left and I (example MIT) had to teach the course, along
with a new faculty member (from Yale) who is also a lisp hacker.  We used
prolog, and were pretty pleased with it.  You can, in fact, get to do neater
stuff, sooner, if you use prolog.  When you get to large programs, I doubt that
there is a lot of difference, and I would prefer lisp myself.  But for
introducing the ideas of AI, prolog seems far superior.  For simple rule based
systems, logical inference, simple planners, and (especially) natural language,
it is just great.  It's also a very neat language.  I shall continue lisp
hacking for myself, but there seems little point in teaching lisp, as far as I
can see now.  Anyway, it isn't that different from the other procedural
languages - more flexible, and less safe (ie, no type checking for you), but
just a flexible version of the same old thing.  Prolog, on the other hand, is a
really different kind of language, and it seems to me that it is worth exposing
all our students to it, just to broaden their minds.


Peter Andreae     (Pondy)
~~~~~~~~~~~~~
Email:  pondy@comp.vuw.ac.nz     Mail:   Victoria University,    
Phone:  +64 4 472 1000                   P.O. Box 600,           
Fax:    +64 4 495 5232                   Wellington, New Zealand 



 
--

Peter Andreae     (Pondy)
~~~~~~~~~~~~~
Email:  pondy@comp.vuw.ac.nz     Mail:   Victoria University,    
Phone:  +64 4 472 1000                   P.O. Box 600,           
Fax:    +64 4 495 5232                   Wellington, New Zealand 



 
Xref: sparky comp.ai.edu:578 comp.ai:4635
From: pl140048@academ01.mty.itesm.mx (Leonardo Garrido)
Newsgroups: comp.ai.edu,comp.ai
Subject: Re: ref. about case-based reasoning
Date: 15 Dec 92 22:25:59 GMT
Followup-To: comp.ai.edu

I have seen info about case-based reasoning in the comp.ai FAQ ...

I hope this helps !

Leonardo Garrido-Luna.                                                         
Center for Artificial Intelligence.                                         
Monterrey  Institute of Technology.                                            
E-mail: PL140048@academ01.mty.itesm.mx
Newsgroups: comp.ai.edu
From: yusuf@ils.nwu.edu (Yusuf Pisan)
Subject: Solving a set of equations
Organization: The Institute for the Learning Sciences
Date: Wed, 16 Dec 1992 14:20:41 GMT


I am trying to find a system which can solve a set of equations for
an unknown. It seems simple enough, but I have not been able to write
one that does not explode on me.

I would prefer a system which has the source code available, but I
guess I will settle for anything that can be used as a "black box". I
am not looking for an extremely complicated program (such as
Mathematica) which has zillions of functions, or other expensive
products.



Any references to existing programs and/or algorithms very much appreciated.


Yusuf Pisan
y-pisan@nwu.edu
Newsgroups: comp.ai.edu
From: jbk@world.std.com (Jeffrey B Kane)
Subject: Genetic Algorithms mail list
Summary: faq or mail list for genetic algorithms
Keywords: GENETIC ALGORITHMS ARTIFICIAL LIFE MAILING LIST
Organization: The World Public Access UNIX, Brookline, MA
Date: Tue, 15 Dec 1992 19:04:08 GMT

I've been looking all over trying to find an faq list for genetic algorithms.
I need to purchase a book that would be a very practical guide to developing
an optimization program using Genetic algorithms and don't know which of
the many references I should put my money on.  If you had to buy just one
book that let you get going, what would it be?

Also, I'm sure there must be an faq or GA mail list that exists. Does anyone
know where it might be?

    Jeffrey


======================================
Jeffrey Kane, MD
Kane Biomedical Systems
Boston, MA

Internet    jbk@world.std.com
Compuserve  74206,640
AppleLink   D0738

[Don't take life too seriously... it's not like anyone gets out of it alive.]
Newsgroups: comp.ai.edu
From: juris@cs.toronto.edu (Igor Jurisica)
Subject: Re: Genetic Algorithms mail list
Keywords: GENETIC ALGORITHMS ARTIFICIAL LIFE MAILING LIST
Organization: Department of Computer Science, University of Toronto
Date: 15 Dec 92 20:11:13 GMT

jbk@world.std.com (Jeffrey B Kane) writes:

>Also, I'm sure there must be an faq or GA mail list that exists. Does anyone
>know where it might be?

Genetic Algorithms Digest

 - Send submissions to GA-List@AIC.NRL.NAVY.MIL
 - Send administrative requests to GA-List-Request@AIC.NRL.NAVY.MIL
 - anonymous ftp archive: FTP.AIC.NRL.NAVY.MIL (Info in /pub/galist/FTP)

Regards,
	Igor

.....................................................................
.                I. Jurisica,  juris@ai.utoronto.ca                 .
.  Univ. of Toronto, Dept. of Comp. Sci., Toronto, ON M5S 1A4, CDN  .
.....................................................................
From: konrad@aupair.cs.athabascau.ca (Konrad Michalski)
Newsgroups: comp.ai.edu
Subject: item bank
Date: 14 Dec 92 17:33:19 GMT



We are looking for an item bank which runs on UNIX, or VMS 
(if it's micro based we would also consider it).

We would appreciate if someone could give us contact information about
existing item banks.

The following are our requirements, but we are open to any suggestions.

Detailed requirements are available upon request.



The course outline includes the course ID, the full course name. In
addition, the course structure of units and sub-units or objectives is
specified.

Course outline input
	Interactive (prompted screen entry)
	Off-line creation (ASCII off-line editing format)

Course outline editing
	Interactive editing (prompted screen edit)

Course outline output
	Screen display
	Print

Item types
	Multiple choice
	True/False
	Fill in the blanks
	Matching
	Subjective (Essay)

Item contents
	Identification
	Graphics
	difficulty level
	Feedback (an explanation of the correct/wrong answer)
	Answer reference (reference of the course materials)

Item creation/editing

Item bank display/output (screen, print)

Assessment development and management (assessments are stored as
"profiles"). Profiles contain all information about the assessment except
the actual body of the items.

Test management (randomization, timing, navigation)

Record keeping and reporting

Item analysis

Documentation
Newsgroups: comp.ai.edu
From: upcc@huracan.cr (Centro de Computo - UP)
Subject: NO SE
Organization: Universidad de Panama
Date: Wed, 16 Dec 92 18:30:55 CAM
From: cofria@csws18.ic.sunysb.edu ()
Subject: comp.ai.philosophy comp.ai.neural-nets
Originator: cofria@csws18.ic.sunysb.edu
Organization: State University of New York at Stony Brook
Date: Sat, 12 Dec 1992 20:55:24 GMT

Greetings,

	I was wondering if anyone could tell me of any good ftp sites where
I could aquire information on Artificial Life (or if there are any news
groups I should know about.)  I'm currently doing a research paper on it,
so any information would be much appriciated.  Thanx.

						--- Charles
Xref: sparky comp.ai:4613 news.answers:4505
From: tfpayn01@ulkyvx.louisville.edu
Subject: Re: Info about Eurisko
Date: Tue, 15 Dec 1992 14:32:13 GMT
Organization: University of Louisville

In article <pa222061.724115664@academ01>, pa222061@academ01.mty.itesm.mx (ROSAS AGUILAR CLAUDIO) writes:
> 
> 
>   Hi everyone:
> 
>      I'm looking information about EURISKO project
>      made by Doug Lenat. So I'll apreciate any 
>      information about it.
> 
>      Thanks in advance.
> 
>                  Claudio
> 
>  
-- 
	Please include send me information also.

	Thanks ahead of time!


/  / // / / /  / /  / / // / / // / //  / /   /  // /  / / / / // // / / / // /
// // /  / // /// // / / /// /// // /// /// // // /// / ///// // /   / // // /
/  /  ________|\_______________________________________________   /  /  // / /
/ // |\_\_\_\_| |_____________________________________________/   / / / / / / /
// / / /      |/  / / //  // /  / / / //  /  /  / /  /  /  / /  /  / / / /// /
/  / /  /  ///  / /  /  Tom Payne *** Louisville, KY	 / //  /  /  /  / / / /
 /  //TFPAYN01@ULKYVX.LOUISVILLE.EDU   /  / INFTECR1@ULKYVM.LOUISVILLE.EDU /// /
/ // / /  /   / / / /  ///  // (502) 635-2473 / / // // // / /////  / / // // / 
<><><><><> ARE <><><><> YOU <><><><> READY <><><><> TO <><><><> DIE? <><><><><>

Newsgroups: comp.ai
From: richardd@syma.sussex.ac.uk (Richard Dallaway)
Subject: Reference wanted: AI like computers in movies
Organization: University of Sussex at Brighton
Date: Mon, 14 Dec 1992 17:03:25 GMT

I once saw AI defined as something like:
    To make computers behave the way they do in movies.
Does anyone know who said this?

Thanks
Richard
Newsgroups: comp.ai
From: afzal@divsun.unige.ch (Afzal Ballim)
Subject: Re: Offprints of dissertation on belief systems available
Keywords: Belief, dissertation
Reply-To: afzal@divsun.unige.ch
Organization: University of Geneva, Switzerland
Date: Fri, 18 Dec 1992 08:16:56 GMT

A number of people have asked if I was talking about electronic
or physical copies of my dissertation in the previous message.
I was talking about physical, although on reflection electronic
is better for me as I have to pay for printing and mailing
myself. So, if your interested in an electronic copy, then mail
me your email address and tell me if you can handle A4 or only
US Letter (the A4 version is more compact because its a 2-up
file, i.e., really A5). 

For those who have already contacted me, I'll contact you asking 
which you prefer. If you really can't a handle PostScript file,
then I'll send you the photocopied offprint. 

Finally, if you'd like more details on my belief work (as well
as information on facets not covered in my dissertation), then
you could run out and get a copy of the book:-)

	Artificial Believers (1991)
	Afzal Ballim & Yorick Wilks
	Lawrence Erlbaum Associates, ISBN: 0-8058-0453-6

-- 
Afzal Ballim	             |BITNET,EARN,MHS,X.400: afzal@divsun.unige.ch
 ISSCO, University of Geneva |UUCP: mcsun!divsun.unige.ch!afzal
 54 route des Acacias	     |JANET: afzal%divsun.unige.ch@uk.ac.ean-relay
 CH-1227 GENEVA,Switzerland  |CSNET,ARPA: afzal%divsun.unige.ch@relay.cs.net
From: murakami@hac2arpa.hac.com (Gary A. Murakami)
Newsgroups: comp.ai
Subject: Found Esteem Software Inc.
Date: 14 Dec 92 16:55:44 GMT
Organization: Hughes Training Inc.

Found the info about the subject company from two different netters.
--
Esteem Software Incorporated
302 E. Main St.
Cambridge City, IN 47327
Phone: (317) 478-3955
Fax:   (317) 478-3550
----
Gary Murakami       |  murakami@hac2arpa.hac.com
Hughes Training Inc.|  murky@hti.hac.com
West Covina, Calif. |
From: shaouyw@cse.fau.edu (William Shaouy)
Newsgroups: comp.ai.shells
Subject: Mixed language question
Date: 16 Dec 92 19:59:54 GMT
Distribution: USA
Organization: Florida Atlantic University, Boca Raton, FL, USA


I have put together an expert system with the CLIPS expert system
shell on the IBM PC, and
would now like to add the functionality of the computer's sound board
(called the M-Audio Capture and Playback Adapter).

This board can be controlled with programs written in C or assembly.
Ideally, what I'd like to do is have the board, controlled by the
C or assembly program, output some audio samples; after this, the CLIPS
environment will be entered.

My question is this: can I write a C or assembly program which can
ultimately enter the interactive CLIPS environment?


	Thanks in advance,
				Bill Shaouy
				shaouyw@sol.cse.fau.edu
Newsgroups: comp.ai.shells
From: nholtz@zonker.cascade.carleton.ca (Neal Holtz)
Subject: Simple Production Systems (C-based)
Organization: none
Date: Wed, 16 Dec 1992 21:42:58 GMT

Readers of this newsgroup may be more used to the idea
of full-blown production systems such as CLIPS.  Is there anything
at the other end of the spectrum?  I'm thinking of something
in the spirit of YACC that takes a set of production rules
and compiles them to C.  I'm vaguely aware of something called
TLC (Translate Rules to C), but my version dates from many years
ago (and I don't know if I can even find it again).
                                  
The tool could be pretty simple, handling only floating point
computation perhaps.  All I ask is that the rules be 
order-independant.

The kind of application I have in mind is design/detailing
of structural steel components.  Typically there are a lot
of decisions, comparisons, etc to be made with relatively
simple computations.  Traditional programming techniques
leads to programs that are 1/2 (or more) 'if' statements.
You haven't lived till you've tried to maintain a Fortran
version of one of these beasts.

Full PS's like CLIPS are overkill for these kinds of apps
(I think).
--
Prof. Neal Holtz,  Dept. of Civil Eng.,  Carleton University,  Ottawa,  Canada
Internet: nholtz@civeng.carleton.ca  Ph: (613)788-2600x5797 Fax: (613)788-3951
Newsgroups: comp.ai.shells
From: riley@krakatoa.uucp (Gary Riley [PT4])
Subject: Re: Windows 3.1 support for CLIPS version???
Keywords: CLIPS
Organization: Software Technology Branch - NASA/Johnson Space Center
Date: Mon, 14 Dec 1992 05:48:27 GMT

In article <1992Dec11.210240.2037@blkbox> egan@blkbox (Doug Egan) writes:
>
>	When will the MS Windows 3.1 version of CLIPS be released??
>

Most likely sometime around February/March for NASA and its contractors
and April/May for those getting it through COSMIC.
From: lynne@hazel.hac.com (Lynne Case)
Newsgroups: comp.ai.shells
Subject: CLIPS 4.3 vs 5.0
Date: 18 Dec 92 14:19:41 GMT
Organization: Hughes Aircraft Company

I have two questions for CLIPS users.  We have been using CLIPS 4.3
for about two years now. We have 5.0 but have never installed it
because we do not have documentation.  My questions are:

     1) Is CLIPS 5.0 much faster than 4.3?  We have a large
        set of deffacts and it takes almost a minute just
        to reset them.

     2) Is there an ftp site for the CLIPS documentation?  We
        are a NASA contractor so we should be able to get free
        software and documentation but we don't want to wait for
        COSMIC to ship.
--- 
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Lynne Case                      || I generally avoid temptation unless 
Hughes Aircraft Co.             || I can't resist it.
e-mail: lynne@mitchell.hac.com  ||              --- Mae West
 phone: (703) 759-1357 or 1256  ||
   fax: (703) 438-8430          ||
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Newsgroups: comp.ai.shells
From: egan@blkbox (Doug Egan)
Subject: Windows 3.1 support for CLIPS version???
Organization: CVR
Date: Fri, 11 Dec 1992 21:02:40 GMT
Summary: When will the Windows 3.1 version of CLIPS be released?
Keywords: CLIPS


	When will the MS Windows 3.1 version of CLIPS be released??


-- 
Doug Egan    CompuVision Research                                         
Internet:    egan@blkbox.com                                              
Friendswood, Texas                                                        
--------------------------------------------------------------------------  
Newsgroups: comp.ai.shells
From: bhonsle@sf49ers.iss.nus.sg (Shailendra K Bhonsle)
Subject: Re: WANTED: RULE SET OF SMALL EXPERT SYSTEM
Organization: Institute of Systems Science, NUS, Singapore
Date: Wed, 16 Dec 1992 03:31:47 GMT

In article <1992Dec14.083215.9710@nuscc.nus.sg>, scip2012@nusunix1.nus.sg (WU JIANHUA) writes:
|> Hi,
|> 
|> I am looking for a set of rules for expert systems. It should be
|> consistent and associate with some uncertain information.
|> 
|> Can anyone give some hints? Many thanks in advance!
|> 
|> 
|> Cheers,
|> ********************************************************************************
|>         **   **            Wu, Jianhua
|>        **   ** **  **   ** Dept. of Infomation Systems & Computer Science
|>       **   *** ** ** * **  National University of Singapore 
|>  **  **   **  ** ** * **   Singapore 0511
|> **  **   **  ** *******    E-Mail: WuJianHu@ISCS.NUS.SG, Scip2012@NUSUNIX.NUS.SG
|> ****   ***  **  ** **      Phone : +65 7726136       Fax: +65 7794580
|>                         

-- 
Hi,
This is only incomplete answer but may help you. Read the excellent book by 
Girratano, Riley called "Expert Systems: Principles and Programming". I am quite new in this field and am finding the book invaluable. It has one whole chapter on reasoning under uncertainty.


Shailendra
(bhonsle@iss.nus.sg)

 
Newsgroups: comp.ai.shells
From: scip2012@nusunix1.nus.sg (WU JIANHUA)
Subject: WANTED: RULE SET OF SMALL EXPERT SYSTEM
Organization: National University of Singapore
X-Newsreader: TIN [version 1.1 PL6]
Date: Mon, 14 Dec 1992 08:32:15 GMT

Hi,

I am looking for a set of rules for expert systems. It should be
consistent and associate with some uncertain information.

Can anyone give some hints? Many thanks in advance!


Cheers,
********************************************************************************
        **   **            Wu, Jianhua
       **   ** **  **   ** Dept. of Infomation Systems & Computer Science
      **   *** ** ** * **  National University of Singapore 
 **  **   **  ** ** * **   Singapore 0511
**  **   **  ** *******    E-Mail: WuJianHu@ISCS.NUS.SG, Scip2012@NUSUNIX.NUS.SG
****   ***  **  ** **      Phone : +65 7726136       Fax: +65 7794580
                        
Newsgroups: comp.ai
From: scip2012@nusunix1.nus.sg (WU JIANHUA)
Subject: WANTED: RULE SET OF SMALL EXPERT SYSTEM
Organization: National University of Singapore
X-Newsreader: TIN [version 1.1 PL6]
Date: Mon, 14 Dec 1992 08:35:22 GMT

[ Article crossposted from comp.ai.shells ]
[ Author was  ]
[ Posted on Mon, 14 Dec 1992 08:32:15 GMT ]

Hi,

I am looking for a set of rules for expert systems. It should be
consistent and associate with some uncertain information.

Can anyone give some hints? Many thanks in advance!


Cheers,
********************************************************************************
        **   **            Wu, Jianhua
       **   ** **  **   ** Dept. of Infomation Systems & Computer Science
      **   *** ** ** * **  National University of Singapore 
 **  **   **  ** ** * **   Singapore 0511
**  **   **  ** *******    E-Mail: WuJianHu@ISCS.NUS.SG, Scip2012@NUSUNIX.NUS.SG
****   ***  **  ** **      Phone : +65 7726136       Fax: +65 7794580
                        
Newsgroups: comp.ai
From: lloyd@cs.monash.edu.au (lloyd allison)
Subject: Re: Cluster Analyis Public Domain Programs
Organization: Computer Science, Monash University, Australia
Date: Tue, 15 Dec 1992 23:23:11 GMT

mdlm@great-grain.ai.mit.edu (Michael De-la-Maza) writes:
>Where can I get public domain programs for cluster analysis?

SNOB is a classification program
available from:  dld@cs.monash.edu.au
and described in:
   C. S. Wallace,  Classification by minimum-message-length encoding,
   in Advances in Computing and Information ICCI-90
   Springer Verlag LNCS V468 pp72-81 1990

SNOB handles discrete-valued attributes and real-valued attributes.
It is written in Fortran and can process hundreds of objects with dozens
of attributes quite rapidly.
It infers the "best" classification (clustering) of the given
objects under an information theoretic criterion.