NetNews Usenet Archive 1992 #20/NN_1992_20.iso/spool/comp/ai/3428

Internet Message Format | 1992-09-12 | 59.8 KB

Xref: sparky comp.ai:3428 news.answers:2879
Path: sparky!uunet!ogicse!das-news.harvard.edu!cantaloupe.srv.cs.cmu.edu!crabapple.srv.cs.cmu.edu!mkant
From: [e-mail] (Mark Kantrowitz)
Newsgroups: comp.ai,news.answers
Subject: FAQ: Artificial Intelligence Questions & Answers [Monthly posting]
Summary: Frequently asked questions about AI
Message-ID: <[e-mail]>
Date: 13 Sep 92 07:01:04 GMT
Article-I.D.: cs.ai-faq.text_716367645
Expires: Tue, 27 Oct 1992 07:00:45 GMT
Sender: [e-mail] (Usenet News System)
Reply-To: [e-mail]
Followup-To: poster
Organization: School of Computer Science, Carnegie Mellon University
Lines: 1499
Approved: [e-mail]
Nntp-Posting-Host: a.gp.cs.cmu.edu

Archive-name: ai-faq
Last-Modified: Mon Sep  7 14:54:28 1992 by Mark Kantrowitz
Version: 1.1

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

If you think of questions that are appropriate for this FAQ, or would
like to improve an answer, please send email to [e-mail].

Topics Covered:

  [0]  What is the purpose of this newsgroup?
  [1]  Bibliography of introductory texts, overviews and references
  [2]  AI-related Associations
  [3]  AI-related Mailing Lists
  [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.

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 file ai-faq.text
   is 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.

----------------------------------------------------------------
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 [3].

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 [e-mail] 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] Bibliography of introductory texts, overviews and references

This section provides a bibliography of good introductory texts and
overviews of AI and specific subfields of AI:

1.  AI in general (Introductions, Overviews)

    Elaine Rich & Kevin Knight, "Artificial Intelligence", 2nd edition,
    McGraw-Hill, New York, 1991. ISBN 0-07-052263-4

    Shapiro, Stuart C. (ed), "Encyclopedia of Artificial Intelligence",
    John Wiley & Sons, New York, 1987.

    Alan Bundy, editor, "Catalogue of Artificial Intelligence
    Techniques", 3rd Edition, Springer Verlag, 1990, ISBN 0-387-52959-4.

    Sundermeyer, K., "Knowledge-Based Systems: Terminology and References",
    Wissenschaftverlag, 1991. ISBN 3-411-14941-8

    Older general introductions:

    Patrick Henry Winston, "Artificial Intelligence", 2nd Edition,
    Addison-Wesley, Reading, MA, 1984.

    Nils J. Nilsson, "Principles of Artificial Intelligence", Tioga
    Publishing Company, Palo Alto, CA, 1980.

    Eugene Charniak and Drew V. McDermott, "Introduction to Artificial
    Intelligence", Addison-Wesley, Reading, MA, 1985.

    Morgan Kaufmann Publisher's order number is 800-745-7323 (415-578-9911)
    and their email address is [e-mail]. Their "Readings in X"
    series is a good source of information on various AI topics. (Many of
    them are listed below.)

