HDTenEightyP/NetNews huggingface dataset:
From: robert@sybase.UUCP (Robert Garvey)
Newsgroups: comp.ai.shells
Subject: commercial work w/expert systems in Chicago and Indianapolis?
Keywords: expert systems, jobs, Chicago, Indianapolis
Date: 22 Aug 92 23:24:07 GMT
Followup-To: comp.ai
Organization: Tupleware of Emeryville


I know someone whose current employment has a limited lifetime.  He's
worked with expert systems for over five years and would be interested
in working in the Chicago or Indianapolis area.  If you know of
companies in either area with a need for someone with such a
background, could you provide me with the names of those companies?
Also, I'd appreciate the names of people within those companies to be
contacted about job opportunities there.

Please send any information to me via e-mail, as I don't read either
groups.  I'm busy enough with natural intelligence or lack thereof.

Thanks.
-- 
Robert Garvey robert@sybase.com {sun,lll-tis,pyramid,pacbell}!sybase!robert
	      Sybase, Inc   6475 Christie Ave   Emeryville, CA   94608-1010

If Sybase were to pay employees for their opinions, they couldn't afford me.
From: liz@grian.cps.altadena.ca.us (Liz Allen)
Newsgroups: comp.ai.shells
Subject: Re: HELP: CLIPS rule for conflict resolution
Date: 20 Aug 92 22:30:58 GMT
Organization: College Park Software, Altadena, CA

srt@aero.org (Scott R. Turner) writes:

>A similar situation which arises fairly frequently is an "otherwise"
>situation.  I.e., you have a set of classification rules, and the last
>rule is "otherwise, X":

>	(defrule c-1
>	  (value x ?x)
>	  (test (> ?x 1))
>	  (test (< ?x 3.2))
>	=>
>	  (assert (class 1)))


>	(defrule c-2
>	  (value x ?x)
>	  (test (> ?x 4.7))
>	  (test (< ?x 8.87))
>	=>
>	  (assert (class 2)))

>	[...]

>	Otherwise, (assert (class 0))

>What's the best way to implement this kind of situation?

Combine the rules and put the test for x's value on the right hand
side.  I don't know for sure this is possible in CLIPS, but I suspect
it is.  I'll give you the YAPS solution since I can get the syntax
right for YAPS and I'd be guessing for CLIPS:

(defp classify-value
	(value x -x)
  -->	(cond ((and (> -x 1) (< -x 3.2))
	       (fact class 1))
	      ((and (> -x 4.7) (< -x 8.87))
	       (fact class 2))
	      (t (fact class 0))))

A right hand side in YAPS is simply Lisp, so that's a Lisp cond there.
This is much more efficient than a separate "otherwise" rule.  Fact
is the YAPS equivalent to assert.

Alternatively, you could have a separate knowledgebase for each
classification.  You could use a rule like the one above to dispatch
the information to the correct knowledgebase.  Or, to be more modular
about things, send the information to each knowledgebase and let the
appropriate one claim it.
-- 
		- Liz Allen	liz@grian.cps.altadena.ca.us
				ames!elroy!grian!liz
"God is light; in him there is no darkness at all." -- 1 John 1:5b
Newsgroups: comp.ai.shells
From: ssuri@nyx.cs.du.edu (srinivas suri)
Subject: help on clips
Summary: how to use if and while loops in opening the files
Keywords: loop, if and while
Organization: University of Denver, Dept. of Math & Comp. Sci.
Date: Fri, 21 Aug 92 20:13:31 GMT


hello
my previous posting appeared with no heading. Please help me 
out in how to use if and while statements in opening and reading the files.
please read my previous posting with user name suri.
thanks
sudarshan
From: SURI%TSU.bitnet@CUNYVM.CUNY.EDU (suri)
Newsgroups: comp.ai.shells
Subject: (none)
Date: 18 Aug 1992 21:49:40 -0500
Organization: UTexas Mail-to-News Gateway
NNTP-Posting-Host: cs.utexas.edu
X-Unparseable-Date: Tue, 18 Aug 1992 21:49 MULTINET_TIMEZONE

