HDTenEightyP/NetNews huggingface dataset:
From: bruhn@exaia (Peter Bruhn )
Newsgroups: comp.ai.genetic
Subject: Re: Simple problems to solve genetically
Date: Tue, 12 Jan 93 09:15:44 MESZ
Organization: WU-Wien
Distribution: world
NNTP-Posting-Host: exaia.wu-wien.ac.at

In article <1993Jan11.145224@IASTATE.EDU> from [Mon, 11 Jan 1993 20:52:24 GMT] you wrote:
 > In article <1993Jan8.202702.21180@fcom.cc.utah.edu>,
 > freier@mail.physics.utah.edu (rodney james freier) writes:
 > >   I'm looking for a few simple games/problems that can be played/solved
 > > genetically.  I'm just trying to practice with the concept.
 > 
 >   Just about any game with an evaluation phase can be done (chess, checkers,
 > tic-tac-toe).  Just have an alpha-beta search with node rating, and evolve
 > different ways to rate nodes.  I did this way back with connect-four.
 > 
 >   I think some of the top chess programs already do this.

Really? I am highly interested in more information. What chess program does
use GAs? Any references?

 >  |  __L__
 > -|-  ___  Warren Kurt vonRoeschlaub
 >  |  | o | kv07@iastate.edu
 >  |/ `---' Iowa State University
 > /|   ___  Math Department
 >  |  |___| 400 Carver Hall
 >  |  |___| Ames, IA  50011
 >  J  _____

Thanks a lot,
Peter (bruhn AT uxe.wu-wien.ac.at)
From: kcj@vulcan.anu.edu.au (Kate Juliff)
Newsgroups: comp.ai.genetic
Subject: Re: 2-D Chromosomes
Date: 13 Jan 1993 02:12:53 GMT
Organization: Australian National University, Canberra, Australia
NNTP-Posting-Host: 150.203.20.13

In article <1993Jan12.185333.20195@cm.cf.ac.uk> David.Beasley@cm.cf.ac.uk (David Beasley) writes:
>
>Does anyone know of any published GA work which has used 2-dimensional
>chromosomes?
>
>I've read significant proportions of all four ICGA proceedings, but
>didn't notice anything on this.

I have submitted a couple of papers for the next ICGA on multi-chromosome GAs.
There is also a TR obtainable from anonymous ftp at
arch.archsci.su.oz.au
/pub/ausga/ausga-TRs/ausga-TR-kcj.9201

These papers report results of research on mapping a combinatorial
constraint satisfaction problem onto chromosomes such that
an individual is represented by more than one chromosome. This may be
of interest to you. 

--Kate


-- 
Kate Juliff                           | kcj@matilda.vut.edu.au
Victoria University                   |
P.O. BOX 14428,                       |
MELBOURNE MAIL CENTRE, AUSTRALIA 3000 |
Newsgroups: comp.ai.genetic
From: rmah@panix.com (Robert Mah)
Subject: Re: Use of Genetic Algorithms to evolve robot behavior?
Organization: PANIX Public Access Unix, NYC
Date: Fri, 8 Jan 1993 20:11:43 GMT

In <24659@hacgate.SCG.HAC.COM> tackett@ipld01.hac.com (Walter Alden Tackett) writes:

>Larry Yaegar (sorry if I butchered the last name!) at apple (larryy@apple.com
>is his address if memory serves) has a wonderful simulation that runs on
>SGI machines.  It falls most squarely under the category of Artificial Life,
>since the evolving creatures are implicitly rewarded for survival and 
>reproduction (i.e., they must feed, defend themselves, and mate while others
>around them do the same) rather than being rewarded for an explicit externally
>imposed fitness function.  Different genotypes evolve, each with their own
>niche.  Most go extinct fairly rapidly, some flourish.  Very visual, this work
>will probably be published in the forthcoming Artificial Life III procedings
>and the software can be obtained from Larry Yaegar (I think).

I think it's also available via anonymous ftp at "ftp.apple.com" and maybe
at "ftp.cognet.ucla.edu" as well.

Cheers,
Rob




-- 
[--------------------------------------------------]
[  Robert S. Mah   |  "Every day an adventure,     ]
[  rmah@panix.com  |   every moment a challenge."  ]
[--------------------------------------------------]
From: will@aristotle.ils.nwu.edu (William Fitzgerald)
Subject: Re: CYC Project: References
Organization: The Institute for the Learning Sciences
X-Newsreader: Tin 1.1 PL5
Date: Fri, 8 Jan 1993 03:05:12 GMT

Dickson Lukose (D.Lukose@lut.ac.uk) wrote:
: Hi everyone,
: 
: I received the attached references from will@aristotle.ils.nwu.edu (William 
: Fitzgerald) of The Institute for the Learning Sciences. If you are aware 
: of any additional references, please mail them to me or to comp.ai, thus 
: enabling all to obtain it.
: 
: Many thanks to William Fitzgerald for the following references.
: 
: regards
: Dickson

And I'd like to say I got this list from: dahl@bcstec.boeing.com (Mark Dahl
Newsgroups: comp.ai
From: ahashim@spartan.ac.BrockU.CA (Ahmed M. Hashim)
Subject: Questionar Expert System
Organization: Brock University, St. Catharines Ontario
X-Newsreader: Tin 1.1 PL4
Date: Tue, 5 Jan 1993 00:55:25 GMT


Newsgroups: comp.ai,comp.compilers
From: nharvey@probitas.cs.utas.edu.au (Nicole Harvey)
Subject: Assessing a language
Reply-To: nharvey@probitas.cs.utas.edu.au (Nicole Harvey)
Organization: University of Tasmania, Australia.
Date: Wed, 6 Jan 1993 01:55:18 GMT
Keywords: design, question, comment

Hi,
   I am involved in assessing a language. Does anyone know of a standard
set of problems that I could use to judge the languages compabilities?
   Can anyone think of a problem that represents a real need in a
language?  For example, we have tested it for the eight queens problem to
show that it can do state space searches. We have also made sure it can
generate the Fibonacci numbers. Can you think of any other well known
problems?
   What things do you expect to be able to write relatively simply using
any language? I would like to here from people working in all areas. 

Nicole
nharvey@probitas.cs.utas.edu.au
[It has long been my belief that preferences in languages is an entirely
religious issue.  Computational capabilities aren't much of an issue since
they're all Turing equivalent.  How is it for parallel multi-lingual
object-oriented database update, to pick a few buzzwords? -John]
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.
Newsgroups: comp.ai
From: davenewman@cix.compulink.co.uk (David Newman)
Subject: Re: Looking for PC based expert systems.
Cc: davenewman@cix.compulink.co.uk
Reply-To: davenewman@cix.compulink.co.uk
Date: Tue, 5 Jan 1993 19:50:00 +0000

Todd Wallace)

twallace@gmuvax2.gmu.edu (Todd Wallace) said:
 I am working on a model of a generalized learning paradigm to be
 modelled in an object-oriented environment (C++).  Ideally, I
 would like to end up with a module that you "plug in" to a
 program
 
 I am approaching this problem from the point of view of
 biological system modelling

If a genetic algorithm approach (or a decision tree approach) will
do, there is a well-developed commercial product, XpertRule. You can
run it to derive a decision tree, and then output it as C, Pascal or
COBOL code. It runs under Windows.
--
Dr. David Newman, Information Management Dept., Queen's University Belfast
<d.r.newman@qub.ac.uk>
Newsgroups: comp.ai,comp.ai.edu
From: marc_b@Ingres.COM (Marc Burckin)
Subject: Re: Looking for PC based expert systems.
Keywords: learning, expert system
Reply-To: marc_b@Ingres.COM (Marc Burckin)
Organization: Ask Computer Systems Inc., Ingres Division, Alameda CA 94501
Distribution: inet
Date: 4 Jan 93 11:56:41 GMT

Hi,

Like the subject says I'm looking for a inexpensive(relatively) PC-based
expert system. If this info is in any FAQ I'd also be interested in 
looking at it.

Also if anyone knows of an articles comparing various products I'd like
to look at those.

Thanks,

Marc

--
marc_b@ingres.com
Ingres International
London, UK
Newsgroups: comp.ai
From: xkozima@phaeton.cs.uec.ac.jp (Kozima Hideki)
Subject: WANTED: machine readable dictionaries
Organization: The University of Electro-Communications, Tokyo, Japan.
Distribution: comp
Date: Tue, 12 Jan 1993 08:54:50 GMT

  Hello.

  I need information about
      Machine Readable Dictionaries,
  especially, of English.

  I'm working on building a large semantic network 
  from an English dictionary.

  Could anyone tell me
      1. title and publisher of the dictionary,
      2. media (MT, CD, etc),
      3. how can I get it,
  etc.?

  Any information is greatly appreciated.
  Thanks in advance.

       +-----------------------------------------------------------------+
      /                                                                 /
     /                                                 KOZIMA Hideki   /
    /                                  xkozima@phaeton.cs.uec.ac.jp   /
   /        Course in Computer Science and Information Mathematics   /
  /         Graduate School, University of Electro-Communications   /
 /                                                                 /
+-----------------------------------------------------------------+
From: crmeyer@voodoo.physics.ucsb.edu
Newsgroups: comp.ai
Subject: FOR SALE: A mistake
Date: 4 Jan 93 15:44:06 GMT
Organization: UCSB Physics Department

I am sorry for a FOR SALE ad that appeared on the comp.ai newsgroup.
When posting the ad to a different (more applicable) newgroup I pressed
return one too many times and it ended up in comp.ai. Sorry for the wasted
bandwidth.


Newsgroups: comp.ai
From: terjej@edb.tih.no (Terje Johansen,o90b)
Subject: Environment wanted
Reply-To: terjej@edb.tih.no
Posting-Front-End: Winix Conference v 92.05.15  1.20 (running under MS-Windows)
Date: Fri, 8 Jan 1993 12:04:05 GMT

Having a project for a major company, I am looking for a programming
environment to develop a ai-base. I find Intelligence Compiler quite
unsatisfactory as user friendliness regarded, and my current version of
Prolog is somewhat backward too.

So, I am looking for a system that presents the datas clearly and easily 
readable, has a friendly development climate, and a user friendliness so
good, it can be used, say, in Windows. Yet it should not be bigger than
what can find room in a standard portable PC.

Help and hints about companies and products available would be greatly
appreciated.


-- 
Terje Johansen at Trondheim College of Engineering, Norway.

War isn't fought to decide who is right
   but who is left.
Newsgroups: comp.ai
From: dggargan@unix1.tcd.ie (Dave Gargan)
Subject: Help-Please
Summary: Wierd and amazing AI facts
Organization: Trinity College, Dublin
Date: Fri, 8 Jan 1993 15:25:16 GMT


I'm doing a very brief project on the future of A.I. and I would really
appreciate it if anyone could give me some examples of experiments/projects
that have science fiction qualities..

Newsgroups: comp.ai,comp.ai.neural-nets,sci.cognitive,comp.theory.cell-automata,bionet.neuroscience,bionet.molbio.evolution,bionet.software
From: marcel@ADS.COM (Marcel Schoppers)
Subject: Re: planning with Petri nets
Organization: Advanced Decision Systems, Mtn. View, CA (415)960-7300
Distribution: na
Date: Fri, 8 Jan 1993 23:40:24 GMT

In article <1993Jan07.195703.305577@sue.cc.uregina.ca>
chenli@mercury.cs.uregina.ca (Lin Chen) writes:
>please tell me who is doing reseach about using Petri net to planning problem,
>such as planning with block world problem.

The fellows you are looking for are Dennis Bahler and Mark Drummond.  Here are
some of their papers:

BAHLER, D.  Net Based Plan Synthesis.  PhD Dissertation, Dept of Computer
	Science, University of Virginia, Charlottesville (1987).
BAHLER, D.  A net-based approach to the synthesis of nondeterministic robot
	plans.  Proc IEEE Conf on Automation & Robotics (1988), 1856f.
BAHLER, D.  Toward the automated synthesis of nondeterministic plans using
	generalized condition/event nets.  Proc 7th CSCSI Conf (1988), 221ff.
DRUMMOND, M.  Plan Nets: a Formal Representation of Action and Belief for
	Automatic Planning Systems. PhD, Dept of AI, U of Edinburgh (1986). 
DRUMMOND, M.  Refining and extending the procedural net. Proc 9th IJCAI (1985),
	1010ff.
DRUMMOND, M.  Situated control rules.  Proc 1st Internat'l Conf on Principles
	of Knowledge Representation and Reasoning (1989), 103-113.
DRUMMOND, M. AND BRESINA, J.  Anytime synthetic projection: maximizing the
	probability of goal satisfaction.  Proc AAAI Nat'l Conf (1990), 138-144.
DRUMMOND, M. AND BRESINA, J.  Planning for control.  Proc 5th IEEE Internat'l
	Symp on Intelligent Control (1990), 658-662.

The following might also be interesting:

FERRARINI, L.  An incremental approach to logic controller design with Petri
	Nets.  IEEE Trans SMC 22:3 (1992), 461-473.

Marcel

Newsgroups: comp.ai
From: pedersen@seas.smu.edu (Ted Pedersen)
Subject: inquiry - interactive novels
Organization: SMU - School of Engineering & Applied Science - Dallas
Date: Tue, 5 Jan 1993 01:09:56 GMT

This is a very general inquiry as I'm absolutely ignorant (but very
intrigued) by the idea of an interactive novel. The basic idea is that
as you read a story (on a computer) you can direct the action to some
extent. That's about all that I know.  

I have heard this idea mentioned in interviews on the TV or radio but no
one (that I have heard) has really elaborated much on the idea or if
this is really being pursued. In fact, I haven't seen any written
material or even a working example...

This seems like an area where AI might come into play. Can anyone
refer me to written publications that might fill me in on the general
state of this sort of work? If anyone happens to be working in this
area I would be interested in hearing about your project/s. 

I am a PhD student in Computer Science with an interest in AI so
hopefully (no guarantees however) I can handle reasonably technical
articles, etc. if they are available. 

Thanks,
Newsgroups: comp.ai
From: jctan@ntucsp (Jichang Tan)
Subject: Re: Looking for BBC blackboard
Organization: NTUTaiwan
X-Newsreader: Tin 1.1 PL3
Date: Tue, 12 Jan 1993 03:26:25 GMT


--
-------------------------------------------------------------------------------
  Jichang Tan
  Department of Computer Science and Information Engineering
  National Taiwan University
  10764 Taipei Taiwan
  jctan@csie.ntu.edu.tw

  Preferred postal address:
  No. 8  428 Lane, Chung-Jen Rd.
  Yung-Ho Taipei
  23433 Taiwan
-------------------------------------------------------------------------------
From: BPRASAD@cmsa.gmr.com
Newsgroups: comp.ai
Subject: CFP: Concurrent Engineering-A New Journal
Date: 11 Jan 93 19:15:50 GMT
Organization: GM Research Labs


Concurrent Engineering: Research & Applications is a new International,
multidisciplinary journal aiming to promote better understanding of
concurrency in enterprise modeling, information processing and computing.
The purpose of the journal is to provide an international forum for the
dissemination of scientific work on concurrent engineering based on computer
technologies.This is a refereed archival quality research & application J.

Papers are invited in all basic tracks that enable CE, including aspects of
information modeling, teaming & sharing, networking & distribution, planning
& scheduling, reasoning & negotiation, collaborative decision making,
organization & management of CE.

The journal is published by Academic press, London four times a year beginning
1993. Potential authors interested in submitting papers for possible
publication can obtain instructions through Email, fax or regular mail. Send
a reply Email with your interest to:  (bprasad@cmsa.gmr.com) or write to:
                         Dr. Biren Prasad
                         Managing Editor, Institute of Concurrent Engineering
                         CERA J. Department
                         P.O. Box 250254
                         West Bloomfield, MI 48325, USA
                         Fax: (313) 661-8333; Email:  bprasad@cmsa.gmr.com

Request for subscriptions and other information can be obtained from the
Managing Editor or the Publisher:
                         Academic Press Ltd.
                         24-28 Oval Road
                         London NW1 7DX, U.K.
                         Tel: 011 44 71 267 4466/ Fax: 011 44 71 482 2293
                         Email: ac2@uk.ac.rl.ib



Xref: sparky comp.ai:4777 comp.ai.neural-nets:4736 comp.ai.genetic:1
From: imfacks@prism.gatech.EDU (K.K. Srinivasan)
Newsgroups: comp.ai,comp.ai.neural-nets,comp.ai.genetic
Subject: AI and forecasting
Keywords: Pointers and References -- Request
Date: 7 Jan 93 16:53:50 GMT
Followup-To: comp.ai
Organization: Georgia Institute of Technology



Hi:
I am interested in the use of AI techniques (Knowledge Based Systems, 
Machine Learning and Neural Nets) for the purposes of forecasting. Can 
some one give me pointers / references in the above area? 
Thanks.
KK

(PS) I would post a summary of responses, if there is any interest in    
this topic.

-- 
Krishnakumar (KK) Srinivasan, School of Management. 
Georgia Institute of Technology, Atlanta Georgia, 30332-0520
uucp:	  ...!{decvax,hplabs,ncar,purdue,rutgers}!gatech!prism!imfacks
Internet: imfacks@prism.gatech.edu
From: L.Newnham@bradford.ac.uk (Leonard Newnham)
Newsgroups: comp.ai,comp.ai.neural-nets,sci.logic
Subject: Neural network controlled theorem proving
Date: 4 Jan 93 14:55:53 GMT
Organization: University of Bradford, UK
Originator: 90908502@muser

I am doing research into temporal logic theorem proving.  I am thinking
of using a neural network as a method of learning useful heuristics
to control the direction of the search.  The basic idea is that the
neural network learns to recognise patterns in the theorem to be
proved that enable the theorem prover to proceed in an efficient manner
towards a proof.

I am familiar with the 2 or 3 papers Ertel and Suttner have published 
in this area but have, so far, not been able to find any other research 
along similar lines.

I would be most grateful if anyone could point me in the direction of
any other research in this area.

Please email and I will post a summary.


-- 

Leonard               e-mail:  L.Newnham@bradford.ac.uk
Newsgroups: comp.ai
From: caseau@bellcore.com (Yves J Caseau)
Subject: Re: AI Tools
Organization: Bell Communications Research, Morristown, NJ
Date: Wed, 6 Jan 93 17:40:48 GMT

A while ago, I posted a request for a series of short programs that I could use
to benchmark inference engines. I received many answers from people that were 
also interested in collecting such a set of benchmarks, but very few programs.

After looking at what I had, and removing similar things (such as all the possible
versions of monkay & banana), I just have a set of four reasonably short programs
that are representative of what people commonly do with an inference engine.
It contains:
 
  title               what                           from
  monkey              A planner                        M. Porcheron
  queens              A naive exhaustive queens        R. Lissajoux
                      (Gauss problem) solver
  triplet             Deducing values of logical       M. Wallace
                      variables bound by OR triplets
  filter              Data filtering                   J. Britt

If you are interested, I can send you the files through e-mail, together with
some preliminary performance results. If many persons are interested, I will 
make it available through ftp.

I am aware that this benchmark set is crude, but it is small enough that porting
a test case to any inference engine should be little work, which was the original
goal. Also, looking at it carefully shows that it represents a good blend of 
various aspects of rule processing.

Any (constructive) criticism (or even better, any addition) is (warmly) welcomed.

-- Yves Caseau
   caseau@bellcore.com
Newsgroups: comp.ai
From: twallace@gmuvax2.gmu.edu (Todd Wallace)
Subject: FESA, Fully Employed Students Association
Keywords: adult, employed
Organization: George Mason University, Fairfax, Va.
Distribution: na
Date: Tue, 5 Jan 1993 17:41:10 GMT

I am a grad student in the computer science program at George
Mason University in Fairfax, Virginia, a suburb of Washington
DC.  I also work full time as a Systems Administrator at a
consulting firm in DC.  Until recently, George Mason had a good
reputation among fully-employed students because it offered most
of its graduate classes at night.  However, this spring
semester, all computer science graduate classes have been
scheduled at 4:30pm, making it very difficult if not impossible,
for fully-employed students like me.

Several fellow students and I are attempting to make our
university more sensitive to the needs of the fully-employed
student, particularly in these times of extreme competition in the
workplace when so many people are going back for advanced
degrees while they are employed.

It would help our case a great deal if we could collect examples
from around the world about how other universities have
structured programs to make them more accessible to students who
have to schedule their school around their work.  I am looking
for any sort of example that would strengthen my case that my
university needs to sit up and take fully-employed students
seriously.

It seems especially ironic to me that now that I have the money
and the motivation for advanced education, that I would be
denied my dream of a master's degree and beyond simply because
of insensitive scheduling.

Thanks in advance for any help you can provide.
Todd Wallace
twallace@gmuvax2.gmu.edu
Newsgroups: comp.ai
From: khattri@cs.cornell.edu (Harsha Khattri)
Subject: Call for papers
Organization: Cornell Univ. CS Dept, Ithaca NY 14853
Date: Thu, 7 Jan 1993 21:36:52 GMT

                              CALL FOR PAPERS

    	INSA Convention on Pattern Recognition, Artificial Intelligence, 
			and Neural Networks
                     March 12th 1993, Dehradun, India

	

	The Roorkee Chapter of the Indian National Science Academy (INSA) will hold 
its annual convention on friday, March 12th 1993 at the KDM Institute of 
Petroleum Exploration, Dehradun, India. The theme of the convention is recent
advances in pattern recognition, artificial intelligence, and neural networks.
The objective of the convention is to disseminate emerging knowledge on 
pattern recognition, artificial intelligence, and neural networks.

	Review papers, research papers on the above topics and their applicat-
ions to physical, biological, earth, forensic, & defense sciences are invited
for presentation at the convention.

	Extended abstract (250-500 words) plus figures should reach Organizing
Secretary by February 11th, 1993. No registration fee is required. The 
organizers regret inability to provide travel or delay allowances. Accomodation
would be arranged in Government Guest Houses upon request.

	Researchers are encouraged to submit papers. They need not be presented
at the convention. Much of the research in these fields is being conducted 
ouside India. This convention will increase contact between researchers in 
India and rest of the world. 

Convenor:

Dr. Kailash N. Khattri, FNA
100 Rajendra Nagar
Dehradun, UP 248001  India

Co-convenors:

A. G. Pramanik
Geosciences Division,
Triple Shed, Tel Bhavan,
Dehradun, UP 248003 India

N. C. Nanda
Geodata Processing & Interpretation Center,
Dehradun, UP 248003 India

Dr. P. K. Roy
Geodata Processing & Interpretation Center,
Dehradun, UP 248003 India

Technical Committee:
Dr. V. V. Rampal
Defense Electronics Appl. Laboratory
Dehradun, UP 248003 India

Dr. P. S. Moharir
National Geophysical Research Institute
Hyderabad, AP 500007 India

Dr. S. K. Bhan
Regional Remote Sensing Services Center,
Dehradun, UP 248003 India

Dr. D. K. Mehra
University of Roorkee
Roorkee, UP 247667 India

P. K. Mittal
Geodata Processing & Interpretation Center
Dehradun, UP 248003 India

ORGANIZING SECRETARY:
Dr. V. Ramaswamy
KDM Institute of Petroleum Exploration,
9 Kaulagarh Rd.,
Dehradun, UP 248195 India

Tel: 91-135-27101-05 Ext: 5992
Telex: 0585-273 MIPEIN 
Gram: UNONG
FAX: 91-135-25265

Patrons:
S. K. Biswas
Director
KDM Institute of Petroleum Exploration,
Dehradun, UP 248195 India


V. P. Sandlas
Director
Defence Electronics Appl. Lab
Raipur Rd.
Dehradun, UP 248001 India
Newsgroups: comp.ai,comp.ai.neural-nets,sci.cognitive