2.  Natural Language Processing (NLP)

    General:

    Gazdar, G. and Mellish, C., "Natural Language Processing in Lisp:
    An Introduction to Computational Linguistics", Addison-Wesley,
    Reading, Massachusetts, 1989. (There are three different editions
    of the book, one for Lisp, one for Prolog, and one for Poplog.)

    Grosz, B.J., Sparck-Jones, K., and Webber, B.L., "Readings in
    Natural Language Processing", Morgan Kaufmann Publishers, Los
    Altos, CA, 1986.

    Robert C. Berwick, "Computational Linguistics", MIT Press,
    Cambridge, MA, 1989, ISBN 0262-02266-4.

    Brady, Michael, and Berwick, Robert C., "Computational Models
    of Discourse", MIT Press, Cambridge, MA, 1983.

    Klaus K. Obermeier, "Natural Language Processing Technologies
    in Artificial Intelligence: The Science and Industry Perspective",
    John Wiley & Sons, New York, 1989.

    Allen, James F., "Natural Language Understanding", The
    Benjamin/Cummings Publishing Company, Menlo Park, California,
    (Addison-Wesley Publishing Company, Reading, Massachusetts),
    1988, ISBN 0-8053-0330-8.

    Terry Winograd, "Language as a Cognitive Process", Addison-Wesley,
    Reading, MA, 1983.

    Parsing:

    Tomita, M. (Editor), "Current Issues in Parsing Technology",
    Kluwer Academic Publishers, Norwell, MA, 1991.

    Tomita, M., "An Efficient Context-Free Parsing Algorithm",
    Computational Linguistics 13:31-46, 1987.

    Probabilistic Parsing:

    Wright, J., "LR Parsing of Probabilistic Grammars with Input
    Uncertainty for Speech Recognition", Computer Speech and Language
    4:297-323, 1990.

    Ted Briscoe and John Carroll, "Generalised Probabilistic LR Parsing of
    Natural Language (Corpora) with Unification-based Grammars",
    University of Cambridge Computer Laboratory, Technical Report Number
    224, 1991.

    Natural Language Interfaces:

    Raymond C. Perrault and Barbara J. Grosz, "Natural Language
    Interfaces", Annual Review of Computer Science, vol 1, J.F. Traub,
    editor, Annual Reviews Inc., Palo Alto, CA, 1986.

    Natural Language Generation:

    McKeown, Kathleen R. and Swartout, William R., "Language
    Generation and Explanation", in Zock, M. and Sabah, G.,
    editors, Advances in Natural Language Generation, Volume 1, Pages
    1-51, Ablex Publishing Company, Norwood, NJ, 1988. (Overview of
    the state of the art in natural language generation.)

3.  Planning

    Intros, Overviews, Paper Collections:

    James Allen, James Hendler and Austin Tate, editors,
    "Readings in Planning", Morgan-Kaufmann Publishers, 1990.

    James Hendler, Austin Tate and Mark Drummond, "AI Planning:
    Systems and Techniques", AI Magazine, May, 1990. (Review article.)

        Georgeff, M. P., "Planning," in Annual Review of Computer Science,
        Annual Reviews Inc., pages 359-400, 1987.

        Drew McDermott, "Robot Planning", AI Magazine 13:2, Summer
    1992, pp. 55-79.

    STRIPS:

    Fikes, R.E. and Nilsson, N.J., "STRIPS: A new approach to the
    application of theorem proving to problem solving", Artificial
    Intelligence 2:189-208, 1971.

    ABSTRIPS:

    Sacerdoti, E. D., "Planning in a Hierarchy of Abstraction Spaces,"
    Artificial Intelligence, 5:115-135, 1974.

    Conjunctive Goals:

    Chapman, D., "Planning for Conjunctive Goals", Artificial Intelligence
    32:333-377, 1987.

    NOAH:

    Sacerdoti, E., "A Structure for Plans and Behavior", Artificial
    Intelligence, pages 1-65, American Elsevier, New York, 1977.

    Sacerdoti, E. D., "The Nonlinear Nature of Plans," Proc. of the Fourth
    Joint Conf. on Artificial Intelligence, Morgan Kaufmann, 1975, 206-214.

    Reactive Planning:

    Agre P.E. and Chapman, D., "Pengi: An Implementation of a Theory of
    Activity", in Proceedings of the Sixth National Conference on
    Aritificial Intelligence, Seattle, WA, July 1987.

    Georgeoff, M.P. and Lansky, A.L., "Reactive Reasoning and
    Planning", in Proceedings of the Sixth National Conference on
    Artificial Intelligence, Seattle, WA, pages 677-682, July 1987.

    Simmons, R.G., "A theory of debugging plans and interpretations", in
    Proceedings of the Seventh National Conference on Artificial
    Intelligence (AAAI-88), Morgan Kaufmann Publishers, Palo Alto,
    CA, pages 94-99, 1988.

    Case-based Planning:

    Hammond, K., "Case-based Planning: Viewing Planning as a Memory Task",
    Academic Press, Cambridge, MA, 1989.

    Miscellaneous:

    Stefik, M.J., "Planning with Constraints", Artificial Intelligence
    15:111-140 and 16:141-170, 1981.

    Wilkins, D.E., "Domain-Independent Planning: Representation and Plan
    Generation", Artificial Intelligence 22:269-301, 1984.