hello
could anyone tell me how to open files and read & write into the files using a
if or while loops. I need to use this to compare the contents of the two files.
First the user is asked several questions and a part of the output goes into
one file and then the user be asked the same questions and the part of output
should go to another file and then the contents in two files are compared.
I tried using the while statement it did not work. Any suggestions are welcome.
 Most of the times either the rule itself not evoked or i/o error occured.
I really appreciate your help in this. I am new to the programming world.

Please respond directly to the address given:sudarshan@tsu.bitnet

thank you
sudarshan
Newsgroups: comp.ai.shells
From: srt@aero.org (Scott R. Turner)
Subject: Re: Multiple Knowledge Bases in CLIPS
Organization: The Aerospace Corporation, El Segundo, CA
Date: Mon, 17 Aug 1992 17:59:05 GMT

news@ctr.columbia.edu (The Daily Lose) writes:
>(defrule rule-1
>   (instance 1)
>   (whatever other facts apply)
>=>
>   RHS

One difficulty with this is that I want to use the same rule base for
multiple different entities, i.e., I want to create multiple instances
of each rule base.

						-- Scott T.
From: steve.rainwater@ocitor.fidonet.org (Steve Rainwater)
Sender: FredGate@ocitor.fidonet
From: tsatsoul@kuhub.cc.ukans.edu
Newsgroups: comp.ai.shells
Subject: CBR tools ??
Date: 21 Aug 92 16:56:35 CDT
Organization: University of Kansas Academic Computing Services

Are you familar with any Case-Based Reasoning shells? I have seen the one
by Inference corp. (CBR Express), but am looking for more tools for
comparison.

--- Costas Tsatsoulis
tsatsoul@kuhub.cc.ukans.edu
Newsgroups: comp.ai.shells
From: robert@ctpm.uq.oz.au (Robert Merlicek)
Subject: Anyone out there using Level 5 Object?
Organization: Centre for Language Teaching and Research, Uni of Queensland, AUSTRALIA.
Date: Wed, 12 Aug 1992 22:31:50 GMT

Is there anyone developing applications in Level 5?.

I would like some feedback as we wish to do some development in this
package, but like like comments first

Regards
Robert
 
--
*******************************************************************************
*  Robert Merlicek            * "Mans mind once streched by a new idea        *
*  robert@pest.ctpm.uq.oz.au  *  never reagins it's original dimensions" -OWH *
*  Ph. (07) 3651875                                                           * 
Newsgroups: comp.ai.shells
From: srt@aero.org (Scott R. Turner)
Subject: Multiple Knowledge Bases in CLIPS?
Organization: The Aerospace Corporation, El Segundo, CA
Date: Fri, 14 Aug 1992 16:39:29 GMT

Is it possible to have multiple, separate knowledge bases in CLIPS?
I'd like to embed several "instances" of CLIPS in an application,
something like:

	Instance 1

		rules: a b c d
		facts: f-1 f-2 f-3...


	Instance 2
	
		rules: a' b' c' d'
		facts: f-1' f-2' f-3'

and be able to "run" Instance 1, then switch over to Instance 2,
assert some new facts, run there, and so on.  Is there some way to do
this?

						-- Scott T.

						
Newsgroups: comp.ai.shells
From: news@ctr.columbia.edu (The Daily Lose)
Subject: RE: Multiple Knowledge Bases in CLIPS
Organization: Columbia University Center for Telecommunications Research
Date: Mon, 17 Aug 1992 15:16:55 GMT
X-Posted-From: dlgeo.cr.usgs.gov
X-Posted-Through: sol.ctr.columbia.edu

I know of no way to do what Scott was inquiring about running mutiltiple
knowledge bases in CLIPS.  It may You could probably do something lito
include a fact in to only match on your Instance 1/Instance 2: . I
am not saying this very well:

(defrule rule-1
   (instance 1)
   (whatever other facts apply)
=>
   RHS
)

(defrule rule-2
   (instance 2)
   (whatever other facts apply)
=>
   RHS
)

Or maybe
(defrule zzz
   (instance 1-1 (fact) fact(fact))
=>
   RHS
)
where you use deftemplate facts (guess I used (fact) incorrectly hereabove).

Sorry this is a mess - I have no direct access to news , so am
using a server which means I can't edit a nice sensible message
before I submit it.

Pat McCLanahan
EROS Data Center
Sioux Falls, SD
mcclanah@dlgeo.cr.usgs.gov
Newsgroups: comp.ai,comp.theory.self-org-sys
From: neal@cs.UAlberta.CA (Sanche Neal Andrew)
Subject: Speech Algorithm Follow Up
Keywords: SPEECH
Organization: University of Alberta, Edmonton, Canada
Date: Wed, 12 Aug 1992 14:43:50 GMT

Earlier I posted a query which asked for references to any
publications relating to the analysis of speech input. I have
not received any replies -- is there pollitical reasons <grin> --
but I have done some asking around and have found out the following:

'Speech Communication: Man and Machine by O'Shaughnessy (Addison Wesley
1987) contains research which led to Bell Northern Research producing an
algorithm called the Asymetric Time Warp algorithm. This algorithm
supposedly produces an eigthy byte value given a digitized spoken word
which will uniquely identify the speaker of that word.

My information is not yet complete but it is a start. If anyone has
more information for me, I would very much like to know. I am persuing
a research project which involves the use of algorithms of this type.

Newsgroups: comp.ai
From: styri@hal.nta.no (Haakon Styri)
Subject: Re: ID3 program available ???
Reply-To: styri@nta.no
Organization: Norwegian Telecom Research
Date: Wed, 19 Aug 92 07:00:40 GMT

In article <pl140048.714175449@academ01>,, Leonardo Garrido writes:
>
>I also remember that someone here in comp.ai said that there is a book by 
>Quinlan on C4.5 that is the successor of ID3 (the same author). This is 
>available from Morgan Kaufman. I guess this new algoritm is similar and 
>better that its predeccessor. I guess the book is accompanied by the C code.

I haven't got around to calling Morgan Kaufman yet, but an extensive search
in lists of published books didn't help me. Either this is a reference to
a paper in some `readings' book, or it is a `to be published'.

Any more info?

---
Haakon Styri
Norwegian Telecom Research
From: N.Ahmad@cs.ucl.ac.uk (Nesar)
Newsgroups: comp.ai
Subject: Re: self-tuning and learning fuzzy algorithms
Date: 12 Aug 92 15:15:44 GMT


>I am deeply interested into

>       self-tuning or learning fuzzy algorithms and

>       applications of fuzzy control in robotics.

>I would appreciate any hint or references to literature on these topics.

>Khachatouri Vahe, Institute for Flexible Automation
-----------------------------------------------------

The following are the few references for Self-Organizing Fuzzy
Logic Control algorithms. 

1.Procyk,T.J, and Mamdani,E.H.," A linguistic Self-Organizing
  Process Controller." Automatica, Vol.15 (1979), 15-30.

2.Sutton,R. and Jess,I.M.,"A Design Study of a self-prganizing
  fuzzy autopilot for ship control." Proceedings of Institution of
  Mechanical Engineers, Part I: Journal of Systems and control
  Engg. Vol 205, (1991), 35-47.

3.Lee,C.C.,"Fuzzy Logic in Control Systems: Fuzzy Controller-
  Part 1 and Part 2," IEEE Trans Sys Man and Cybernetics,
  Vol. SMC-20 No.2 (March/April 1990) 404-435.


You may find references about fuzzy control in robotics in Ref.3,
i.e Lee's paper. 

I hope this serve your purpose. I may be able to give additional 
information on request, based on my recently submitted Ph.D thesis
entitled" REAL-TIME INTELLIGENT DISTRIBUTED CONTROL SYSTEMS"
at Indian Institute of Technology, New Delhi.

Nesar Ahmad,
University College London.

E-Mail: N.Ahmad@uk.ac.ucl.cs
From: skalsky@aaai.org (Rick Skalsky)
Newsgroups: comp.ai
Subject: AAAI-93 Call for Tutorial Proposals
Date: 17 Aug 92 15:32:19 GMT

Call for Tutorial Proposals, AAAI-93

The AAAI-93 Program Committee invites proposals for 
the Tutorial Program of the American Association for 
Artificial IntelligenceUs National Conference on 
Artificial Intelligence (AAAI-93). Tutorials will be held 
July 11-12, 1993. Anyone who is interested in presenting 
a tutorial at AAAI-93 should submit a proposal to the 
1993 Tutorial Chair, Paul Cohen.


Topics

Previous tutorial topics have included:
-   AI in Business, Finance, and Accounting
-   Architectures for AI Applications
-   Knowledge Acquisition Techniques
-   Model-Based Diagnosis
-   Machine Learning and its Role in KB Systems
-   Neural Nets for Real World Problems
-   Experimental Methods
-   Object-Oriented Programming and Expert Systems
-   Genetic Algorithms
-   Knowledge-Based Scheduling
-   AI Techniques in Human Computer Interface Design
-   Case-Based Reasoning
-   Distributed Artificial Intelligence
-   Planning
-   Verification and Validation

AAAI is interested in proposals covering new or existing 
topics from either beginning or more advanced areas.

We encourage proposals which cover topics that include 
immediate practical applications or usage.


Submission Requirements

We need two kinds of information in proposals: 
information that will be used for selecting proposals and 
information that will appear in the tutorial description 
brochure. So each proposal should contain the following:
-   Goal of the tutorial
-   Detailed outline, possibly augmented with sample 
materials
-   Tutorial description: a short paragraph summarizing 
the tutorial outline
-   Prerequisite knowledge: what knowledge is assumed

Please also submit the following information about the 
presenters:
-   name, mailing address, phone number, email address;
-   background in the tutorial area, including a list of 
publications;
-   any available examples of work in the area (ideally, a 
published tutorial-level article on the subject);
-   evidence of teaching experience (courses taught or 
references);
-   evidence of scholarship in AI/Computer Science

Each tutorial must be offered by a team of presenters 
(usually two people, sometimes three).

Those submitting a proposal should keep in mind that 
tutorials are intended to provide an overview of a field 
or practical training in an area; they should present 
reasonably well agreed upon information in a balanced 
way. Tutorials should not be used to advocate a single 
avenue of research, nor should they promote a product.


Submission Deadline

Proposals must be received by November 1, 1992.

Decisions about the tutorial program will be made by 
November 15, 1992.

Speakers should be prepared to submit completed course 
materials by March 31, 1993.

Proposals should be sent to:

Professor Paul Cohen
Department of Computer Science
Lederle Graduate Research Center
University of Massachusetts
Amherst, MA 01003
Telephone (413) 545-3638
Email: cohen@cs.umass.edu

Newsgroups: comp.ai
From: szpak@csi.uottawa.ca (Stan Szpakowicz)
Subject: postdoc sought
Organization: Dept. of Computer Science, University of Ottawa
Date: Sat, 15 Aug 92 00:15:11 GMT

The Department of Computer Science, University of Ottawa, and the School of
Business, Carleton University, invite applications for a postdoctoral
position on the project "Automation and Support of Decisions with Strategic
Interactions". Candidates must have a completed PhD, background in Artificial
Intelligence and in Decision Analysis, and a record of research in at least
one of these areas. The position is available immediately, for a year, with a
possibility of renewal for another year. The salary is $27,500 a year, plus
an excellent benefit package.

The postdoctoral fellow will be an essential member of the project's team,
and will play an active role in all aspects of the project, including major
research decisions. Duties include participation in theoretical and practical
research work, in supervision of graduate students, and in the publications
that will arise from the project.

Application, inquiries and requests for more details:
Dr. Stan Szpakowicz
szpak@csi.uottawa.ca
tel. 613-564-2450, fax: 613-564-9486

Department of Computer Science
University of Ottawa
150 Louis Pasteur
Ottawa, Ontario      K1N 6N5 
Canada
From: farzin@apollo3d.apollo3.ntt.JP (Farzin Mokhtarian)
Newsgroups: comp.ai
Subject: Re: Fuzzy Logic Short Course Announcement
Date: 21 Aug 92 10:16:08 GMT
Followup-To: comp.ai
Organization: none

In article <hn343277@tazdevil> henrik@mpci.llnl.gov (Henrik Klagges) writes:

 @Don't want to finicky, but that was pretty much a commercial posting.
 @It also didn't seem to be terribly well targeted on the research level.
 @
 @Henrik Klagges
 @IBM Research division Physics Group Munich
 @massively parallel group at Lawrence Livermore

I am surprised. Is every article expected to be at the research level?!
   
  Farzin Mokhtarian
  NTT Basic Research Labs
  Tokyo, Japan
From: pl140048@academ01.mty.itesm.mx (Leonardo Garrido)
Newsgroups: comp.ai
Subject: Re: ID3 program available ???
Date: 18 Aug 92 22:04:09 GMT

alsberg@math.uio.no (Bj|rn Alsberg) writes:

>I'm desperately seeking an ID3 (or similar) program preferably
>written in C (Fortran is acceptable also). Could anyone provide
>a ftp address etc. for obtaining such a program?
>Thanks in advance for any help!

I remember that there are some public domain ID3 algoritms in: cs.utexas.edu
directory: /pub/mooney

I also remember that someone here in comp.ai said that there is a book by 
Quinlan on C4.5 that is the successor of ID3 (the same author). This is 
available from Morgan Kaufman. I guess this new algoritm is similar and 
better that its predeccessor. I guess the book is accompanied by the C code.

I hope this helps !

Leonardo Garrido-Luna.
Newsgroups: comp.ai
From: sitomlin@undergrad.math.waterloo.edu (Stephen I. Tomlinson)
Subject: Re: Request for demo. program in Genetic Algorithm.
Organization: University of Waterloo
Date: Wed, 12 Aug 1992 16:41:50 GMT

In article <1992Aug4.161803.1@cucs17.cs.cuhk.hk> wltam@cucs17.cs.cuhk.hk writes:
>What I want is just a program . . . to demonstrate the general steps in a
>genetic algorithm.  It doesn't matter if the program is just a toy kit. 

See July 1992 _Scientific_American_.
It contains pseudo-code for a toy program, among other things.

-Stephen
From: Randy.Baer@f310.n3603.z1.FIDONET.ORG (Randy Baer)
Newsgroups: comp.ai
Subject: turbo prolog
Date: Thu, 13 Aug 92 23:51:44 EDT
Organization: FidoNet node 1:3603/310 - Tetragrammatton, St Petersburg FL

 
  Sometime ago I asked about Turbo_Prolog.  I bought at a going
out of business sale.  I called Borland and was informed that it
was no longer supported.   I need to know if it is adequete to
use in learning the language. Also if it is not WHAT is recommended
that will run on a MSDos 5.0 386sx.  I don't want to spend more than
.50 cents :-) :-)
Thnaks
Randy
Tetragrammatton Enterprises               :  Just a poor student
v of tee is equal to L times dee I dee T  :  lost somewhere in the Integral,
                                          :  or what ever that is overthere.

