From: mkant+@cs.cmu.edu (Mark Kantrowitz)
Subject: FAQ: Artificial Intelligence Questions & Answers 1/2 [Monthly posting]
Followup-To: poster
Summary: Frequently asked questions about AI
Reply-To: mkant+ai-faq@cs.cmu.edu
Organization: School of Computer Science, Carnegie Mellon University
Date: Tue, 13 Oct 1992 07:00:49 GMT
Expires: Thu, 26 Nov 1992 07:00:16 GMT

Archive-name: ai-faq/part1
Last-Modified: Mon Sep 14 12:50:25 1992 by Mark Kantrowitz
Version: 1.2

;;; ****************************************************************
;;; Answers to Questions about Artificial Intelligence *************
;;; ****************************************************************
;;; Written by Mark Kantrowitz
;;; ai-faq-1.text -- 61301 bytes

If you think of questions that are appropriate for this FAQ, or would
like to improve an answer, please send email to mkant+ai-faq@cs.cmu.edu.

Topics Covered:

Part 1:
  [0]  What is the purpose of this newsgroup?
  [1]  AI-related Associations
  [2]  AI-related Newsgroups and Mailing Lists 
  [3]  Dial-up AI-related bulletin board systems
  [4]  FTP and Other Resources
  [5]  AI Technical Reports available by FTP
  [6]  What are the rules for the game of "Life"?
  [7]  What AI competitions exist?
  [8]  Where can I get a machine readable dictionary, thesaurus, and
       other text corpora?
  [9]  List Smalltalk implementations.
  [10] Prolog Information
  [11] Commercial AI products.
  [12] Glossary of AI terms.

Part 2 (Bibliography):
  Bibliography of introductory texts, overviews and references