4.  Connectionism and Neural Nets

    Geoffrey E. Hinton, "Connectionist Learning Procedures",
    Technical Report CMU-CS-87-115 (version 2), Carnegie Mellon
    University, Pittsburgh, PA, December 1987. Also appears in Artificial
    Intelligence 40(1-3):185-234, September 1989.

    Kevin Knight, "A gentle introduction to subsymbolic
    computation: Connectionism for the AI researcher". Technical Report
    CMU-CS-89-150, Carnegie Mellon University, School of Computer Science,
    Pittsburgh, PA, May 30, 1989.

    Rumelhart, D.E., Hinton G.E. and Williams R.J., "Learning internal
    representations", in D.E. Rumelhart and J.L. McClelland,
    editors, Parallel Distributed Processing: Explorations in the
    Microstructure of Cognition (Vol 1: Foundations), Cambridge,
    MA, MIT Press/Bradford Books, 1986.

    J.A. Feldman and D.H. Ballard, "Connectionist models and their
    properties", Cognitive Science, 6(3):205-254, 1982.

5.  Machine Learning

    General:

    J. G. Carbonell, editor, "Machine Learning: Paradigms and Methods", MIT
    Press, Cambridge, MA 1990.

        J. W. Shavlik and T. D. Dietterich, editors, "Readings in
    Machine Learning", Morgan Kaufmann Publishers, 1990.

    Decision Trees:

    Quinlan, J.R., "Induction of Decision Trees", Machine Learning
    1:81-106, 1986.

    Quinlan, J.R., "C4.5: Programs for Machine Learning", Morgan Kaufmann
    Publishers, 1992. For a slight additional charge, the book comes with
    software.

    Probabilistic Clustering:

    Fisher, D.H., "Knowledge Acquisition Via Incremental Conceptual
    Clustering", Machine Learning 2:139-172, 1987. (Probabilistic
    clustering methods.)

    Clancey, W.J., "Classification Problem Solving", Proceedings of the
    National Conference on Aritificial Intelligence, 49-55, Los Altos, CA,
    Morgan Kaufmann. 1984.

    Version Spaces:

    Tom M. Mitchell, "Generalization as Search", Artificial Intelligence
    18:203-226, 1982.

    Machine Discovery:

    Langley, P., and Zytkow, J. M., "Data-driven approaches to empirical
    discovery", Artificial Intelligence 40:283-312, 1989.

    Langley, P., Simon, H.A., Bradshaw, G.L., and Zytkow, J.M.,
    "Scientific Discovery: Computational Explorations of the Creative
    Processes", MIT Press, Cambridge, MA, 1987.

    Langley, P., Simon, H.A. and Bradshaw, G.L., "Heuristics for
    Empirical Discovery", in L. Bolc, editor, Computational Models
    of Learning, Springer-Verlag, 1987. Also appears as CMU CS
    Tech Report CMU-CS-84-14.

    Chunking:

    Laird J.E., Rosenbloom, P.S. and Newell, A., "Chunking in SOAR: The
    Anatomy of a General Learning Mechanism", Machine Learning
    1:1-46, 1986.

    Explanation-Based Learning:

    Mitchell, Tom M., Keller, R. M., and Kedar-Cabelli, S. T.,
    "Explanation-based learning: A unified view", Machine Learning
    1:47-80, 1986.

    Derivational Analogy:

    Carbonell, J. G., "Derivational analogy: A theory of
    reconstructive problem solving and expertise acquisition." In R.S.
    Michalski, Jaime G. Carbonell, and Tom M. Mitchell, editors, Machine
    Learning: An Artificial Intelligence Approach, Morgan Kaufmann
    Publishers, San Mateo, CA, 1986.

    Theoretical Results:

    Haussler, D., "Quantifying Inductive Bias: AI Learning
    Algorithms and Valiant's Learning Framework", Artificial Intelligence,
    36:177-221, 1988.