--  
Internet: Randy.Baer@f310.n3603.z1.FIDONET.ORG
UUCP: ...!myrddin!tct!psycho!310!Randy.Baer
Note:psycho is a free gateway between Usenet & Fidonet. For info write to
     root@psycho.fidonet.org.
Newsgroups: comp.ai,comp.parallel,comp.lang.prolog,comp.research.japan
Newsgroups: comp.ai
From: gh@cs.toronto.edu (Graeme Hirst)
Subject: Re: Demon
Keywords: demon
Organization: Department of Computer Science, University of Toronto
Date: 14 Aug 92 16:06:31 GMT

In article <1992Aug14.055751.29529@unixg.ubc.ca> xie@unixg.ubc.ca (Linchi Xie) writes:
>Can somebody tell me why an attached procedure in AI is called 'demon'?
>Who coined the word?

See any large dictionary.  A demon or daemon is an "attendant,
ministering, or indwelling power or spirit: a genius"  (Webster's Third
International), and a genius is "an attendant spirit of a person or
place: a tutelary deity" -- that is, a guardian spirit.  A demon doesn't
have to be evil.

So in AI, an attached procedure is like a little demon that pops up at
the right time to look after something; rather a nice metaphor.  I
believe Eugene Charniak was the first to use it, in his dissertation,
1972.

