From: cardo@cs.ucla.edu Subject: Artificial Intelligence FAQ: FTP Resources 5/7 [Monthly posting] Newsgroups: comp.ai,news.answers,comp.answers Approved: news-answers-request@MIT.EDU Summary: FTP Resources for AI Distribution: world Followup-To: comp.ai Reply-To: cardo@cs.ucla.edu Organization: University of California, Los Angeles Archive-name: ai-faq/general/part5 Posting-Frequency: monthly Last-Modified: Fri Mar 19 13:10:23 PST 1999 by Ric Crabbe Version: 2.0 Maintainer: Ric Crabbe and Amit Dubey URL: ftp://ftp.cs.ucla.edu/pub/AI/ai_5.faq Size: 90070 bytes, 1749 lines ;;; **************************************************************** ;;; Answers to Questions about Artificial Intelligence ************* ;;; **************************************************************** ;;; Written by Amit Dubey, Ric Crabbe, and Mark Kantrowitz ;;; ai_5.faq If you think of questions that are appropriate for this FAQ, or would like to improve an answer, please send email to the maintainers. Please note that the WWW & FTP Resources section is now split across parts 5 and 6 of the AI FAQ. Part 5 (WWW & FTP Resources): [5-0] General Information about WWW & FTP Resources for AI [5-1] WWW & FTP Repositories [5-2a] WWW & FTP Resources: Agents -- Genetic Algorithms [5-2b] WWW & FTP Resources: Genetic Algorithms -- Theorem Proving Note: Question [5-2] is split across parts 5 and 6. Search for [#] to get to question number # quickly. ---------------------------------------------------------------- Subject: [5-0] General Information about WWW & FTP Resources for AI Remember, when ftping compressed or compacted files (.Z, .gz, .arc, .fit, etc.) to use binary mode for retrieving the files. Files that end with a .gz suffix were compressed with the patent-free gzip (no relation to zip). Source for gzip is available from prep.ai.mit.edu:/pub/gnu/ as the files gzip-1.2.4.shar, gzip-1.2.4.tar,or gzip-1.2.4.msdos.exe. If you do not have ftp access, you can FTP files by E-mail. Send a message with the word "help" in the body to ftpmail@decwrl.dec.com. As the DECWRL ftpmail server is overloaded, you are encouraged to use an alternate ftpmail server, such as ftpmail@cs.uow.edu.au (Australia), ftpmail@ftp.uni-stuttgart.de (Germany), ftpmail@doc.ic.ac.uk (Great Britain), ftpmail@ieunet.ie (Ireland), ftpmail@lth.se (Sweden), ftpmail@sunsite.unc.edu (USA), ftpmail@ftp.uu.net (USA, message relayed to ftpmail@decwrl.dec.com, so don't use it), ftpmail@gallifrey.ucs.uoknor.edu (USA), or ftpmail@seds.lpl.arizona.edu (USA). If you're on BITNET, send a message with the word "help" in the body to BITFTP@PUCC, BITFTP@PLEARN or BITFTP@DEARN (Internet equivalents bitftp@pucc.princeton.edu, bitftp@plearn.edu.pl and bitftp@vm.gmd.de, respectively). In general, see the Lisp FAQ for Lisp-related software and the Prolog Resource Guide and the Prolog FAQ for Prolog-related software. If a Lisp-based or Prolog-based system is listed here, only the ftp site and directory will be listed; for a more detailed description, see the Lisp FAQ and the Prolog Resource Guide. For information on obtaining the Lisp FAQ or the Prolog Resource Guide see [1-0]. When referring to software, "alpha" indicates an internal early release, "beta" indicates an external early release, and "omega" indicates an external "finished" release. Generally an "alpha" release means the creator hasn't yet tested for bugs. ---------------------------------------------------------------- Subject: [5-1] WWW & FTP Repositories CMU AI Repository: The CMU Artificial Intelligence Repository was established by Carnegie Mellon University to contain public domain and freely distributable software, publications, and other materials of interest to AI researchers, educators, students, and practitioners. The AI Repository currently contains more than a gigabyte of material and is growing steadily. The AI Repository is accessible for free by anonymous FTP, AFS, and WWW. A selection of materials from the AI Repository is also being published on CD-ROM by Prime Time Freeware and is available for purchase by mail or fax (see [6-5] for more information). The AI Repository is accessible by anonymous FTP from ftp.cs.cmu.edu:/user/ai/ [128.2.206.173] by AFS (Andrew File System) from /afs/cs.cmu.edu/project/ai-repository/ai/ and by WWW from the URL http://www.cs.cmu.edu/Web/Groups/AI/html/repository.html Be sure to read the files 0.doc and readme.txt in this directory. The AI Repository is still under construction, but to date, the AI Programming Languages and the AI Software Packages sections are "complete". These can be accessed in the lang/ and areas/ subdirectories of the AI Repository. Compression and archiving utilities may be found in the util/ subdirectory. Other directories, which are in varying states of completion, are events/ (Calendar of Events, Conference Calls) and pubs/ (Publications, including technical reports, books, mail/news archives). The AI Programming Languages section of the repository includes directories for Common Lisp, Prolog, Scheme, Smalltalk, and other AI-related programming languages. The AI Software Packages section of the repository includes subdirectories for: agents/ Intelligent Agent Architectures alife/ Artificial Life and Complex Adaptive Systems anneal/ Simulated Annealing blackbrd/ Blackboard Architectures bookcode/ Code From AI Textbooks ca/ Cellular Automata classics/ Classical AI Programs constrnt/ Constraint Processing dai/ Distributed AI discover/ Discovery and Data-Mining doc/ Documentation edu/ Educational Tools expert/ Expert Systems/Production Systems fuzzy/ Fuzzy Logic games/ Game Playing genetic/ Genetic Algorithms, Genetic Programming, Evolutionary Programming icot/ ICOT Free Software kr/ Knowledge Representation, Semantic Nets, Frames, ... learning/ Machine Learning misc/ Miscellaneous AI music/ Music neural/ Neural Networks, Connectionist Systems, Neural Systems nlp/ Natural Language Processing (Natural Language Understanding, Natural Language Generation, Parsing, Morphology, Machine Translation) planning/ Planning, Plan Recognition reasonng/ Reasoning (Analogical Reasoning, Case Based Reasoning, Defeasible Reasoning, Legal Reasoning, Medical Reasoning, Probabilistic Reasoning, Qualitative Reasoning, Temporal Reasoning, Theorem Proving/Automated Reasoning, Truth Maintenance) robotics/ Robotics search/ Search speech/ Speech Recognition and Synthesis testbeds/ Planning/Agent Testbeds vision/ Computer Vision The repository has standardized on using 'tar' for producing archives of files and 'gzip' for compression. To search the keyword index by mail, send a message to: ai+query@cs.cmu.edu with one or more lines containing calls to the keys command, such as: keys lisp iteration in the message body. Keywords may be regular expressions and are compared with the index in a case-insensitive conjunctive fashion. You'll get a response by return mail. Do not include anything else in the Subject line of the message or in the message body. For help on the query mail server, include: help instead. A WWW interface to the keyword searching program is accessible through the URL http://www.cs.cmu.edu/Web/Groups/AI/html/keys/keysform.html We plan on making the source code (including indexes) to this keyword searching program available, as soon as it is stable. We hope to eventually have a fully automated calendar of events, an expanded AI Publications directory, mailing list and newsgroup archives, and much much more. Contributions of software and other materials are always welcome but must be accompanied by an unambiguous copyright statement that grants permission for free use, copying, and distribution -- either a declaration by the author that the materials are in the public domain, that the materials are subject to the GNU General Public License (cite version), or that the materials are subject to copyright, but the copyright holder grants permission for free use, copying, and distribution. (We will tell you if the copying permissions are too restrictive for us to include the materials in the repository.) Inclusion of materials in the repository does not modify their copyright status in any way. Materials may be placed in: ftp.cs.cmu.edu:/user/ai/new/ When you put anything in this directory, please send mail to ai+contrib@cs.cmu.edu giving us permission to distribute the files, and state whether this permission is just for the AI Repository, or also includes publication on the CD-ROM version (Prime Time Freeware for AI). We would also appreciate if you would include a 0.doc file for your package; see /user/ai/new/package.doc for a template. (If you don't have the time to write your own, we can write it for you based on the information in your package.) For more information on the CMU AI Repository, please send mail to Mark Kantrowitz . Known mirrors: + Lisp Section ftp.sunet.se:/pub/lang/lisp/ Artificial Life Online and the Artificial Life BBS: Sponsored by MIT Press and the Santa Fe Institute, Artificial Life Online and the Artificial Life BBS is intended to be a central information collection and distribution site on the Internet for any and all aspects of the Artificial Life endeavor. A special feature of the BBS is a collection of 40 or so local newsgroups dedicated to a wide variety of topics in Artificial Life. Artificial Life Online is accessible by anonymous ftp from alife.santafe.edu:/pub/ [192.12.12.99] by World-Wide Web from http://alife.santafe.edu/ and by Gopher from gopher://alife.santafe.edu:70/ To access the Alife Online BBS (ALBBS) by telnet, telnet to alife.santafe.edu and login as "bbs". You will find yourself in a specially constructed UNIX shell within which either BBS menu commands or UNIX commands can be used to browse around in the system. Run the "account" program to set up a local account. These accounts will initially be provided free of charge, but they will eventually have to charge a nominal fee in order to cover operating expenses (on the order of $15-$25 per year). Subscribers to the Artificial Life Journal from MIT Press will have this fee waived. Once you have an account on alife.santafe.edu, you can telnet to alife.santafe.edu and login as yourself. You do not have to create an account to use the ALBBS via telnet -- you can simply login as "bbs" and browse through the system using the BBS commands. Please send suggestions and questions about the Alife Online/BBS system to feedback@alife.santafe.edu. Artificial Life: life.anu.edu.au:/pub/complex_systems/alife/ Consortium for Lexical Research: clr.nmsu.edu:/CLR/ [128.123.1.12] Archive containing a variety of programs and data files related to natural language processing research, with a particular focus on lexical research. The file 00README.clr.site is a good place to start. See the file catalog or catalog.ps for a listing of the contents of the archive. Long descriptions are in the info/ subdirectory. Materials for paid-up members of the Consortium are in the members-only/ subdirectory. Public materials include the Alvey Natural Language Tools, Sowa's Conceptual Graph parser implemented in YACC by Maurice Pagnucco, a morphological parsing lexicon of English, a phonological rule compiler for PC-KIMMO, C source code for the NIST SGML parser, PC-KIMMO sources, the 1911 Roget Thesaurus, and a variety of word lists (including English, Dutch, and male/female/last names). Comments and questions may be directed to lexical@nmsu.edu. There are also some materials in clr.nmsu.edu:/pub/ unrelated to the archive. Fuzzy Logic Repositories: ntia.its.bldrdoc.gov:/pub/fuzzy/ [132.163.64.201] contains information concerning fuzzy logic, including bibliographies (bib/), product descriptions and demo versions (com/), machine readable published papers (lit/), miscellaneous information, documents and reports (txt/), and programs, code and compilers (prog/). You may download new items into the new/ subdirectory. If you deposit anything in new/, please inform fuzzy@its.bldrdoc.gov. The repository is maintained by Timothy Butler, tim@its.bldrdoc.gov. The Fuzzy Logic Repository is also accessible through a mail server, rnalib@its.bldrdoc.gov. For help on using the server, send mail to the server with the following line in the body of the message: @@ help Other commands available include index, list, find, send, and credits. Togai InfraLogic, Inc. (TIL) also runs a fuzzy logic email server which contains demo versions of some of their software, fuzzy logic bibliographies, conference announcements, a short introduction to fuzzy logic, copies of the company newsletter, archives of comp.ai.fuzzy, and so on. See the entry in the answer to question [1-7] for more information on the company. To get started with the fuzzy logic email server, send a message with NO SUBJECT LINE to fuzzy-server@til.com, containing just the word "help" in the message body. The server will reply with a set of instructions. Please address any comments, questions or requests to either erik@til.com or tanaka@til.com. Most of the contents of the TIL server is mirrored at Tim Butler's fuzzy logic ftp repository at ntia.its.bldrdoc.gov and at Ostfold ftp repository at ftp.dhhalden.no. For more information, write to Togai InfraLogic, Inc., 5 Vanderbilt, Irvine, CA 92718 or call 714-975-8522. The Aptronix FuzzyNet files are available through an email server. Send email to fuzzynet@aptronix.com with "help" in the message body to get instructions on how to retrieve files. "catalog" or "index" will get you a listing of available files. (You can also connect to the FuzzyNet repository by modem to Aptronix FuzzyNet 408-428-1883 N/8/1 1200-19,200 baud.) Files on the server include descriptions of fuzzy logic applications (e.g., washing machines, camera focusing, air conditioning), introductory materials, Fide related information, archives of comp.ai.fuzzy, etc. If you'd like to have a file included in the FuzzyNet server (e.g., moderate length technical reports), send email to Scott Irwin . Genetic Algorithms: The Genetic Algorithms Repository is accessible by anonymous ftp as ftp.aic.nrl.navy.mil:/pub/galist/ There is also a WWW version at http://www.aic.nrl.navy.mil/galist/ The information files includes Nici Schraudolph's survey of free and commercial GA software (send email to to add to the list). The software includes GAC (a simple GA written in C), GAL (a simple GA written in Common Lisp), GAucsd, GECO (a Common Lisp toolbox for constructing genetic algorithms), GENESIS, GENOCOP, Paragenesis (a parallel version of GENESIS that runs on the CM-200), SGA-C (a C implementation/extension of Goldberg's SGA system). UC/Irvine (UCI) AI/Machine Learning Repository: ftp.ics.uci.edu has a variety of AI-related materials, with a special focus on machine learning. For example, ftp.ics.uci.edu:/pub/machine-learning-databases/ contains over 80 benchmark data sets for classifier systems (30mb). Files may also be retrieved by email using the archive server archive-server@ics.uci.edu. Commands to the server should be given in the message body. Some commands are: help send find The help command replies with a useful help message. Site Librarian: Patrick M. Murphy (ml-repository@ics.uci.edu) Off-Site Assistant: David W. Aha (aha@cs.jhu.edu) MLnet Machine Learning Archive MLnet Online Information Service In 1988 the Special Interest Group on Machine Learning of the German Society for Computer Science (GI e.V.) decided to establish a library of PROLOG implementations of Machine Learning algorithms. By 1994 the library had a sizable collection of GLPed PROLOG software. The site has grown, and now, according to the webpage it "offers a growing collection of ML information, datasets, software and pointers to other ML resources." The current (May 1999) homepage is at: http://www.gmd.de/ml-archive/frames/Welcome.html In the near future (June or July 1999) this site will be succeeded by the MLnet Online Information Service (MLnet OiS) at: http://www.mlnet.org Send your contributions to Mathias Kirsten (info@mlnet.org) at the GMD - German National Research Center, or use the contribution facilities within the MLnet OiS. Funic Neural Nets Archive Site: The Finnish University maintains an archive site containing a large collection of neural network papers and public domain software. The files are available through the web interface at http://www.nic.funet.fi/pub/sci/neural or through FTP from ftp://funic.funet.fi:/pub/sci/neural. FTP users: see the file 01README for details. There's also a directory for non-neural net AI stuff in the directory /pub/sci/ai. (Web service is still experimental as of 05/29/99). There is a list of mirrored ftp sites is in 04Neural_FTP_Sites. For further information, contact neural-adm@funic.funet.fi or Marko Gronroos (or ). OSU Neuroprose: archive.cis.ohio-state.edu:/pub/neuroprose/ [128.146.8.52] This directory contains technical reports, mostly from the early 90's, 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) NL Software Registry: [maintainer's note: links upto this point haven't been checked] 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, natural language generation systems, and knowledge representation systems. The second edition of the catalog contains more than 100 descriptions of natural language processing software. The catalogue is available from the German Research Institute for Artificial Intelligence (DFKI) in Saarbruecken (Germany) at the URL http://www.dfki.de/lt/registry The email contact for the site is lt-www@dfki.de Essex ROBOTS Archive: Contains robotics related information, hasn't been updated since 1995 or so: ftp.essex.ac.uk:/pub/robots/ Miscellaneous AI: Some miscellaneous AI programs may be found on ftp.uu.net:/pub/ai/ Most are mirrors of programs available at other sites. AI_ATTIC is an anonymous ftp collection of classic AI programs and other information maintained by the University of Texas at Austin. It includes Parry, Adventure, Shrdlu, Doctor, Eliza, Animals, Trek, Zork, Babbler, Jive, and some AI-related programming languages. This archive is available by anonymous ftp from ftp.cc.utexas.edu in the directory /pub/AI_ATTIC. For more information, contact atticmaster@bongo.cc.utexas.edu. The QWERTZ toolbox, a library of Standard ML modules with an emphasis on symbolic Artificial Intelligence programming, (including implementations of heuristic search and an ATMS reason maintenance system) may be obtained by anonymous ftp from ftp.gmd.de:/gmd/ai-research/Software/qwertz.tar.gz For more information, write to Tom Gordon . ---------------------------------------------------------------- Subject: [5-2a] WWW & FTP and Other Resources: Agents -- Planning In addition to programs available free by anonymous ftp, we've included some programs which are available by contacting the authors, and some programs which charge a nominal fee. Agent Modelling: ANIMALS is a simulation system written by Toby Tyrrell, , for his PhD thesis. The thesis examines the problem of action selection when dealing with realistic, animal-like situations: how to choose, at each moment in time, the most appropriate out of a repertoire of possible actions. It includes a description is given of a simulated environment which is an extensive and detailed simulation of the problem of action selection for animals. This simulated environment is used to investigate the adequacy of several theories of action selection (from both ethology and artificial intelligence) such as the drive model, Lorenz's psycho-hydraulic model and Maes' spreading activation network, and outlines deficiencies in each mechanism. Finally, it proposes a new approach to action selection is developed which determines the most appropriate action in a principled way, and which does not suffer from the inherent shortcomings found in other methods. The thesis includes a review and bibliography of existing work on action selection. The thesis is available by anonymous ftp from ftp.ed.ac.uk:/pub/lrtt/ [129.215.146.5] as the files as.1.ps.Z, as.2.ps.Z, ..., and as.7.ps.Z. The simulation software is also available from the same site, as the file se.tar.Z. The simulation software was written in Suntools rather than Xtools. It can be run only from SunView or OpenWindows. The action selection problem modelled by the simulated environment comprises 15 different `sub-problems' (getting food, reproducing, not getting lost, being vigilant for predators, etc), many internal and external stimuli, and 35 different low-level actions to select between. ViewGen (Viewpoint Generator) is a Prolog program that implements a "Belief Ascription Algorithm" as described in Ballim and Wilks (see the bibliography section on User Modelling). This can be seen as a form of agent modelling tool, which allows for the generation of arbitrarily deep nested belief spaces based on the system's own beliefs, and on beliefs that are typically held by groups of agents. ViewGen is available by anonymous ftp from crl.nmsu.edu:/pub/non-lexical/ViewFinder [128.123.1.18] (user anonymous) ftp.ims.uni-stuttgart.de:/pub/ballim [141.58.127.8] (user ftp) as the file ViewGen.tar.Z. The theory of belief ascription upon which it is based is described in detail in Ballim and Wilks, and a general framework for attributing and maintaining nested propositional attitudes is described in Afzal Ballim's dissertation which is archived with the Viewgen program (in the files ViewFinder-{A4/A5/US}.tar.Z, the variable part indicating the format of the PostScript file). The inheritance reasoner is in the file vf-hetis.tar.Z. Implemented in Sicstus prolog, and hence easily convertible to any Edinburgh-style prolog. Contact Afzal Ballim for more information. Analogical Reasoning: SME -- multivac.ils.nwu.edu:/pub/SME Contact: Brian Falkenhainer Ken Forbus the Structure-Mapping Engine, as described in Falkenhainer, Forbus, and Gentner's 1987 AIJ article. Artificial Life: Tierra is an artificial life system for studying the evolution of digital organisms. Tierra consists of a virtual computer and its operating system, whose architecture has been designed in such a way that the executable machine codes are evolvable. This means that the machine code can be mutated (by flipping bits at random) or recombined (by swapping segments of code between algorithms), and the resulting code remains functional enough of the time for natural (or presumably artificial) selection to be able to improve the code over time. Tierra runs on Unix, Win32, the Amiga and MS-DOS. Tierra's homepage is at: http://www.hip.atr.co.jp/~ray/tierra/tierra.html. The software can be downloaded from alife.santafe.edu:/pub/SOFTWARE/Tierra [192.12.12.130] To be added to the tierra-announce mailing list, send an email to Tom Ray (the author of Tierra as well as the list administrator) at ray@santafe.edu. Send bug reports or questions about the code or installation to tierra-bug@life.slhs.udel.edu. For those without access to anonymous ftp, the Tierra software may be obtained on disk for $50 ($20 for upgrades) from Virtual Life c/o Tom Ray, ATR HIP Labs, 2-2 Hikaridai Seika-cho Soraku-gun Kyoto 619-02 Japan. The software ships on PC formatted disks, but contains the source for all versions. Blackboard Architectures: GBB (PD Version) -- ftp.cs.umass.edu:/gbb/ Case-based Reasoning: CL-Protos -- ftp.cs.utexas.edu:/pub/porter/ (Get the README file for more information) Contact: Bruce W. Porter Ray Bareiss Erik Eilerts Dan Dvorak MICRO-xxx -- ftp.cs.umd.edu:/pub/schank/icbr/ Contact: waander@cs.umd.edu The directory /pub/schank/icbr/ contains the complete code for "Inside Case-Based Reasoning" by Riesbeck and Schank, 1989. This includes code for an instructional version of CHEF by Kristian Hammond. 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 runs on Apple Macintosh (Think C 5.0), Commodore Amiga (SAS C), MS-DOS, and Unix. It is available by anonymous ftp from raven.alaska.edu:/pub/coherent/sources32/ [137.229.10.39] in the chess.lm.com:/pub/chess/Unix/ as the compressed tar file SAN.tar.Z or SAN.tar.gz. Contact Steven J. Edwards for more information. Complex Systems: [Maintainer's note: none of the URLs below seem to be working. If you have any information about this, or new complex systems work please get in touch with the maintainers]. A list of resources for Complex Adaptive Systems is maintained by Alex Mallet, including information about chaos theory, genetic programming, artificial life, and neural networks. To get a copy by email, send a message to thesisnet-request@eniac.seas.upenn.edu with cplxsys in the subject line. A hypertext version is available by WWW from http://www.seas.upenn.edu/~ale/cplxsys.html Send corrections to Alex Mallet . Constraint Programming and Non-determinism: SCREAMER: Screamer is an extension of Common Lisp that adds support for nondeterministic programming. Screamer consists of two levels. The basic nondeterministic level adds support for backtracking and undoable side effects. On top of this nondeterministic substrate, Screamer provides a comprehensive constraint programming language in which one can formulate and solve mixed systems of numeric and symbolic constraints. Together, these two levels augment Common Lisp with practically all of the functionality of both Prolog and constraint logic programming languages such as CHiP and CLP(R). Furthermore, Screamer is fully integrated with Common Lisp. Screamer programs can coexist and interoperate with other extensions to Common Lisp such as CLOS, CLIM and Iterate. In several ways Screamer is more efficient than other implementations of backtracking languages. First, Screamer code is transformed into Common Lisp which can be compiled by the underlying Common Lisp system. Many competing implementations of nondeterministic Lisp are interpreters and thus are far less efficient than Screamer. Second, the backtracking primitives require fairly low overhead in Screamer. Finally, this overhead to support backtracking is only paid for those portions of the program which use the backtracking primitives. Deterministic portions of user programs pass through the Screamer to Common Lisp transformation unchanged. Since in practise, only small portions of typical programs utilize the backtracking primitives, Screamer can produce more efficient code than compilers for languages in which backtracking is more pervasive. Screamer is fairly portable across most Common Lisp implementations. It currently runs under Genera 8.1.1 and 8.3 on both Symbolics 36xx and Ivory machines, under Lucid 4.0.2 and 4.1 on Sun SPARC machines, under MCL 2.0 and 2.0p2 on Apple Macintosh machines, and under Poplog Common Lisp on Sun SPARC machines. It should run under any implementation of Common Lisp which is compliant with CLtL2 and with minor revision could be made to run under implementations compliant with CLtL1 or dpANS. Screamer is available by anonymous FTP from ftp.cis.upenn.edu:/pub/screamer.tar.Z Contact Jeffrey Mark Siskind or David McAllester for more information. The Screamer Tool Repository, a collection of user-contributed Screamer code, is available by anonymous ftp from ftp.cis.upenn.edu:/pub/screamer-tools/ or by WWW from http://www.cis.upenn.edu/~screamer-tools/home.html Please direct all inquires about the repository to screamer-repository@cis.upenn.edu. Data Mining and Knowledge Discovery in Databases: Explora is a data mining package written in Lisp for the Macintosh. It includes a natural language hypertext-type interface for presentation of dicoveries. It is available by anonymous FTP from ftp.gmd.de:/GMD/explora/ as the files Explora.sit.hqx and README. For more information, see http://orgwis.gmd.de:80/explora/ Defeasible Reasoning: An implementation of J. Paris and A. Vencovska's model of belief is available by anonymous ftp from ftp.cs.cmu.edu:/user/ai/areas/reasonng/defeasbl/belief/ Paris and Vencovska's paper (Artificial Intelligence, 64(2), December 1993) provides a mathematical model of an agent's belief in an event by identifying it with his ability to imagine the event within the context of his previous experience. This approach leads to beliefs having properties different from those normally ascribed to it. The implementation was written by Ian Pratt and Jens Doerpmund and runs in Common Lisp. Eliza and Similar Programs: [Maintainer's note: many sites below this point have not been checked]. For a large collection of Eliza programs, see ftp.cs.cmu.edu:/user/ai/areas/classics/ The software from Peter Norvig's book "Paradigms of AI Programming" is available by anonymous ftp from unix.sri.com:/pub/norvig/ and on disk in Macintosh or DOS format from the publisher, Morgan Kaufmann. The software includes Common Lisp implementations of: Eliza and pattern matchers, Emycin, Othello, Parsers, Scheme interpreters and compilers, Unification and a prolog interpreter and compiler, Waltz line-labelling, implementation of GPS, macsyma, and random number generators. For more information, write to Morgan Kaufmann, Dept. P1, 2929 Campus Drive, Suite 260, San Mateo CA 94403, call 800-745-7323, or fax 415-578-0672. (Mac ISBN 1-55860-227-5; DOS 3.5" ISBN 1-55860-228-3; or DOS 5.25" ISBN 1-55860-229-1). The doctor.el is an implementation of Eliza for GNU-Emacs emacs-lisp. Invoke it with "Meta-X doctor". muLISP-87 (a MSDOS Lisp sold by Soft Warehouse) includes a Lisp implementation of Eliza. Compute!'s Gazette, June 1984, includes source for a BASIC implementation of Eliza. You can also find it in 101 more computer games, edited by David Ahl, published by Creative Computing (alas, they're defunct, and the book is out of print). Herbert Schildt "Artificial Intelligence using C", McGraw-Hill, 1987, ISBN 0-07-881255-0, pp315-338, includes a simple version of DOCTOR. ucsd.edu:/pub/pc-ai contains implementations of Eliza for the IBM PC. eecs.nwu.edu:/pub/eliza/ contains several Eliza implementations. The original Parry (in MLISP for a PDP-10) is available in labrea.stanford.edu:/pub/parry.tar.Z. RACTER is *not* public domain. It costs $50 for MS-DOS and Macintosh versions, the Inrac compiler is $200 (MS-DOS only), and the Inrac manual alone is $25. Racter is available from John Owens, INRAC Corp./Nickers International Ltd., 12 Schubert Street, Staten Island, NY 10305, Tel: 718-448-6283, or Fax: 718-448-6298. Racter was published in 1984, and written in compiled BASIC. To read some of RACTER's work, see "The Policeman's Beard is Half Constructed", Computer Prose and Poetry by Racter, Warner Books, 1984. ISBN 0-446-38051-2 (paperback). Written by William Chamberlain and Thomas Etter. Some discussion of RACTER appears in A.K. Dewdney's book, "The Armchair Universe". The Macintosh version runs only on SEs and Pluses (it comes on a single-sided 400k copy-protected disk, with an old version of the system). Racter is also sold by the following mail-order software retailer: Mindware, 1803 Mission Street, Suite 414, Santa Cruz, CA 95060-5292, phone 800-447-0477 (408-427-9455), fax 408-429-5302. Mindware sells a variety of similar programs for MS-DOS and Windows, including Joseph Weintraub's PC Therapist. Expert Systems: Free ftpable expert system shells are listed in the Expert Systems Shells FAQ, which is available by anonymous ftp from ftp.cs.cmu.edu:/user/ai/pubs/faqs/ai/expert_1.faq Frame Systems: FrameWork -- ftp.cs.cmu.edu:/user/ai/areas/kr/frames/framework/ 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 PFC -- linc.cis.upenn.edu: ?? YAK -- Contact: Enrico Franconi Fuzzy Logic: FLIE -- ural.ethz.ch:/robo/flie/ [129.132.104.194] Contact: vestli@ifr.ethz.ch Fuzzy Logic Inference Engine, Institute of Robotics, ETH. RICE (Routines for Implementing C Expert systems) is a fuzzy/MV logic inference engine written in C. A C++ front-end with classes is provided. Tested with Borland C/C++ 3.1, Microsoft C/C++ 7.00 and GCC 2.4.5; examples are included. Documentation is available in WP 5.1 format and PostScript. Available by anonymous ftp from ntia.its.bldrdoc.gov and ftp.cs.cmu.edu. For more info contact Rene' Jager, . FuNeGen 1.0 is a fuzzy neural system capable of generating fuzzy classification systems (as C-code) from sample data. FuNeGen 1.0 and the papers/reports describing the application and the theoretical background can be obtained by anonymous ftp from obelix.microelectronic.e-technik.th-darmstadt.de:/pub/neurofuzzy/ Game Playing: METAGAME is a game-playing workbench for developing and playing metagame programs. It includes a generator for symmetric chess-like games; definitions of chess, checkers, chinese chess, shogi, lose chess, lose checkers, french checkers, and tic tac toe translated into symmetric chess-like games; a legal move generator; and a variety of player programs, from simple through sophisticated. The METAGAME Workbench runs in Quintus or Sictus Prolog. Available by anonymous ftp from ftp.cl.cam.ac.uk:/users/bdp/metagame3a.tar.Z [128.232.0.56] For more information, contact Barney Pell of the University of Cambridge Computer Laboratory. Genetic Algorithms: SCS (Simple Classifier System) is a C port of the system from Appendix D of "Genetic Algorithms in Search, Optimization, and Machine Learning" by David E. Goldberg. It was ported to C by Erik Mayer . For more information, contact the author. SCS-C is another port to C of Goldberg's Simple Classifier System. It includes some extensions, and runs on Sun 10/30 and Atari ST. SCS-C is available via anonymous ftp as scs-c-0.98j.tar.Z from lumpi.informatik.uni-dortmund.de:/pub/LCS/src/ [129.217.36.140]. The documentation alone is available as scs-c-doc.tar.Z in the directory /pub/LCS/docs/. For more information, contact Joerg Heitkoetter , c/o Systems Analysis Group, LSXI, Department of Computer Science, University of Dortmund, D-44221 Dortmund, Germany. GENITOR is available by anonymous ftp from the Colorado State University Computer Science Department in beethoven.cs.colostate.edu:/pub/GENITOR.tar [129.82.102.183] For further information, contact starkwea@cs.colostate.edu or mathiask@cs.colostate.edu. If these fail to work, contact whitley@cs.colostate.edu. Other packages are described in detail in Nici Schraudolph's survey of free and commercial GA software (see the Genetic Algorithms Repository in [5-1]). Some of the free ones from Nici's list are summarized below. Many are available from the GA Repository. GAucsd Genetic algorithms software cs.ucsd.edu:/pub/GAucsd/GAucsd14.ps.Z [132.239.51.3] Contact GAucsd-request@cs.ucsd.edu To be put on a mailing list of GAucsd users, send the message "add GAucsd" to listserv@cs.ucsd.edu. GAbench Genetic algorithms benchmarks and test problems cs.ucsd.edu:/pub/GAbench/ Thomas Kammeyer (tkammeye@cs.ucsd.edu) EM Evolution Machine (EM) ftp-bionik.fb10.tu-berlin.de:/pub/software/Evolution-Machine/ [130.149.192.50] em_tc.exe (EM for Turbo C) em_tcp.exe (EM for Turbo C++) em_man.exe (the manual) Joachim Born Genie GA-based modeling/forecasting system Lance Chambers GENOCOP GEnetic algorithm for Numerical Optimization for COnstrained Problems. Optimizes function with any number of linear constraints (equalities and inequalities) Genetic-2 Optimization package for the linear transportation problem. Genetic-2N Optimization package for the nonlinear transportation problem. All three were developed by Zbigniew Michalewicz and are described in detail in his book "Genetic Algorithms + Data Structures = Evolution Programs", Springer Verlag, August 1992. unccsun.uncc.edu:/coe/evol/ [152.15.10.88] (also known as ftp.uncc.edu) Zbigniew Michalewicz WOLF Simulator for G/SPLINES algorithm (genetic spline models) David Rogers GAC, GAL GA written in C/Lisp. Similar to John Grefenstette's Genesis. Bill Spears ESCaPaDE Experiments with evolutionary algorithsm. Frank Hoffmeister (Send mail with subject line "help" or "get ESCaPaDE") mGA1.0 Common Lisp implementation of a messy GA as described in TCGA report 90004. SGA-C C-language port and extension of the original Pascal SGA code presented in Goldberg's book "Genetic Algorithms in Search, Optimization & Machine Learning", Addison Wesley, 1989. See TCGA report 91002. SGA-Cube Goldberg's SGA code modified for nCUBE 2 hypercube parallel computer. All three are available by e-mail from Robert Elliott Smith . BUGS Demonstrates genetic algorithms. santafe.edu:/pub/misc/BUGS/ Joshua Smith SGPC Simple Genetic Programming in C sfi.santafe.edu:/pub/Users/tackett/ Walter Alden Tackett and Aviram Carmi (gpc@ipld01.hac.com) GENEsYs lumpi.informatik.uni-dortmund.de:/pub/GA/src/ [129.217.36.140] Use "ftp" as user name, e-mail address as password. Thomas Baeck GAGA Jon Crowcroft . cs.ucl.ac.uk:darpa/gaga.shar Splicer Steve Bayer PARAGENESIS GA-Repository/e-mail Michael van Lent GENESIS GA-Repository/e-mail John Grefenstette OOGA GA-Repository/e-mail John Grefenstette DGENESIS Erick Cantu or . PGA Parallel Genetic Algorithms testbed ftp.dai.ed.ac.uk:/pub/pga-2.4/pga-2.4.tar.Z (192.41.104.152) Peter Ross, peter@aisb.ed.ac.uk ANT PC Version of 'John Muir Trail' experiment. ftp.std.com:/pub/pbrennan Patrick M Brennan GPQUICK is a simple GP system implemented in C++. It features an elegant object architecture with function (Function), program (Chrome), GA (Pop) and problem (Problem) classes. The Problem class is proposed as a portable representation for problems that would be source compatible with a variety of other GP systems. GPQUICK uses a steady state GA, tournament selection, one type of mutation, and subtree crossover. It uses a fast, compact linear representation for S-expressions. It includes documentation from the associated magazine article (Byte, "Some Assembly Required", February 1994). GPQUICK is available by anonymous ftp from ftp.cc.utexas.edu:/pub/genetic-programming/code/ as the files gpquick.tar (unix version, tested with CC and g++) and gpquick.zip (PC/ANSI C version, tested with Borland 3.1). For more information, write to Andrew Singleton . GENlib is a library of functions for genetic algorithms together with two applications of the library to train neural networks. The library is available by anonymous ftp from ftp.neuro.informatik.uni-kassel.de:/pub/NeuralNets/GA-and-NN/ for academic research and educational purposes only. Commercial uses ________________________________________________________ --- [ comp.ai is moderated. To submit, just post and be patient, or if ] [ that fails mail your article to , and ] [ ask your news administrator to fix the problems with your system. ]