6.  Case-Based Reasoning

    Roger C. Schank, "Dynamic Memory: A Theory of Reminding and
    Learning in Computers and People", Cambridge University Press, New
    York, NY, 1982.

    Roger C. Schank and C. Riesbeck, "Inside Case-Based Reasoning",
    Lawrence Erlbaum Associates, Hillsdale, NJ, 1989.

    Craig Stanfill and David Waltz, "Toward Memory-Based
    Reasoning", Communications of the ACM, 29(12):1213-1228,
    December 1986. (Memory-based reasoning.)

7.  Genetic Algorithms

    L. B. Booker, D.E. Goldberg and J.H. Holland, "Classifier Systems and
    Genetic Algorithms", Artificial Intelligence 40(1-3):235-282,
    September 1989.

    See also the July 1992 issue of Scientific American.

8.  Production Systems and Match Algorithms

    OPS5:
    Charles L. Forgy, "OPS5 User's Manual", Technical Report
    CMU-CS-81-135, Carnegie Mellon University, School of Computer
    Science, Pittsburgh, PA 1981.

    RETE:
    Charles L. Forgy, "RETE: A fast algorithm for the many
    pattern/many object pattern match problem", Artificial
    Intelligence 19(1):17-37, September 1982.

    TREAT:
    Daniel P. Miranker, "TREAT: A better match algorithm for AI
    production systems". In Proceedings of the Sixth National
    Conference on Artificial Intelligence (AAAI-87), pages 42-47,
    August 1987.

    MatchBox:
    Mark Perlin, "The match box algorithm for parallel production
    system match", Technical Report CMU-CS-89-163, Carnegie Mellon
    University, School of Computer Science, Pittsburgh,
    Pennsylvania, May 1989.

    DRETE:
    Michael A. Kelly and Rudolph E. Seviora, "An evaluation of DRETE
    on CUPID for OPS5 matching", in Proceedings of the Eleventh
    International Joint Conference on Artificial Intelligence (IJCAI-89),
    pages 84-90, Detroit MI, August 1989, Morgan Kaufmann Publishers.

9. Integrated AI Architectures

    Kurt VanLehn, editor, "Architectures for Intelligence",
    Lawrence Erlbaum Associates, Hillsdale, NJ, 1991.

    SOAR:
    John E. Laird, Allen Newell, and Paul S. Rosenbloom, "SOAR: An
    Architecture for General Intelligence", Artificial
    Intelligence, 33(1):1-64, 1987.

    PRODIGY:
    Steven Minton, Jaime G. Carbonell, Craig A. Knoblock,
    Daniel R. Kuokka, Oren Etzioni, and Yolanda Gil.
    "Explanation-based learning: A problem solving perspective".
    Technical Report CMU-CS-89-103, Carnegie Mellon University,
    School of Computer Science, Pittsburgh, PA, 1989.

    THEO:
    Tom M. Mitchell, J. Allen, P. Chalasani, J. Cheng, Oren Etzioni,
    Marc Ringuette, and Jeffrey Schlimmer, "THEO: A Framework for
    Self-Improving Systems", in Kurt VanLehn, editor, Architectures for
    Intelligence, Lawrence Erlbaum Associates, Hillsdale, NJ, 1991.

    Subsumption Architectures:
    Brooks, R., "A Robust Layered Control System for a Mobile Robot",
    IEEE Journal of Robotics and Automation, RA-2, pages 14-23, April 1986.