-- 
\\\\   Graeme Hirst    University of Toronto	Computer Science Department
////   gh@cs.utoronto.ca  /  gh@cs.toronto.edu  /  416-978-8747
From: cam@castle.ed.ac.uk (Chris Malcolm)
Newsgroups: comp.ai
Subject: Re: Eenie meenie
Date: 12 Aug 92 17:24:07 GMT
Organization: Edinburgh University

In article <1992Aug10.004119.16687@access.usask.ca> choy@skorpio.usask.ca writes:

>How do we make a decision? Why do we choose as we do? A neural net
>will make it's decision based on the laws of physics. I think we
>do too. .... We do whatever the universe dictates.

Consider a chess-playing computer. In a trivial sense its next move in
the game it is playing could be predicted from the laws of physics and
a knowledge of its current state. In practice this would take grossly
more computing power than is exercised by the device itself, by very
many orders of magnitude. It would be much easier to predict it's next
move from a listing of the code. And much easier again from a spec of
the system and a knowledge of the laws of chess. But even here the
unaided computational powers of a human being would be struggling to
accomplish this prediction accurately in less than a few decades,
although a good guess might be available in a few days.

In other words, whether or not we do as the universe dictates is a
rather airy theoretical distinction, since there is no way we can
ever find out what the universe has dictated.
-- 
Chris Malcolm    cam@uk.ac.ed.aifh          +44 (0)31 650 3085
Department of Artificial Intelligence,    Edinburgh University
5 Forrest Hill, Edinburgh, EH1 2QL, UK                DoD #205
From: tmurphy@well.sf.ca.us (Thomas Murphy)
Newsgroups: comp.ai
Subject: Re: turbo prolog
Date: 22 Aug 92 15:18:11 GMT
Organization: Whole Earth 'Lectronic Link