Search for [#] to get to question number # quickly.


Introduction:

Certain questions and topics come up frequently in the various network
discussion groups devoted to and related to Artificial Intelligence
(AI).  This file/article is an attempt to gather these questions and
their answers into a convenient reference for AI researchers. It is
posted on a monthly basis. The hope is that this will cut down on the
user time and network bandwidth used to post, read and respond to the
same questions over and over, as well as providing education by
answering questions some readers may not even have thought to ask.

The latest version of this file is available via anonymous FTP from CMU:

   To obtain the file from CMU, connect by anonymous ftp to any CMU CS
   machine (e.g., ftp.cs.cmu.edu [128.2.206.173]), using username
   "anonymous" and password "name@host". The files ai-faq-1.text
   and ai-faq-2.text are located in the directory
       /afs/cs.cmu.edu/user/mkant/Public/AI/
   [Note: You must cd to this directory in one atomic operation, as
   some of the superior directories on the path are protected from
   access by anonymous ftp.] If your site runs the Andrew File System,
   you can just cp the file directly without bothering with FTP.

Acknowledgments:

   Thanks to the following people for contributing to this FAQ:
	Matthew L. Ginsberg <ginsberg@CS.Stanford.EDU>
	Ashwin Ram <ashwin@cc.gatech.edu>
	Dana Nau <nau@cs.umd.edu>
	Daniel Cohen <dc@dcs.qmw.ac.uk>
	David Traum <traum@cs.rochester.edu>
	John Josephson <jj@cis.ohio-state.edu>
	Jon Sticklen <sticklen@cps.msu.edu>
	Karin van Dam <vandamk@prl.philips.co.uk>
	Kathleen King <kk@aisb.ac.ed.uk>
	Kevin Thompson <kthompso@ptolemy.arc.nasa.gov>
	Matteo Vaccari <vaccari@ghost.dsi.unimi.it>
	Nick Lewins <nick@cs.uwa.edu.au>
	Russell G. Almond <almond@stat.washington.edu>
	Thomas Weigert <weigert@etl.go.jp>

----------------------------------------------------------------
Subject: [0] What is the purpose of this newsgroup?

The newsgroup comp.ai exists for general discussion of topics related
to Artificial Intelligence. For example, possible topics can
include (but are not necessarily limited to):
   announcements of AI books and products
   discussion of AI programs and tools
   questions about AI techniques
   problems implementing an AI technique
Postings should be of general interest to the AI community. See also
question [2].

We've tried to minimize the overlap with the FAQ postings to the
comp.lang.lisp and comp.ai.neural-nets newsgroups, so if you don't find
what you're looking for here, we suggest you try the FAQs for those
newsgroups. Both FAQs should be available by anonymous ftp from
rtfm.mit.edu (18.172.1.27) in subdirectories of /pub/usenet/ or by
sending a mail message to mail-server@rtfm.mit.edu with subject "help".
The Lisp FAQ is also available by anonymous ftp from the same
ftp location as the AI FAQ or from ftp.think.com:/public/think/lisp/.

----------------------------------------------------------------
Subject: [1]  AI-related Associations and Journals

Associations:

   AMERICAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (AAAI)
   AAAI, 445 Burgess Drive, Menlo Park, CA 94025.
   415-328-3123, info@aaai.org
   Membership includes AI Magazine:
   $40 regular, $20 student (US/Canadian)
   $65 regular, $45 student (Foreign)
   AAAI has several special interest groups (SIGs), including one
   on manufacturing and one on medicine.

   ASSOCIATION FOR COMPUTING MACHINERY (ACM)
   ACM, 1515 Broadway, New York, NY 10036.
   Member Services, 11 West 42nd Street, New York, NY 10036.
   212-869-7440. Fax 212-944-1318. Email: acmhelp@acmvm.bitnet.
   $75 regular, $22 student (includes Communications of the ACM)
   $15 ($8 students) extra for SIGART membership (gets Sigart Bulletin)
   $12 ($7 students) extra for Lisp Pointers.
   $15 ($10 students) extra for Computing Surveys
   $34 ($29 students) extra for Computing Reviews

   INTERNATIONAL ASSOCIATION OF KNOWLEDGE ENGINEERS (IAKE)
   IAKE, 11820 Parklawn Drive, Suite 302, Rockville, MD 20852.
   301-231-7826
   $65 regular, $30 students.

   ASSOCIATION FOR COMPUTATIONAL LINGUISTICS
   c/o Dr. Donald E. Walker
   Bellcore, MRE 2A379
   445 South Street, Box 1910
   Morristown, NJ 07960-1910
   201-829-4312
   walker@flash.bellcore.com
   $25 regular, $15 student (includes Computational Linguistics)
   Add $10 for first class mail to US, Canada, or Mexico, and $20 elsewhere.

   INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS (IEEE)
   IEEE Service Center, 445 Hoes Lane, PO Box 1331, Piscataway, NJ 08855.
   1-800-678-IEEE
   IEEE membership is $95 regular ($23 students)
   For membership in the IEEE Computer Society, add $22.
   $20 for IEEE Expert (Intelligent Systems and their Applications)
   $12 for Transactions on Neural Networks
   $12 for Transactions on Systems, Man and Cybernetics
   $15 for Transactions on Robotics and Automation
   $19 for Transactions on Knowledge and Data Engineering
   $24 for Transactions on Pattern Analysis and Machine Intelligence


Journals:

   JOURNAL OF COMPUTATIONAL INTELLIGENCE
   Basil Blackwell Publishers, Journal Subscription Department, 
   3 Cambridge Centre, Cambridge, MA 02142.
   Individual subscriptions are $85 in North America and $100 in the rest of
   the world. Institutional subscriptions are $175 and $190, respectively. 

   ARTIFICIAL INTELLIGENCE REVIEW (Survey and Tutorial Journal)
   Kluwer Academic Publishers,
   101 Philip Drive, Norwell, MA 02061, 617-871-6600, fax 617-871-6528.
   PO Box 358, Accord Station, Hingham, MA 02018-0358. 
   Email: kluwer@world.std.com
   The institutional subscription rate is $130 per volume (4 issues).

   ARTIFICIAL INTELLIGENCE
   $80 individuals (must be a member of one of the major AI societies). 
   To order in the US, write to AAAI, AI Journal, 445 Burgess Drive, Menlo
   Park, CA 94025-3496, or to Elsevier Science Publishing, 655 Avenue of
   the Americas, New York, NY 10017, 212-633-3827. Outside the US,
   contact Elsevier Science Publishers, Attn: Ursula van Dijk, PO Box 103,
   1000 AC Amsterdam, The Netherlands, or call +31-20-5862-608.

   COGNITIVE SCIENCE
   Ablex Publishing Company,
   355 Chestnut Street, Norwood, NJ 07648
   201-767-8450, fax 201-767-6717
   $50 individual, $125 institution.

   APPLIED ARTIFICIAL INTELLIGENCE
   Hemisphere Publishing Corp., 1900 Frost Rd., Suite 101, Bristol, PA 19007
   215-785-5800, fax 215-785-5515
   (in the UK, write to Taylor & Francis Ltd., Rankine Rd., Baskingstoke,
   Hampshire RG24 0PR, UK, call +44-256-840366, or fax +44-256-479438)

----------------------------------------------------------------
Subject: [2]  AI-related Newsgroups and Mailing Lists 

To be added or deleted to any of the following lists, send mail to the
-request version of the list except where otherwise noted. This sends
mail to the list maintainer, instead of annoying the membership of the
entire mailing list. To subscribe to one of the BITNET listserv
forums, send mail there which contains a line of the form
	SUB <forum-name> <your-full-name>
as the first and only line in the body of the message.

For Lisp-related mailing lists, see part 4 of the FAQ for the
newsgroup comp.lang.lisp.


AI-Related Newsgroups:

   Subscribe to these using your newsreader.

   comp.ai			Artificial Intelligence
   comp.ai.edu			AI and Education
   comp.ai.neural-nets		Neural Nets
   comp.ai.nlang-know-rep	Natural Language and Knowledge Representation
   comp.theory.cell-automata	Cellular Automata
   comp.simulation		Simulation
   comp.speech		        Speech related research, including recognition
				and synthesis. Archived at the anonymous ftp
				site svr-ftp.eng.cam.ac.uk in the directory
				comp.speech/archive.
   sci.math.symbolic		Symbolic Math
   comp.ai.philosophy		Philosophical Foundations of AI
   comp.ai.shells		Expert System Shells
   comp.ai.vision		Vision Research

   comp.lang.lisp		Common Lisp
   comp.lang.clos		Common Lisp Object System
   comp.lang.scheme		Scheme
   comp.lang.lisp.mcl		Macintosh Common Lisp
   comp.lang.lisp.franz		Franz Lisp
   comp.lang.lisp.x		XLisp
   comp.lang.prolog             Prolog and Logic Programming
   comp.lang.smalltalk          Smalltalk

   aicom mcvax!swivax!otten@uunet.uu.net	International Usenet AI news


AI Research in a particular country:

   British AI			alvey jws%ib.rl.ac.uk@nsfnet-relay.ac.uk
   Japanese AI			fj-ai%etl.jp@relay.cs.net
   German AI			mod-ki%unido.irb@unido.bitnet
   Mexican AI			IAMEX-L on listserv@tecmtyvm.mty.itesm.mx

   The IAMEX-L list is administrated by the AI Invetigation Center in
   Instituto Tecnologico y de Estudios Superiores de Monterrey (ITESM)
   in Monterrey, N.L. To be added to that list, please contact:
        pl500368@tecmtyvm.bitnet (Juana Maria Gomez Puertos)
        pl157961@tecmtyvm.bitnet (Fernando Careaga Sanchez)

   The newsgroup de.sci.ki.discussion is the German equivalent of comp.ai.
   The newsgroup de.sci.ki.announce is for announcements about AI. The
   newsgroup de.sci.ki.mod-ki is moderated by Hans-Werner Hein
   <hein@damon.irf.uni-dortmund.de>.

   The newsgroup aus.ai is the (unmoderated) Australian equivalent of comp.ai.


Artificial Life:
   alife@cognet.ucla.edu

   The alife mailing list is for communications regarding artificial
   life, a formative interdisciplinary field involving computer science,
   the natural sciences, mathematics, medicine and others.  Send mail to
   alife-request@cognet.ucla.edu to be added to the list.


AI applications to Human-Computer interface design:
   AI-CHI <wiley!ai-chi@lll-lcc.llnl.gov>		

   All requests to be added to or deleted from this list, problems, questions,
   etc., should be sent to wiley!ai-chi-request@LLL-LCC.LLNL.GOV.


AI in Education: 
   ai-ed@sun.com (was ai-ed@sumex-aim.stanford.edu)

   Includes ICAI (intelligent computer aided instruction) and 
   ITS (intelligent tutoring systems).

   All requests to be added to or deleted from this list, problems, questions,
   etc., should be sent to ai-ed-request@sun.com.


Artificial Intelligence and Law:
   ail-l@austin.onu.edu

   To subscribe to AIL-L you should send a message to the internet address
        listserv@austin.onu.edu
   The body of the message should consist of:
        subscribe AIL-L <your full name>


AI in Medicine: 
   ai-medicine@med.stanford.edu

   Focus is on computer-based medical decision support.

   All requests to be added to or deleted from this list, problems, questions,
   etc., should be sent to ai-medicine-request@med.stanford.edu


AI for Development:
   An occasional newsletter for folk interested in AI applications in
   and for developing countries. The newsletter is sent to the mailing
   list and to the newsgroup comp.society.development.

   Send requests to be added to the mailing list to Kathleen King
   <kk@aisb.ed.ac.uk>.


Cellular Automata:
   cellular-automata@think.com  (aka ca@think.com)

   Gatewayed to the newsgroup comp.theory.cell-automata.

   Archived messages may be found at ftp.think.com in the files:
      mail/ca.archive*

   All other requests to be added to or deleted from this list, problems,
   questions, etc., should be sent to cellular-automata-request@think.com.


Classification and clustering:
   class-l%sbccvm.bitnet@cunyvm.cuny.edu

   To subscribe to CLASS-L you should send a message to the internet address
        listserv%sbccvm.bitnet@cunyvm.cuny.edu
   The body of the message should consist of:
        subscribe CLASS-L <your full name>
   To have your name removed from the CLASS-L subscriber list, send:
        signoff CLASS-L


Connectionism and Neural Networks:

   Connectionism:
      connectionists@cs.cmu.edu

      All requests to be added to or deleted from this list, problems,
      questions, etc., should be sent to connectionists-request@cs.cmu.edu.

   Neural Networks (moderated):
      Neuron@cattell.psych.upenn.edu

      Neuron-Digest is a moderated list (in digest form) dealing with all
      aspects of neural networks (and any type of network or neuromorphic
      system).  Topics include both connectionist models (artificial neural
      networks) and biological systems ("wetware"). The digest is posted to
      comp.ai.neural-nets.

      All requests to be added to or deleted from this list, problems,
      questions, etc., should be sent to neuron-request@cattell.psych.upenn.edu

      Neuron Digest archives are kept in the OSU Neuroprose collection
      and in cattell.psych.upenn.edu:/pub/Neuron-Digest

   Users of the Rochester Connectionist Simulator:
      simulator-users@cs.rochester.edu
      simulator-bugs@cs.rochester.edu

      All requests to be added to or deleted from this list, problems,
      questions, etc., should be sent to simulator-request@cs.rochester.edu.

      The simulator is available in cs.rochester.edu:/pub/simulator


Intelligent systems for Economics digest (IE-digest):
   IE-list@cs.ucl.ac.uk

   The IE-digest aims to act as a forum to exchange ideas on using
   `intelligent' techniques to model economic and financial systems.
   Calls for papers, paper announcements and queries are welcome.

   Techniques which were originally developed to model psychological and
   biological processes are now receiving considerable attention as tools
   for modelling and understanding economic and financial processes.
   These techniques, which include neural networks, genetic algorithms
   and expert systems are now being used in a wide variety of
   applications including the modelling of economic cycles, modelling of
   artificial economies, portfolio optimisation and credit evaluation.

   To be added to the list, send mail to IE-list-request@cs.ucl.ac.uk. An
   archive of back issues of the digest, as well as papers,
   bibliographies and software, may be obtained by anonymous ftp from
   cs.ucl.ac.uk:ie (128.16.5.31).

   List moderated by Suran Goonatilake, Dept. of Computer Science,
   University College London, Gower St., London WC1E 6BT, UK,
   <surang@cs.ucl.ac.uk>. 


Expert Systems in Agriculture:
   ag-exp-l%ndsuvm1.bitnet@cunyvm.cuny.edu		

   To subscribe to ag-exp-l you should send a message to the internet address
        listserv%ndsuvm1.bitnet@cunyvm.cuny.edu		
   The body of the message should consist of:
        subscribe AG-EXP-L <your full name>


Use of computers in the Fine Arts:
   fineart%ecs.umass.edu@relay.cs.net

   The FINEART Forum is dedicated to International collaboration between
   artists and scientists.  It is subsidized by the International Society for
   the Arts, Science, and Technology (ISAST), 2020 Milvia, Berkeley, CA 94704.

   The purpose of this bulletin board is to disseminate information regarding
   the use of computers in the Fine Arts. One of the general areas of
   interest is Art & AI.


Genetic Algorithms:

    GA-List@AIC.NRL.NAVY.MIL (moderated)

    Send subscription requests to the -request form of the list 
    or to gref@aic.nrl.navy.mil.

    Past copies of the digest are archieved on ftp.aic.nrl.navy.mil 
    in the /pub/galist directory. Some software is also archived there.

    
    Discussion of GAs also appears from time to time in
    comp.ai.neural-nets and comp.theory.self-org-sys. 


Logic Programming, Prolog:

   Prolog and Logic Programming:
      prolog@sushi.stanford.edu (general)
      prolog-hackers@sushi.stanford.edu (nitty gritty)

      All requests to be added to or deleted from this list, problems,
      questions, etc., should be sent to prolog-request@sushi.stanford.edu

   Concurrent Logic Programming:
      clp.x@xerox.com

      All requests to be added to or deleted from this list, problems,
      questions, etc., should be sent to clp-request.x@xerox.com or to
      Jacob Levy <jlevy.pa@xerox.com>.


Machine Learning:

   ml@ics.uci.edu

   The Machine Learning List is moderated.  Contributions should be
   relevant to the scientific study of machine learning. Mail requests
   to be added or deleted to ml-request@ics.uci.edu.  

   Back issues may be FTP'd from ics.uci.edu in pub/ml-list/V<X>/<N> or
   N.Z where X and N are the volume and number of the issue; ID:
   anonymous PASSWORD: <your mail address>


Natural Language Processing:

   Information Retrieval:
      irlist <ir-l%uccvma.bitnet@vm1.nodak.edu>

      To subscribe send the following command to LISTSERV@UCCVMA.BITNET:
	 SUB IR-L your_full_name
      where "your_full_name" is your real name, not your login Id.
      Non-BitNet users can join by sending the above command as the only
      line in the text/body of a message to
      LISTSERV%UCCVMA.BITNET@VM1.NODAK.EDU. 

      Moderator: IRLUR%UCCMVSA.BITNET@VM1.NODAK.EDU

   Natural Language and Knowledge Representation (moderated):
      nl-kr@cs.rpi.edu (formerly nl-kr@cs.rochester.edu)
      Gatewayed to the newsgroup comp.ai.nlang-know-rep.

      BITNET subscribers: we now have a LISTSERVer for nl-kr.
	You may send submissions to NL-KR@RPIECS
	and any listserv-style administrative requests to LISTSERV@RPIECS.

      Back issues are available from host archive.cs.rpi.edu [128.213.10.18]
      in the files nl-kr/Vxx/Nyy (ie nl-kr/V01/N01 for V1#1), mail requests
      will not be promptly satisfied.  If you can't reach `cs.rpi.edu' you
      may want to use `turing.cs.rpi.edu' instead.

      All requests to be added to or deleted from this list, problems,
      questions, etc., should be sent to nl-kr-request@cs.rpi.edu.

   Natural Language Generation:
      siggen@cs.rpi.edu

   Speech Interfaces:

      Electronic Communal Temporal Lobe (or ECTL) is a moderated mailing list
      for speech interface enthusiats. To subscribe, send a message with your
      name, institution, department, daytime phone and an email address to
      ectl-request@snowhite.cis.uoguelph.ca. If you have trouble with this mail
      address, call David Leip at (519) 824-4120 ext.3709. 

      ECTL has an anonymous ftp archive which is located at
      snowhite.cis.uoguelph.ca [131.104.48.1] in /pub/ectl. Included in the
      archive are: all issues of ECTL, as well as a list of subscribers, lists
      of speech related products (s/w & h/w),and a list of speech related
      technical report abstracts. If you would like to contribute to the
      archive, please mail: ectl-sub@snowhite.cis.uoguelph.ca If you need
      information about how to ftp, or such things, please send mail to:
      ectl-request@snoehite.cis.uoguelph.ca


   Prosody:

      To subscribe, send a one-line message to listserv@purccvm.bitnet
      in the following format:

         subscribe prosody <Your Full Name>


   Translation and Interpretation of Natural Language:
      lantra-l%finhutc.bitnet@cunyvm.cuny.edu

      To add or remove yourself from the list, send a message to
      listserv%finhutc.bitnet@cunyvm.cuny.edu.  The sender of the message
      you send must be the name (E-mail address) you want to add or remove
      from the list.  The text body of the message should be:
	 SUBSCRIBE LANTRA-L your_full_name
      or:
	 SIGNOFF LANTRA-L
      where your_full_name is your normal name, not your E-mail address.

    Text Analysis and Natural Language Applications:
      SCHOLAR%CUNYVM.BITNET@uga.cc.uga.edu

      SCHOLAR is an online information service covering all aspects of
      natural language processing in such fields as literary studies,
      linguistics, history and lexicography. It consists of information like
      book reviews, project reports database listings, a conference
      calendar, and news of hardware and software relevant to the field.
      SCHOLAR is distributed occasionally as the quantity of information
      received allows. Contributions should be sent to Joseph Raben
      <jqrqc@cunyvm.cuny.edu>.

      To add or remove yourself from the list, send a message to
      listserv@cunyvm.cuny.edu.  The sender of the message
      you send must be the name (E-mail address) you want to add or remove
      from the list.  The text body of the message should be:
	 SUBSCRIBE SCHOLAR your_full_name
      or:
	 SIGNOFF SCHOLAR
      where your_full_name is your normal name, not your E-mail address.
      For technical assistance, send mail to <lnaqc@cunyvm.cuny.edu>.

      SCHOLAR files are available by anonymous ftp from jhuvm.hcf.jhu.edu
      (128.220.2.2). Use username scholar and type your login userid as a
      password. The index of SCHOLAR files is index.scholar. The files are
      also available by listserv.  For an explanation of the coding system
      for items in SCHOLAR, send mail to <listserv@cunyvm.cuny.edu> with the
      following as the body of the message: 
	      Get SCHOLAR COD 
      To retrieve the entire release send mail to <listserv@cunyvm.cuny.edu>
      with the folowing as the body of the message: 
	      Get AZ Package


Neural Networks:
   See Connectionism.


Simulated Annealing:
   Contact: anneal-request@cs.ucla.edu (Daniel R. Greening)

   This mailing list is for discussion of simulated annealing techniques,
   analysis, and related issues such as stochastic optimization,
   Boltzmann machines, and metricity of NP-complete move spaces.

   Membership in this list is restricted to those doing active research
   in simulated annealing or related areas. The list itself is
   unmoderated.


Simulation:
   simulation@ufl.edu
   Gatewayed to the newsgroup comp.simulation.

   All requests to be added to or deleted from this list, problems, questions,
   etc., should be sent to simulation-request@ufl.edu.


Symbolic Math:
   Symbolic Math <leff%smu.uucp@UUNET.UU.NET>
   Gatewayed to the newsgroup sci.math.symbolic.

   Mailing list covering symbolic math algorithms, applications and problems
   relating to the various symbolic math languages.

   Mail to be forwarded to the list should be sent to
   leff%smu.uucp@uunet.uu.net (ARPANET/MilNet) or sci.math.symbolic (USENET).
   Requests to be included on the list should be sent to
   leff%smu.uucp@uunet.uu.net.


AI Vision Research:

   vision-list@ads.com
   All requests to be added to or deleted from this list, problems, questions,
   etc., should be sent to vision-list-request@ads.com.

   cvnet%yorkvm1.bitnet@cunyvm.cuny.edu		
   Color and vision research.

----------------------------------------------------------------
Subject: [3]  Dial-up AI-related bulletin board systems

The primary AI-related dial-up bulletin board systems are:

   The Interocitor  214-258-1832 (Fido 1:124/2206) V.32bis (14.4kbps)
	   SysOp: Steve Rainwater  Hours: 24
	   Desc: AI CD-ROM submission site, general AI archive.

   ShadeTree BBS    412-244-9416 (Fido 1:129/124)  V.22bis (2400bps)
	   SysOp: Bill Keller      Hours: 8:30pm-8:30am only
	   Desc: Oriented toward beginners in the field.

   C.N.S. BBS       509-62706267 (Fido 1:347/303)  USR HST (9600bps)
	   SysOp: Wesley Elsberry  Hours: 24
	   Desc: Best source for neural network related information.

Fuzzy Logic Related BBS's:

   Aptronix FuzzyNet 408-428-1883  N/8/1  1200-19,200 baud

   The Turning Point 512-219-7828  N/8/1 DS/HST 1200-19,200 baud (LIBRARY)
                     512-219-7848  N/8/1 DS/HST 1200-19,200 buad

   Motorola FREEBBS  512-891-3733  E/7/1  1200-9600   baud

----------------------------------------------------------------
Subject: [4] FTP and Other Resources

In general, see the Lisp FAQ for Lisp-related software. If a
Lisp-based system is listed here, only the ftp site and directory will
be listed; for a more detailed description, see the Lisp FAQ. For
information on obtaining the Lisp FAQ, see [0].

   Ada Repository:

      The Ada Repository on wsmr-simtel20.army.mil (mailing list
      ada-sw@wsmr-simtel20.army.mil) contains a directory of AI programs in
      PD2:<ADA.AI>*.*. A somewhat easier to access copy of the archives is
      available as wuarchive.wustl.edu:/mirrors/ada/ai.

   Automated Reasoning:

      Several automated reasoning programs are available by anonymous ftp:

	Otter       -- info.mcs.anl.gov:pub/Otter/Otter-2.2/otter22.tar.Z

  	Isabelle    -- princeton.edu:pub/ml/isabelle  [128.112.128.1]
		       research.att.com:dist/ml/isabelle [192.20.225.2]
 
   Blackboard Architectures:

        GBB (PD Version) -- dime.cs.umass.edu:/gbb
			
   Case-based Reasoning:

        CL-Protos   -- cs.utexas.edu:/pub/porter
                       Contact: Dan Dvorak <dvorak@cs.utexas.edu>
		                Ray Bareiss <bareiss@ils.nwu.edu>
	                        Erik Eilerts <eilerts@cs.utexas.edu>
                                Bruce W. Porter <porter@cs.utexas.edu>

        MICRO-xxx  -- Contact: waander@cs.umd.edu

   Chess:

      The SAN Kit chess programming C source toolkit provides common routines
      for move notation I/O, move generation, move execution, etc. Only search
      routines and an evaluation function need be added to obtain a working
      chess program. It is available by anonymous ftp from
      valkyries.andrew.cmu.edu [128.2.232.4] in the directory pub/chess/misc
      as the compressed tar file san.tar.Z. Contact Steven J. Edwards,
      sje@xylos.ma30.bull.com for more information.

   Expert Systems:

      FOCL   -- ics.uci.edu:pub/SaranWrap/{README,KR-FOCL-ES.cpt.hqx}
                Contact: pazzani@ics.uci.edu
                Expert System Shell and Machine Learning Program;
	        Extends Quinlan's FOIL.

      OPS5   -- ftp.cs.cmu.edu:/afs/cs/user/mkant/Public/Lisp/ops5.tar.Z

      BABYLON-- gmdzi.gmd.de:gmd/ai-research/Software/ (129.26.8.90)
                (BinHexed stuffit archive of Babylon)
		Development environment for expert systems.

   Frame Systems:

        FrameWork   -- ftp.cs.cmu.edu:
		       /afs/cs.cmu.edu/user/mkant/Public/Lisp/framework.lisp

        Theo        -- Contact: Tom.Mitchell@cs.cmu.edu

        FrameKit    -- Contact: Eric.Nyberg@cs.cmu.edu

        KR          -- Contact: Brad.Myers@cs.cmu.edu

        PARKA       -- Contact: spector@cs.umd.edu
		       Frames for the CM

        PARMENIDES (Frulekit) -- Contact: Peter.Shell@cs.cmu.edu 

        FROBS       -- cs.utah.edu:/pub/frobs.tar.Z
                       Contact: Robert Kessler <kessler@cs.utah.edu>

        PFC         -- linc.cis.upenn.edu:

        YAK         -- Contact: Enrico Franconi <franconi@irst.it>

   Funic Neural FTP Archive Site:
      The Finnish University maintains an archive site containing a
      large collection of neural network papers and public domain
      software gathered from FTP sites in the US. The files are available
      by annonymous ftp from funic.funet.fi:/pub/sci/neural. For
      further information, contact magi@funic.funet.fi (or magi@utu.fi).

   Fuzzy Logic:

      FLIE    -- ural.ethz.ch:/robo/flie
		 Contact: vestli@ifr.ethz.ch
                 Fuzzy Logic Inference Engine, Institute of Robotics, ETH.

   Knowledge Representation:

      KNOWBEL -- ai.toronto.edu:/pub/kr/{knowbel.tar.Z,manual.txt.tar.Z}
                 Contact: Bryan M. Kramer, <kramer@ai.toronto.edu>
                 Telos temporal/sorted logic system.

      SB-ONE  -- Contact: kobsa@cs.uni-sb.de
		 KL-ONE family
      KRIS    -- Contact: baader@dfki.uni-kl.de
		 KL-ONE family (Symbolics only)
      BACK    -- Contact: peltason@tubvm.cs.tu-berlin.de
		 KL-ONE family
      CLASSIC -- Contact: dlm@research.att.com
		 KL-ONE family
      MOTEL   -- Contact: hustadt@mpi-sb.mpg.de
                 Modal KL-ONE (contains KRIS as a kernel). 
		 Implemented in Prolog.

      FOL GETFOL -- Contact: fausto@irst.it
		 Weyrauch's FOL system

      SNePS   -- Contact: shapiro@cs.buffalo.edu 
                 Semantic Nets

      COLAB/RELFUN  -- Contact: boley@informatik.uni-kl.de
                       Logic Programming
      COLAB/FORWARD -- Contact: hinkelma@dfki.uni-kl.de
		       Logic Programming
      COLAB/CONTAX  -- Contact: meyer@dfki.uni-kl.de
		       Constraint System for Weighted Constraints over
		       Hierarchically Structured Finite Domains.
      COLAB/TAXON   -- Contact: hanschke@dfki.uni-kl.de
                       Terminological Knowl. Rep. w/Concrete Domains

   ICOT:

      Japan's Institute for New Generation Computer Technology (ICOT) has
      made their software available to the public free of charge.  The
      collection includes a variety of prolog-based programs in symbol
      processing, knowledge representation, reasoning and problem solving,
      natural language processing. All programs are available by anonymous
      ftp from ftp.icot.or.jp.  Note that most of the programs are written
      for the PSI machines, and very few have been ported to Unix-based
      emulators.  For further information, send email to ifs@icot.or.jp, or
      write to ICOT Free Software Desk, Institute for New Generation
      Computer Technology, 21st Floor, Mita Kokusai Bldg., 4-28, Mita
      1-chome, Minato-ku, Tokyo 108, Japan, fax +81-3-3456-1618.

   Machine Learning:

      Various programs (e.g., ID3) and publications related to machine
      learning are available by anonymous ftp from the machine
      learning group (under Raymond Mooney) at UT-Austin, at
         cs.utexas.edu:pub/mooney.  
      Subdirectories include 
	 ml-course	information and homeworks from a graduate course
			in machine learning taught by Dr. Mooney. Homeworks
			include "miniatures" of various machine learning
			systems written in Common Lisp.
	 ml-code	Common Lisp code corresponding to the assignments
			for the course in the ml-course directory.
	 ml-progs	More "research-level" versions of inductive
			classification algorithms and software for automated
			experiments that generation learning curves that
			compare several systems. 
 	 papers		Publications producted by the machine learning
			research group.

      COBWEB/3 -- Contact: cobweb@ptolemy.arc.nasa.gov

   Medical Reasoning:

      TMYCIN -- sumex-aix.stanford.edu:/tmycin  

   NL Software Registry:

      The Natural Language Software Registry is a catalogue of software
      implementing core natural language processing techniques, whether
      available on a commercial or noncommercial basis. Some of the topics
      listed include speech signal processing, morphological analysis,
      parsers, and knowledge representation systems. The catalogue is
      available by anonymous ftp to tira.uchicago.edu (IP 128.135.96.31), by
      email to registry@tira.uchicago.edu, and by physical mail to NL
      Software Registry, Center for Information and Language Studies, 1100
      East 57th Street, Chicago, IL 60637.

   Natural Language Processing:

      YACC      -- ftp.cs.cmu.edu:
		   /afs/cs/user/mkant/Public/Lisp/johnson-yacc.lisp
                   Contact: Mark Johnson <mj@cs.brown.edu>
		   Lisp YACC/Parser.

      BABBLER   -- Contact: rsf1@ra.msstate.edu
	           Markov chains/NLP

      PENMAN    -- Contact: hovy@isi.edu
		   Natural Language Generation.

      PC-KIMMO  -- msdos.archive.umich.edu:/msdos/linguistics/pckim105.zip
                   An implementation of KIMMO morphological analyzer
		   for the IBM PC. 
      
   Probabilistic Reasoning:

      BELIEF   -- ftp.stat.washington.edu (128.95.17.34)
                  Contact: Russell Almond <almond@stat.washington.edu>
			                  <almond@statsci.com>

      IDEAL    -- Contact: srinivas@rpal.rockwell.com
                  Bayesian networks

   Planning:

      NONLIN   -- cs.umd.edu:/pub/nonlin (128.8.128.8)
                  Contact: nonlin-users-request@cs.umd.edu
                           nonlin-bugs@cs.umd.edu

      ABTWEAK  -- csis.dit.csiro.au:pub/steve
                  Contact: Steven.Woods@csis.dit.csiro.au

      RHETORICAL -- cs.rochester.edu:/pub/knowledge-tools
                  Contact: Brad Miller <miller@cs.rochester.edu>

      SNLP     -- cs.washington.edu:/pub/snlp.tar.Z
                  Contact: weld@cs.washington.edu
                  Nonlinear planner.

      IDM      -- sauquoit.gsfc.nasa.gov (128.183.101.29)
	          Contact: idm-users@chelmsford.gsfc.nasa.gov
		  STRIPS-like planning.

      PRODIGY  -- Contact: prodigy@cs.cmu.edu
                  Integrated Planning and Learning System

      SOAR     -- ftp.cs.cmu.edu:/afs/cs.cmu.edu/project/soar/5.2/2/public/
                  Contact: soar-request@cs.cmu.edu
                  Integrated Agent Architecture

      TILEWORLD -- cs.washington.edu:new-tileworld.tar.Z
                  Planning testbed

      MATS     -- Contact: kautz@research.att.com
		  Temporal constraints

   Qualitative Reasoning:

      QSIM     -- cs.utexas.edu:/pub/qsim
                  Contact: Ben Kuipers <kuipers@cs.utexas.edu>

   Theorem Proving:

      MVL      -- t.stanford.edu:/mvl/mvl.tar.Z
                  Contact: ginsberg@t.stanford.edu
                  Multi-valued logics

      Boyer-Moore -- cli.com:pub/nqthm/nqthm.tar.Z
                     rascal.ics.utexas.edu:/pub/nqthm   128.83.138.20
                     Contact: kaufman@cli.com

   UC/Irvine AI/Machine Learning Repository:

      ics.uci.edu has a variety of AI-related materials, with a special
      focus on machine learning. The directory /pub/machine-learning-databases
      contains over 80 benchmark data sets for classifier systems (30mb).

      Site Librarian: Patrick M. Murphy (ml-repository@ics.uci.edu)
      Off-Site Assistant: David W. Aha (aha@insight.cs.jhu.edu)


   UCLA Artificial Life Depository:

      ftp.cognet.ucla.edu (128.97.50.19):~ftp/pub/alife

      Repository of papers, articles, tech reports, software and other items of
      interest to Artificial Life researchers. It includes an archive of
      past postings to the alife mailing list, alife@cognet.ucla.edu (send
      mail to alife-request@cognet.ucla.edu to be added to the list).

      (Other artificial life information is available from santafe.edu
       in the directory pub/Artificial-Life-III.)

   Stanford University (SUMEX-AIM):
      aim.stanford.edu:/pub/ai{1,2,3}.bib
         Large BibTeX bibliography of Artificial Intelligence papers and 
	 technical reports.

   University of Toronto:
      ftp   -- ftp.cs.toronto.edu:/pub/ailist

      Archives of ailist mailing list, defunct as of January 19, 1990

   OSU Neuroprose:
      archive.cis.ohio-state.edu:/pub/neuroprose	(128.146.8.52)

      This directory contains technical reports as a public service to the
      connectionist and neural network scientific community which has an
      organized mailing list (for info: connectionists-request@cs.cmu.edu)

Other AI-related systems, some of which are available free by anonymous
ftp and others for a nominal fee, include:

      CLIPS is an OPS-like forward chaining production system written in ANSI C
      by NASA. The CLIPS inference engine includes truth maintenance, dynamic
      rule addition, and customizable conflict resolution strategies. CLIPS,
      including the runtime version, is easily embeddable in other
      applications. CLIPS runs on IBM PC compatibles, Macintosh, VAX 11/780,
      Sun 3/260, and HP9000/500.  CLIPS is available from COSMIC at a nominal
      fee for unlimited copies with no royalties.  For more information, email
      service@cossack.cosmic.uga.edu, write COSMIC, University of Georgia, 382
      East Broad Street, Athens, GA 30602, call 404-542-3265, or fax
      404-542-4807. To subscribe to the CLIPS mailing list, send a message to
      the list server listserv@cossack.cosmic.uga.edu (128.192.14.4) with
      message body SUBSCRIBE CLIPS-LIST. An electronic bulletin board
      containing information regarding CLIPS can be reached 24 hours a day at
      713-280-3896 or 713-280-3892. Communications information is 300, 1200, or
      2400 baud, no parity, 8 data bits, and 1 stop bit. The CLIPS help desk
      phone number is 713-280-2233 and email address is
      stbprod@krakatoa.jsc.nasa.gov. The book "Expert Systems:
      Principles and Programming" by Joseph Girrantano and Garey Riley
      comes with an MS-DOS CLIPS interpreter.

      Tierra is an artificial life system for studying the evolution of digital
      organisms. Tierra runs in Unix and MS-DOS. Source code and documentation
      is available by anonymous ftp at tierra.slhs.udel.edu (128.175.41.34) and
      life.slhs.udel.edu (128.175.41.33) in the directories almond/, beagle/,
      doc/, and tierra/.  To be added to either the tierra-announce (official
      announcements only) or tierra-digest (moderated discussion plus
      announcements) mailing lists, send mail to
      tierra-request@life.slhs.udel.edu. Send bug reports to
      tierra-bug@life.slhs.udel.edu.

      Aspirin/MIGRAINES is a neural network simulator available free from the
      MITRE Corporation. It contains a neural network simulation code generator
      which generates high performance C code implementations for
      backpropagation networks. It runs on the following platforms: Apollo,
      Convex, Cray, DecStation, HP, IBM RS/6000, Intel 486/386 (Unix System V),
      NeXT, News, Silicon Graphics Iris, Sun3, Sun4, Mercury i860 (40MHz)
      Coprocessors, Meiko Computing Surface w/i860 (40MHz) Nodes, Skystation
      i860 (40MHz) Coprocessors, and iWarp Cells. The software is available by
      anonymous ftp from the CMU simulator collection on pt.cs.cmu.edu
      (128.2.254.155) in the directory /afs/cs/project/connect/code (you must
      cd to this directory in one atomic operation) and UCLA's cognitive
      science collection on ftp.cognet.ucla.edu (128.97.50.3) in the
      directory alexis as the file am5.tar.Z. For more information, contact
      Russell Leighton <leighton@mitre.org>.

      CLP(R) is a constraint logic programming language with real-arithmetic
      constraints.  The implementation contains a built-in constraint solver
      which deals with linear arithmetic and contains a mechanism for delaying
      nonlinear constraints until they become linear.  Since CLP(R) subsumes
      PROLOG, the system is also usable as a general-purpose logic programming
      language.  It icnludes facilities for meta-programming with constraints.
      The system consists of a compiler, byte-code emulator, and constraint
      solver. CLP(R) is written entirely in C and runs on Suns, Vaxen,
      MIPS-based machines (Decstations, Silicon Graphics), IBM RS6000s and
      PS2s.  It is available free from IBM for academic and research purposes
      only. For more information, write to Joxan Jaffar, H1-D48, IBM Thomas J.
      Watson Research Center, P.O. Box 704, Yorktown Heights, NY 10598, or send
      email to joxan@watson.ibm.com or joxan@yktvmh.bitnet.

      The Link Parser is a highly efficient English parser written by Danny
      Sleator and Davy Temperley. It uses a novel grammatical formalism known
      as Link Grammar to represent a robust and diverse collection of
      English-language phenomena. The system is available by anonymous ftp from
      spade.pc.cs.cmu.edu in the directory /usr/sleator/public/. Read the
      README file for more information.

      Adaptive Logic Network (ALN)
      Available by anonymous ftp from menaik.cs.ualberta.ca (129.128.4.241)
      in pub/atree2.tar.Z. pub/atree2.zip is the MS-Windows/IBM PC version.
      Documentation is in pub/atree2.ps.Z.  

      BPS
      Neural network simulator. Other files of interest. Executables are
      free; source code for a small fee.
      gmuvax2.gmu.edu:/pub/nn

      CONDELA
      A neural network definition language.
      tut.cis.ohio-state.edu:/pub/condela

The Artificial Intelligence CD-ROM (Volume One, 1992) is available
from Network Cybernetics Corporation for $129.00 per copy (plus $5
shipping domestic, $10 shipping international). (Network Cybernetics
Corporation is offering the disc to everyone in the Usenet and Fidonet
realm for a special, discounted price of $59.00 per disc. You must
have a valid Internet or Fidonet address and the order must be prepaid
to qualify.)  The AI CD-ROM is an ISO-9660 format disk usable on any
computer system, and contain a variety of public domain, shareware,
and other software of special interest to the AI community.  The disk
contains source code, executable programs, demonstration versions of
commercial programs, tutorials and other files for a variety of
operating systems.  Among the supported operating systems are MS-DOS,
OS/2, Mac, Amiga, and Unix.  Among the items included are CLIPS v5.1
and NETS, courtesy of COSMIC, the collected source code from AIExpert
magazine from the premier issue in June of 1986 to the present, and
complete transcriptions of the first annual Loebner Prize competition,
which took place at the Boston Computer Museum. It also includes
examples many different kinds of neural networks, genetic algorithms,
artificial life simulators, natural language software, public domain
and shareware compilers for a wide range of languages such as Lisp,
Xlisp, Scheme, XScheme, Smalltalk, Prolog, ICON, SNOBOL, and many
others.  Complete collections of the Neural Digest, Genetic Algorithms
Digest, and Vision List Digest are included. Network Cybernetics
Corporation intends to release annual revisions to the AI CD-ROM to
keep it up to date with current developments in the field.  For more
information, write to Network Cybernetics Corporation, 4201 Wingren
Road, Suite 202, Irving, Texas 75062-2763, call 214-650-2002, fax
214-650-1929, or send email to ai-cdrom@ocitor.fidonet.org or
steve.rainwater@ocitor.fidonet.org (Steve Rainwater).

----------------------------------------------------------------
Subject: [5] Technical Reports available by FTP

This section lists the anonymous ftp sites for technical reports from
several universities and other organizations. Some of the sites
provide only an online catalog of technical reports, while the rest
make the actual reports available online. The email address listed is
that of the appropriate person to contact with questions about
ordering technical reports. 

When ftping compressed .Z files, remember to set the transfer type to
binary first, using the command
	ftp> binary

Another general location for technical reports from several
universities is available as wuarchive.wustl.edu:/doc/techreports/.

The Computer Science Department at the University of Saarbruecken, Germany,
maintains a large bibliographic database of articles pertaining to the
field of Artificial Intelligence. Currently the database contains more
than 25,000 references, which can be retrieved by electronic mail from
the LIDO mailserver at lido@cs.uni-sb.de. Send a mail message with
subject line "lidosearch help info" to get instructions on using the
mail server. A variety of queries based on author names, title and
year of publication are possible. The references can be provided in
BibTeX or Refer formats. The entire bibliographic database can be
obtained for a fee by ftp or on tape. Questions may be directed to
bib-1@cs.uni-sb.de.

A variety of AI-related bibliographies are located on nexus.yorku.ca
in the directory /pub/bibliographies.

For information on a fairly complete bibliography of computational
linguistics and natural language processing work from the 1980s, send
mail to clbib@csli.stanford.edu with the subject HELP. 

A BibTeX database of references addressing neuro-fuzzy issues can be
obtained by anonymous ftp from ftp.tu-bs.de (134.169.34.15) in the
directory local/papers as the (ascii) file fuzzy-nn.bib.

The newsgroup comp.doc.techreports is devoted to distributing lists of
tech reports and their abstracts.

   MIT Artificial Intelligence Laboratory:
      ftp   -- ftp.ai.mit.edu:pub/publications/
      email -- publications@ai.mit.edu

      A full catalog of MIT AI Lab technical reports (and a listing of recent
      updates) may be obtained from the above location, by writing to
      Publications, Room NE43-818, M.I.T. Artificial Intelligence Laboratory,
      545 Technology Square, Cambridge, MA 02139, USA, or by calling
      1-617-253-6773. The catalog lists the technical reports ("AI Memos") 
      with a short abstract and their current prices. There is also a charge
      for shipping.

      The only technical report currently available online is Sandiway
      Fong's 1991 PhD thesis, ``The Computational Properties of
      Principle-Based Grammatical Theories,'' which may be found in the
      directory pub/sandiway/.

   CMU School of Computer Science:
      ftp   -- reports.adm.cs.cmu.edu
      email -- Technical.Reports@cs.cmu.edu

   CMU Software Engineering Institute:
      ftp   --  ftp.sei.cmu.edu:/pub/documents
      email --  bjz@sei.cmu.edu

   Yale: 
      ftp   --  dept.cs.yale.edu:/pub/TR/

   University of Washington CSE Tech Reports:
      ftp   --  june.cs.washington.edu:/tr  
      email --  tr-request@cs.washington.edu

   ================

   AT&T Bell Laboratories:
      ftp   -- research.att.com:/netlib/research/cstr

      bib.Z contains short bibliography, including all the technical
      reports contained in this directory.

      ftp   -- research.att.com:/dist/ai

   Boston University:
      ftp   --  cs.bu.edu:techreports/
      email --  techreports@cs.bu.edu

   Brown University:
      ftp   --  wilma.cs.brown.edu:techreports/
      email -- 	techreports@cs.brown.edu

   Columbia University:
      ftp   --  cs.columbia.edu:/pub/reports
      email --  tech-reports@cs.columbia.edu

   DEC Cambridge Research Lab:
      ftp   --  crl.dec.com:/pub/DEC/CRL/{abstracts,tech-reports}

   DFKI:
      ftp   -- duck.dfki.uni-sb.de:/pub/papers
      email -- Martin Henz (henz@dfki.uni-sb.de)

   Duke University:
      ftp   --  cs.duke.edu:/dist/{papers,theses}
      email --  techreport@cs.duke.edu

   Edinburgh:
      A list of available reports can be sent via email. Send requests
      for information about reports from the Center for Cognitive Science 
      to cogsci%ed.ac.uk@nsfnet-relay.ac.uk, and from the Human Communication 
      Research Center to HCRC%ed.ac.uk@nsfnet-relay.ac.uk.  

   Georgia Tech College of Computing, AI Group:
      ftp   -- ftp.cc.gatech.edu:pub/ai (130.207.3.245) 
      email -- Professor Ashwin Ram <ashwin@cc.gatech.edu>

   Illinois:
      email -- Erna Amerman <erna@uiuc.edu>

   Indiana:
      ftp   -- cs.indiana.edu:pub/techreports [129.79.254.191]

   Institute for Learning Sciences at Northwestern University:
      ftp   --  ftp.ils.nwu.edu:/pub/papers/

   New York University (NYU):
      ftp   --  cs.nyu.edu:/pub/tech-reports

   OGI:
      ftp   --  cse.ogi.edu:/pub/tech-reports
      email --  csedept@cse.ogi.edu

   Ohio State University, Laboratory for AI Research
      ftp   -- nervous.cis.ohio-state.edu:/pub/papers
      email -- lair-librarian@cis.ohio-state.edu

   OSU Neuroprose:
      ftp   -- archive.cis.ohio-state.edu:/pub/neuroprose  (128.146.8.52)

      This directory contains technical reports as a public service to the
      connectionist and neural network scientific community which has an
      organized mailing list (for info: connectionists-request@cs.cmu.edu)

   SUNY at Stony Brook:
      ftp   -- sbcs.sunysb.edu:/pub/TechReports
      email -- rick@cs.sunysb.edu or stark@cs.sunysb.edu

      The /pub/sunysb directory contains the SB-Prolog implementation
      of the Prolog language. Contact warren@sbcs.sunysb.edu for more
      information.

   Thinking Machines:
      ftp   -- ftp.think.com:think/techreport.list

      This file contains a list of Thinking Machines technical reports.
      Orders may be placed by email (limit 5) to t-rex@think.com, or by US
      Mail to Thinking Machines Corporation, Attn: Technical reports, 245
      First Street, Cambridge, MA 01241. In addition, the directories
      cm/starlisp and cm/starlogo contain code for the *Lisp and *Logo
      simulators. 

   University of Arizona:
      ftp   -- cs.arizona.edu:reports/
      email -- tr_libr@cs.arizona.edu

      The directory /japan/kahaner.reports contains reports on AI in
      Japan, among other things.

   University of California/Santa Cruz:
      ftp   -- ftp.cse.ucsc.edu:/pub/{bib,tr}
      email -- jean@cs.ucsc.edu

   University of Colorado:
      ftp   --  ftp.cs.colorado.edu:/pub/cs/techreports

   University of Florida:
      ftp   -- bikini.cis.ufl.edu:/cis/tech-reports

   University of Illinois at Urbana:
      ftp   -- a.cs.uiuc.edu:/pub/dcs
      email -- erna@a.cs.uiuc.edu

   University of Indiana, Center for Research on Concepts and Cognition:
      ftp   --  cogsci.indiana.edu:pub/
      email --  helga@cogsci.indiana.edu

   University of Kentucky:
      ftp   --  ftp.ms.uky.edu:ftp/pub/tech-reports/UK/cs/

   University of Massachusetts at Amherst:
      email --  techrept@cs.umass.edu

   University of Michigan:
      ftp   -- z.eecs.umich.edu:/techreports
	
   University of North Carolina:
      ftp   -- ftp.cs.unc.edu:/pub/technical-reports/

   University of Pennsylvania:
      email -- publications@upenn.edu

   USC/Information Sciences Institute:
      email -- Sheila Coyazo <scoyazo@isi.edu> is the contact.

   University of Toronto:
      ftp   -- ftp.cs.toronto.edu:/pub/reports
      email -- tech-reports@cs.toronto.edu

   University of Virginia:
      ftp   -- uvacs.cs.virginia.edu:/pub/techreports/cs

   University of Wisconsin:
      ftp   -- ftp.cs.wisc.edu:/tech-reports
      email -- tech-reports-archive@cs.wisc.edu


Some AI authors have set up repositories of their own papers:

   Matthew Ginsberg: t.stanford.edu:/u/ftp/papers

----------------------------------------------------------------
Subject: [6]  What are the rules for the game of "Life"?

Cellular Automata, of which Life is an example, were suggested by
Stanislaw Ulam in the 1940s, and first formalized by von Neumann.
Conway's "Game of Life" was popularized in Martin Gardner's
mathematical games column in the October 1970 and February 1971 issues
of Scientific American.  (Shorter notes on life are alse given in the
column in each month from October 1970 to April 1971, and well as
November 1971, January 1972, and December 1972.)

The rules for the game of life are quite simple. The game board is a
rectangular cell array, with each cell either empty or filled. At each
tick of the clock, we generate the next generation by the following rules:

	if a cell is empty, fill it if 3 of its neighbors are filled
	(otherwise leave it empty)

	if a cell is filled, it
		dies of loneliness if it has 1 or fewer neighbors
		continues to live if it has 2 or 3 neighbors
		dies of overcrowding if it has more than 3 neighbors

Neighbors include the cells on the diagonals. Some implementations use
a torus-based array (edges joined top-to-bottom and left-to-right) for
computing neighbors. 

For example, a row of 3 filled cells will become a column of 3 filled
cells in the next generation. The R pentomino is an interesting
pattern: 
      xx
     xx
      x
Try it with other patterns of 5 cells initially occupied. If you
record the ages of cells, and map the ages to colors, you can get a
variety of beautiful images.

When implementing Life, be sure to maintain separate arrays for the
old and new generation. Updating the array in place will not work
correctly. 
----------------------------------------------------------------
Subject: [7]  What AI competitions exist?

The Loebner Prize, based on a fund of over $100,000 established by New
York businessman Hugh G. Loebner, is awarded annually for the computer
program that best emulates natural human behavior. During the
contest, a panel of independent judges attempts to determine whether
the responses on a computer terminal are being produced by a computer
or a person, along the lines of the Turing Test. The designers of the
best program each year win a cash award and a medal. If a program
passes the test in all its particulars, then the entire fund will be
paid to the program's designer and the fund abolished. For further
information about the Loebner Prize, write Dr. Robert Epstein,
Executive Director, Cambridge Center for Behavioral Studies, 11
Waterhouse Street, Cambridge, MA 02138, or call 617-491-9020.

The BEAM Robot Olympics is a robot exhibition/competition started in
1991. For more information about the competition, write to BEAM Robot
Olympics, c/o: Mark W. Tilden, MFCF, University of Waterloo, Ontario,
Canada, N2L-3G1, 519-885-1211 x2454, mwtilden@watmath.uwaterloo.ca.

----------------------------------------------------------------
Subject: [8]  Where can I get a machine readable dictionary, thesaurus, and
              other text corpora?

Free:

   Roget's 1911 Thesaurus is available by anonymous FTP from the
   Consortium for Lexical Research (clr.nmsu.edu, [128.123.1.11]).
   The pathname is /pub/lexica/thesauri/roget-1911.

   Project Gutenberg has a public domain thesaurus. For more
   information, write to Michael S. Hart, Professor of Electronic Text,
   Executive Director of Project Gutenberg Etext, Illinois Benedictine
   College, Lisle, IL 60532 or send email to hart@vmd.cso.uiuc.edu.

   The Open Book Initiative maintains a text repository on world.std.com
   (a public access UNIX system, 617-739-WRLD). For more information,
   send email to obi@world.std.com, write to Software Tool & Die, 1330
   Beacon Street, Brookline, MA 02146, or call 617-739-0202.

   The CHILDES project at Carnegie Mellon University has a lot of data of
   children speaking to adults, as well as the adult written and adult
   spoken corpora from the CORNELL project.  Contact Brian MacWhinney
   <brian@andrew.cmu.edu> for more information.

   The Association for Computational Linguistics (ACL) has a Data
   Collection Initiative. For more information, contact Donald Walker at
   Bellcore, walker@flash.bellcore.com.

   Two lists of common female first names (4967 names) and male first
   names (2924 names) are available for anonymous ftp from ftp.cs.cmu.edu
   in the directory /afs/cs.cmu.edu/user/mkant/Public/Corpii/Names/. Read
   the file README first. [Note that you must cd to this directory in one
   atomic operation, as superior directories are protected during an
   anonymous ftp.] Send mail to mkant@cs.cmu.edu for more information.

Commercial:

   Illumind publishes the Moby Thesaurus (25,000 roots/1.2 million
   synonyms), Moby Words (560,000 entries), Moby Hyphenator (155,000
   entries), and the Moby Part-of-Speech (214,000 entries) and Moby
   Pronunciator (167,000 entries) lexical databases. All databases are
   supplied in pure ASCII, royalty-free, in both Macintosh and MS-DOS
   disk formats (also in .Z file formats). Both commercial (to resell
   derived structures as part of commercial applications) and
   educational/research licenses are available. For more information,
   write to Illumind, Grady Ward, compiler, 571 Belden Street, Suite A,
   Monterey, CA 93940, call 408-373-1491, or send email to grady@btr.com.

   The Oxford Text Archive has hundreds of online texts in a wide variety
   of languages, including a few dictionaries (the OED, Collins, etc.).
   The Lancaster-Oslo-Bergen (LOB), Brown, and London-Lund corpii are also
   available from them.  For more information, write to Oxford Electronic
   Publishing, Oxford University Press, 200 Madison Avenue, New York, NY
   10016, call 212-889-0206, or send mail to archive@vax.oxford.ac.uk.
   (Their contact information in England is Oxford Text Archive, Oxford
   University Computing Service, 13 Banbury Road, Oxford OX2 6NN, UK, +44
   (865) 273238.)

----------------------------------------------------------------
Subject: [9]  List of Smalltalk implementations.

   Little Smalltalk -- Tim Budd's version of Smalltalk
   cs.orst.edu: /pub/budd/small.v3.tar

   GNU Smalltalk
   prep.ai.mit.edu:/pub/gnu/smalltalk-1.1.1.tar.Z  

----------------------------------------------------------------
Subject:  [10] Prolog Information

Information about Prolog may be obtained from two sources: The Prolog
FAQ, which is posted twice a month to the newsgroup comp.lang.prolog
by Jamie Andrews <jamie@cs.sfu.ca>, and the Prolog Resource Guide,
which is posted to the newsgroup comp.lang.prolog once a month, and is
available by anonymous ftp from ftp.cs.cmu.edu [128.2.206.173] as the
file /afs/cs.cmu.edu/user/mkant/Public/AI/prolog-resource-guide.txt.

----------------------------------------------------------------
Subject:  [11] Commercial AI products.

RAL (Rule-extended Algorithmic Language) is a C-based RETE (OPS83)
implementation that allows one to seamlessly add rules and objects to
C programs. It runs on Apollo, Sony News, AT&T 3B series, Aviion,
DecStation, HP9000, RS/6000, Sun3, Sparc, Pyramid, Stratus, Unix
System V 386 machines, VAX, microVAX (VMS) and DOS. Production Systems
Technologies was founded by Charles Forgy, the original inventor of
the RETE algorithm.  For further information, write to Production
Systems Technologies, Inc., 5001 Baum Boulevard, Pittsburgh, PA 15213,
call 412-683-4000 or fax 412-683-6347.

Stiquito is a small (3cm H x 7cm W x 6cm L), simple (32 parts) and
inexpensive (< $30) nitinol-propelled hexapod robot developed at the
Indiana University (Bloomington) Robotics Laboratory.  Its legs are
propelled by nitnol actuator wires. Each leg has one degree of freedom.
The robot walks up to 10 centimeters per minute and can carry a 9-volt
cell, a MOSIS "tiny chip" and power transistors to drive the nitinol
actuator wires.  Nitinol wire (aka BioMetal, Flexinol), is a
nickel-titanium alloy which exerts useful force as it is heated by
passing a current through it. IUCS Technical Report 363a describes
Stiquito's construction and is available by anonymous ftp from
cs.indiana.edu:/pub (129.79.254.191) in PostScript and Word4 formats as
the files stiquito.ps.a{a,b,c}.Z and stiquito.w4.a{a,b,c}.Z,
respectively. The tech report is also available by US mail for $5
(checks or money orders should be made payable to "Indiana University")
from Computer Science Department, Attn: TR 363a 215, Lindley Hall,
Indiana University, Bloomington, Indiana 47405.  A kit containing all
the materials needed to construct a simple version of Stiquito and its
controller is available for an extra $10 from the above address (use
attn line "Stiquito Kit"). To receive a video showing the assembly of
Stiquito, include an additional $10 and add "Video" to the attn line.
Anyone may build and use Stiquitos in any quantity for educational or
research purposes, but Indiana University reserves all rights to
commercial applications.  Questions about Stiquito should be sent to
jwmills@cs.indiana.edu. To join the mailing list, send mail to
stiquito-request@xcf.berkeley.edu. 

The following is from Risks Digest 13.83 -- I have no idea what the software
does, but Colby did head up the PARRY project:

  FEELING HELPLESS ABOUT DEPRESSION? Overcoming Depression 2.0 provides
  computer based cognitive therapy for depression with therapeutic
  dialogue in everyday language.  Created by Kenneth Mark Colby, M.D.,
  Professor of Psychiatry and Biobehavioural Sciences, Emeritus, UCLA.
  Personal Version ($199), Professional version ($499).  Malibu
  Artificial Intelligence Works, 25307 Malibu Rd, CA 90265.
  1-800-497-6889.

----------------------------------------------------------------
Subject: [12] Glossary of AI terms.

This is the start of a simple glossary of short definitions for AI terminology.

   Strong AI: 		
	Claim that computers can be made to actually think, just like
        human beings do.

   Weak AI:   		
	Claim that computers can't think but can be made to simulate
	human activity. 

   Case-based Reasoning: 
	Technique whereby "cases" similar to the current problem are
	retrieved and their "solutions" modified to work on the current
	problem. 

----------------------------------------------------------------

;;; *** Change Log
;;;
;;; 13-SEP-92 mk    Moved Prolog information into the updated Prolog Resource
;;;                 Guide. 
;;; 14-SEP-92 mk    Added automated reasoning references. Added automated
;;;                 reasoning systems to [4], ftp resources.
;;;                 Split FAQ into two pieces.
;;; 15-SEP-92 mk    Added IE-digest.
;;; 30-SEP-92 mk    Added Stiquito entry.
;;;  8-OCT-92 mk    Added Glossary question, updated ECTL entry.
;;; *EOF*
Xref: sparky comp.ai:3904 comp.robotics:2037 sci.electronics:17079