10. Knowledge Representation

    Brachman, R.J. and Levesque, H.J., editors, "Readings in Knowledge
    Representation", Morgan Kaufmann Publishers, 1985.

11. Fuzzy Logic

    Zadeh, L.A., "Fuzzy Sets," Information and Control, 8, 338-353, 1965.

    Klir, George J. and Folger, Tina A., "Fuzzy Sets, Uncertainty, and
    Information", Englewood Cliffs,  NJ: Prentice Hall, 1988.

    Zimmermann, Hans J., "Fuzzy Set Theory and its Applications",
    Boston, MA, Kluwer-Nijhoff Publishing, 1985.

    Didier Dubois, Henri Prade, and Ronald R. Yager, editors,
    "Readings in Fuzzy Systems", Morgan Kaufmann Publishers, 1992.

12. Artificial Life

    The best source for information is the proceedings of the
    Artificial Life conferences. The proceedings were edited by
    Christopher G. Langton and published by Addison-Wesley.

    Christopher Langton, editor, "Artificial Life", Addison-Wesley, 1989.

    There is also a book on Artificial Life by Steven Levy, the
    author of the book Hackers.

13. Miscellaneous (Search, Logic, TMS)

    L. Kanal and V. Kumar, "Search in Artificial Intelligence",
    Springer-Verlag, 1988.

    Hans J. Berliner, "The B* Tree Search Algorithm: A Best-First Proof
    Procedure", Artificial Intelligence, 12(1):23-40, May 1979.

    Pearl, J., "Heuristics: Intelligent Search Strategies for Computer
    Problem Solving", Addison-Wesley, 1984.

    Genesereth, M.R. and Nilsson, N.J., "Logical Foundations of Artificial
    Intelligence", Morgan Kaufmann Publishers, Los Altos, CA, 1987.

    Doyle, J., "Truth Maintenance Systems", Artificial Intelligence,
    12:231-272, 1979.

    Kirkpatrick, S. Gelatt, CD, and Vecci, MP, "Optimization by Simulated
    Annealing", Science 220(4589):671-680.



Also, be sure to check the proceedings of the various national
conferences in the area that interests you.

Videotapes:

   The 4th episode of the PBS series "The Machine That Changed the World" is
   a good introduction to AI. It is available for $90 from Films for the
   Humanities, 1-800-257-5126.

   Morgan Kaufmann also has a good set of tapes of AI-related lectures, but
   it runs on the expensive side.


AI-related magazines include:

    AI EXPERT
    Miller Freeman, Inc., 600 Harrison Street, San Francisco, CA 94107.
    Subscriptions: 1-800-274-2534 or 303-447-9330
    $42/year (12 issues), $6 extra in Canada and Mexico,
    $15 extra (surface mail) or $40 (air mail) for overseas.

    PC AI
    3310 West Bell Road, Suite 119, Phoenix, AZ 85023.
    Subscriptions: 602-971-1869, fax [phone].
    $28/year (6 issues); $54 for two years; $78 for three years.
    $9 extra in Canada and Mexico, $25 extra (air mail) for all
    other countries.

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

Associations:

   AMERICAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (AAAI)
   AAAI, 445 Burgess Drive, Menlo Park, CA 94025.
   415-328-3123, [e-mail]
   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 [phone]. Email: [e-mail].
   $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
   [e-mail]
   $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 [phone].
   PO Box 358, Accord Station, Hingham, MA 02018-0358.
   Email: [e-mail]
   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 [phone].

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

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

----------------------------------------------------------------
Subject: [3] 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
   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
   comp.lang.smalltalk          Smalltalk

   aicom mcvax!swivax![e-mail]    International Usenet AI news