In article <24026.2A94A6D0@psycho.fidonet.org> Randy.Baer@f310.n3603.z1.FIDONET.ORG (Randy Baer) writes:
> 
>  Sometime ago I asked about Turbo_Prolog.  I bought at a going
>out of business sale.  I called Borland and was informed that it
>was no longer supported.   I need to know if it is adequete to
>use in learning the language. Also if it is not WHAT is recommended
>that will run on a MSDos 5.0 386sx.  I don't want to spend more than
>.50 cents :-) :-)
>Thnaks
>Randy
>Tetragrammatton Enterprises               :  Just a poor student
>v of tee is equal to L times dee I dee T  :  lost somewhere in the Integral,
>                                          :  or what ever that is overthere.
>
>--  
>Internet: Randy.Baer@f310.n3603.z1.FIDONET.ORG
>UUCP: ...!myrddin!tct!psycho!310!Randy.Baer
>Note:psycho is a free gateway between Usenet & Fidonet. For info write to
>     root@psycho.fidonet.org.


The borland product will work fine...it was sold back to the company that
created it...PDC (Prolog Development Center, 568 14th St., Atlanta, GA).

tom
-- 
Thomas Murphy
Product Review Editor - Computer Language Magazine
Technical Editor - AI Expert
600 Harrison St., San Francisco, CA 94107
Newsgroups: comp.ai,comp.software-eng,comp.specification,comp.databases