AI Research in a particular country:

   British AI            alvey [e-mail]
   Japanese AI            [e-mail]
   German AI            [e-mail]
   Mexican AI            IAMEX-L on [e-mail]

   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:
        [e-mail] (Juana Maria Gomez Puertos)
        [e-mail] (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
   <[e-mail]>.

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


Artificial Life:
   [e-mail]

   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
   [e-mail] to be added to the list.


AI applications to Human-Computer interface design:
   AI-CHI <wiley![e-mail]>

   All requests to be added to or deleted from this list, problems, questions,
   etc., should be sent to wiley![e-mail].


AI in Education:
   [e-mail] (was [e-mail])

   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 [e-mail].


Artificial Intelligence and Law:
   [e-mail]

   To subscribe to AIL-L you should send a message to the internet address
        [e-mail]
   The body of the message should consist of:
        subscribe AIL-L <your full name>


AI in Medicine:
   [e-mail]

   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 [e-mail]


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
   <[e-mail]>.


Cellular Automata:
   [e-mail]  (aka [e-mail])

   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 [e-mail].


Classification and clustering:
   [e-mail]

   To subscribe to CLASS-L you should send a message to the internet address
        [e-mail]
   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:
      [e-mail]

      All requests to be added to or deleted from this list, problems,
      questions, etc., should be sent to [e-mail].

   Neural Networks (moderated):
      [e-mail]

      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 [e-mail]

      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:
      [e-mail]
      [e-mail]

      All requests to be added to or deleted from this list, problems,
      questions, etc., should be sent to [e-mail].

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


Expert Systems in Agriculture:
   [e-mail]

   To subscribe to ag-exp-l you should send a message to the internet address
        [e-mail]
   The body of the message should consist of:
        subscribe AG-EXP-L <your full name>


Use of computers in the Fine Arts:
   [e-mail]

   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:

    [e-mail] (moderated)

    Send subscription requests to the -request form of the list
    or to [e-mail].

    Past copies of the digest are archieved on ftp.aic.nrl.navy.mil
    in the /pub/galist directory.


Logic Programming, Prolog:

   Prolog and Logic Programming:
      [e-mail] (general)
      [e-mail] (nitty gritty)

      All requests to be added to or deleted from this list, problems,
      questions, etc., should be sent to [e-mail]

   Concurrent Logic Programming:
      [e-mail]

      All requests to be added to or deleted from this list, problems,
      questions, etc., should be sent to [e-mail] or to
      Jacob Levy <[e-mail]>.


Machine Learning:

   [e-mail]

   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 [e-mail].

   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 <[e-mail]>

      To subscribe send the following command to [e-mail]:
     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
      [e-mail].

      Moderator: [e-mail]

   Natural Language and Knowledge Representation (moderated):
      [e-mail] (formerly [e-mail])
      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 [e-mail].

   Natural Language Generation:
      [e-mail]

   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
      [e-mail]. If you have trouble with this mail
      address, call David Leip at [phone] ext.3709.

   Translation and Interpretation of Natural Language:
      [e-mail]

      To add or remove yourself from the list, send a message to
      [e-mail].  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:
      [e-mail]

      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
      <[e-mail]>.

      To add or remove yourself from the list, send a message to
      [e-mail].  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 <[e-mail]>.

      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 <[e-mail]> with the
      following as the body of the message:
          Get SCHOLAR COD
      To retrieve the entire release send mail to <[e-mail]>
      with the folowing as the body of the message:
          Get AZ Package


Neural Networks:
   See Connectionism.


Simulated Annealing:
   Contact: [e-mail] (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:
   [e-mail]
   Gatewayed to the newsgroup comp.simulation.

   All requests to be added to or deleted from this list, problems, questions,
   etc., should be sent to [e-mail].


Symbolic Math:
   Symbolic Math <[e-mail]>
   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
   [e-mail] (ARPANET/MilNet) or sci.math.symbolic (USENET).
   Requests to be included on the list should be sent to
   [e-mail].


AI Vision Research:

   [e-mail]
   All requests to be added to or deleted from this list, problems, questions,
   etc., should be sent to [e-mail].

   [e-mail]
   Color and vision research.

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

See the Lisp FAQ for Lisp-related software.

   Ada Repository:

      The Ada Repository on wsmr-simtel20.army.mil (mailing list
      [e-mail]) 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.

   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 [e-mail] (or [e-mail]).

   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 [e-mail], 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 [phone].

   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 [e-mail], and by physical mail to NL
      Software Registry, Center for Information and Language Studies, 1100
      East 57th Street, Chicago, IL 60637.

   UC/Irvine AI 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 benchmark databases for classifier systems.

   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, [e-mail] (send
      mail to [e-mail] 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: [e-mail])

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
      [e-mail], 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 [e-mail] (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
      [e-mail].

      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
      [e-mail]. Send bug reports to
      [e-mail].

      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 <[e-mail]>.

      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 [e-mail] or [e-mail].

      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.

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

      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.)  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-1929, or send email to [e-mail]
or [e-mail] (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 [e-mail]. 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
[e-mail].

For information on a fairly complete bibliography of computational
linguistics and natural language processing work from the 1980s, send
mail to [e-mail] with the subject HELP.

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 -- [e-mail]

      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 -- [e-mail]

   CMU Software Engineering Institute:
      ftp   --  ftp.sei.cmu.edu:/pub/documents
      email --  [e-mail]

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

   University of Washington CSE Tech Reports:
      ftp   --  june.cs.washington.edu:/tr
      email --  [e-mail]

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

   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.

   Boston University:
      ftp   --  cs.bu.edu:techreports/
      email --  [e-mail]

   Brown University:
      ftp   --  wilma.cs.brown.edu:techreports/
      email --     [e-mail]

   Columbia University:
      ftp   --  cs.columbia.edu:/pub/reports
      email --  [e-mail]

   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 ([e-mail])

   Duke University:
      ftp   --  cs.duke.edu:/dist/{papers,theses}
      email --  [e-mail]

   Edinburgh:
      A list of available reports can be sent via email. Send requests
      for information about reports from the Center for Cognitive Science
      to [e-mail], and from the Human Communication
      Research Center to [e-mail].

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

   Illinois:
      email -- Erna Amerman <[e-mail]>

   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 --  [e-mail]

   Ohio State University, Laboratory for AI Research
      ftp   -- nervous.cis.ohio-state.edu:/pub/papers
      email -- [e-mail]

   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: [e-mail])

   SUNY at Stony Brook:
      ftp   -- sbcs.sunysb.edu:/pub/TechReports
      email -- [e-mail] or [e-mail]

      The /pub/sunysb directory contains the SB-Prolog implementation
      of the Prolog language. Contact [e-mail] 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 [e-mail], 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 -- [e-mail]

      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 -- [e-mail]

   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 -- [e-mail]

   University of Indiana, Center for Research on Concepts and Cognition:
      ftp   --  cogsci.indiana.edu:pub/
      email --  [e-mail]

   University of Massachusetts at Amherst:
      email --  [e-mail]

   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 -- [e-mail]

   USC/Information Sciences Institute:
      email -- Sheila Coyazo <[e-mail]> is the contact.

   University of Toronto:
      ftp   -- ftp.cs.toronto.edu:/pub/reports
      email -- [e-mail]

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

   University of Wisconsin:
      ftp   -- ftp.cs.wisc.edu:/tech-reports
      email -- [e-mail]

----------------------------------------------------------------
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, [e-mail].

----------------------------------------------------------------
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 [e-mail].

   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 [e-mail], 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
   <[e-mail]> for more information.

   The Association for Computational Linguistics (ACL) has a Data
   Collection Initiative. For more information, contact Donald Walker at
   Bellcore, [e-mail].

   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 [e-mail] 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 [e-mail].

   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 [e-mail].
   (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 <[e-mail]>, 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 [phone].

----------------------------------------------------------------
;;; *EOF*