From: IN%"mkant+ai-faq@cs.cmu.edu" 13-AUG-1993 07:30:12.62 To: IN%"news-answers@cs.utexas.edu" CC: Subj: FAQ: Artificial Intelligence FTP Resources 4/6 [Monthly posting] Archive-name: ai-faq/part4 Last-Modified: Mon Jul 19 19:32:33 1993 by Mark Kantrowitz Version: 1.9 ;;; **************************************************************** ;;; Answers to Questions about Artificial Intelligence ************* ;;; **************************************************************** ;;; Written by Mark Kantrowitz ;;; ai-faq-4.text -- 63332 bytes If you think of questions that are appropriate for this FAQ, or would like to improve an answer, please send email to mkant+ai-faq@cs.cmu.edu. Please note that the FTP Resources are now split across parts 4 and 5 of the AI FAQ. Part 4 (FTP Resources): [4-0] General Information about FTP Resources for AI [4-1] FTP Repositories [4-2] FTP and Other Resources Search for [#] to get to question number # quickly. ---------------------------------------------------------------- Subject: [4-0] General Information about FTP Resources for AI Remember, when ftping compressed or compacted files (.Z, .z, .arc, .fit, etc.) to use binary mode for retrieving the files. Files that end with a .z suffix were compressed with the patent-free gzip (no relation to zip). Source for gzip is available from: prep.ai.mit.edu:pub/gnu/{gzip-1.2.3.shar,gzip-1.2.3.tar,gzip-1.2.3.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. 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: [4-1] FTP Repositories CMU AI Repository: Construction of the repository is taking longer than expected. (You don't realize how slow ftp is until you try ftping several hundred megabytes at a time.) We're about 90% done collecting materials, and are currently reorganizing the contents. It should become available within a week or two, the end of August at the latest. An announcement will be made to all relevant newsgroups and mailing lists when the repository is ready. Ada Repository: The Ada Repository on wsmr-simtel20.army.mil (mailing list ada-sw@wsmr-simtel20.army.mil) contains a directory of AI programs in PD2:*.*. A somewhat easier to access copy of the archives is available as wuarchive.wustl.edu:/mirrors/ada/ai. UCLA Artificial Life Depository: ftp.cognet.ucla.edu:~ftp/pub/alife [128.97.50.19] Repository of papers, articles, tech reports, software and other items of interest to Artificial Life researchers. It includes an archive of past postings to the alife mailing list, alife@cognet.ucla.edu (send mail to alife-request@cognet.ucla.edu to be added to the list). (Other artificial life information is available from santafe.edu or ftp.santafe.edu [192.12.12.1] in the directory pub/Artificial-Life-III.) Consortium for Lexical Research: clr.nmsu.edu [128.123.1.12] equivalently, lexical.nmsu.edu [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. See the file catalog-short for a quick listing of the contents of the archive. Long descriptions are in the info/ subdirectory. Publicly available materials are in the pub/ subdirectory (see pub/catalog). 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. FJ Repository: The FJ Repository contains freeware from Japan (FJ = "From Japan"). The fj.sources subdirectory is a good place to look for free software from Japan. Some files in the repository may contain Kana and Kanji characters. The repository is available by anonymous ftp from utsun.s.u-tokyo.ac.jp:fj/fj.sources [133.11.11.11] The file Index contains an index of all the files in each volume. Files of particular interest include: v07/786: Portable Prolog for Common Lisp v25/2577: General-Purpose Fuzzy Inference Library Ver. 3.0 (1/1) 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. Ostfold Regional College in Norway recently started a ftp site for material related to fuzzy logic, ftp.dhhalden.no:pub/Fuzzy/ [158.36.33.11]. Material to be included in the archive (e.g., papers and code) may be placed in the upload/ directory. Now holds the files from Togai's mail-server, and other files from Timothy Butler's site ntia.its.bldrdoc.gov. It also includes some demo programs. Send email to Asgeir Osterhus, . 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-8] 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 located at ftp.aic.nrl.navy.mil. It includes past copies of the genetic algorithms digest in /pub/galist/, a copy of Nici Schraudolph's survey of free and commercial GA software in /pub/galist/information/ga-software-survey.txt (send email to to add to the list), and some software, including 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). Genetic Programming: The Genetic Programming Repository is located at ftp.cc.utexas.edu:pub/genetic-programming/ [128.83.186.13]. It contains the archives of the genetic programming mailing list (including the GP FAQ posting), papers and source code. The source code includes the GP implementation from Koza's book and some related systems. UC/Irvine (UCI) AI/Machine Learning Repository: ics.uci.edu has a variety of AI-related materials, with a special focus on machine learning. The directory pub/machine-learning-databases contains over 80 benchmark data sets for classifier systems (30mb). 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) Machine Learning: Various programs (e.g., ID3) and publications related to machine learning are available by anonymous ftp from the machine learning group (under Raymond Mooney) at UT-Austin, at cs.utexas.edu:pub/mooney. Subdirectories include ml-course information and homeworks from a graduate course in machine learning taught by Dr. Mooney. Homeworks include "miniatures" of various machine learning systems written in Common Lisp. ml-code Common Lisp code corresponding to the assignments for the course in the ml-course directory. ml-progs More "research-level" versions of inductive classification algorithms and software for automated experiments that generation learning curves that compare several systems. papers Publications producted by the machine learning research group. Machine Learning Algorithms Implemented in Prolog: 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. The library includes - amongst others - PROLOG implementations of Winston's arch, Becker's AQ-PROLOG, Fisher's COBWEB, Brazdil's generation of discriminations from derivation trees, Quinlan's ID3, inverse resolution, and Mitchell's version spaces algorithm. The programs are currently available via anonymous ftp-server from the GMD: ftp.gmd.de:/gmd/mlt/ML-Program-Library [129.26.8.90] Send additional PROLOG implementations of Machine Learning Algorithms, complaints about them and detected bugs or problems to Thomas Hoppe, . Send suggestions and complaints about the ftp library to Werner Emde, Gesellschaft fuer Mathematik und Datenverarbeitung, Bonn, . CMU Simulator Collection: The CMU Simulator Collection is available by anonymous ftp from ftp.cs.cmu.edu [128.2.206.173] in the directory /afs/cs.cmu.edu/project/connect/code/ The collection includes Lisp and C implementations of Scott Fahlman's Cascade Correlation algorithm, Scott Fahlman's Quickprop variation on the back-propagation algorithm, and Scott Fahlman's Recurrent Cascade-Correlation simulator. The collection also includes Aspririn/Migraines and Tesauro. The neural network benchmark collection is available in /afs/cs.cmu.edu/project/connect/bench/ The data sets include the NETtalk data, a vowel recognition task, and several others. The archives of the connectionists mailing list are kept in /afs/cs.cmu.edu/project/connect/connect-archives/ along with a Lisp implementation of a backprop simulator. 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 anonymous ftp from funic.funet.fi:/pub/sci/neural [128.214.6.100]. (Also know as ftp.funet.fi, nic.funet.fi.) See the file 01README for details. 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 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) UKaiserslautern Neural/Fuzzy Repository: The University of Kaiserslautern has set up a ftp server for reports and software related to its neural networks and fuzzy logic projects, including the MOBOT, SPIN, and ALBATROSS projects. Programs currently available include Joerg Bruske's neural fuzzy decision system SPIN-NFDS and Herman Keuchel's unsupervised clustering system. Most of the ready-to-run programs were written for the Apple Macintosh. Sources for the "kernel" of the programs are available by ftp, written in Pascal. The user-interface code is also available upon request. Some of the documentation is in German. The papers and software are available from ag_vp_file_server.informatik.uni-kl.de in the directories Neural_Networks/Reports/ and Neural_Networks/Software/. Some papers and software are also available from ftp.uni-kl.de in the directory reports_uni-kl/computer_science/mobile_robots/. For further information, contact Uwe R. Zimmer . 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 from the German Research Institute for Artificial Intelligence (DFKI) in Saarbruecken (Germany) by anonymous ftp to ftp.dfki.uni-sb.de:registry/, email to registry@dfki.uni-sb.de, or physical mail to NL Software Registry, Deutsches Forschungszentrum fuer Kuenstliche Intelligenz, Stuhlsatzenhausweg 3, D-W-6600 Saarbruecken, Germany, or by telephone to +49 (681) 303-5282. 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 (bongo.cc.utexas.edu, 128.83.186.13) in the directory /pub/AI_ATTIC. For more information, contact atticmaster@bongo.cc.utexas.edu. ---------------------------------------------------------------- Subject: [4-2] FTP and Other Resources 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/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 runs in Unix and MS-DOS. Source code and documentation is available by anonymous ftp at tierra.slhs.udel.edu (128.175.41.34) and life.slhs.udel.edu (128.175.41.33) in the directories almond/, beagle/, doc/, and tierra/. To be added to either the tierra-announce (official announcements only) or tierra-digest (moderated discussion plus announcements) mailing lists, send mail to tierra-request@life.slhs.udel.edu. Send bug reports to tierra-bug@life.slhs.udel.edu. Blackboard Architectures: GBB (PD Version) -- dime.cs.umass.edu:/gbb GEST -- Contact: Susan Coryell Blackboard system. Runs on Symbolics and SUN. Georgia Tech's Generic Expert System Tool (GEST) Available to academic institutions for classroom use. Case-based Reasoning: CL-Protos -- cs.utexas.edu:/pub/porter Contact: Dan Dvorak Ray Bareiss Erik Eilerts Bruce W. Porter MICRO-xxx -- 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 valkyries.andrew.cmu.edu [128.2.232.4] in the directory pub/chess/misc as the compressed tar file SAN.tar.Z. Also at this site is the SCP package, a restructured ANSI C port of the 1987 Stanback Chess Program. Contact Steven J. Edwards, sje@xylos.ma30.bull.com for more information. 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.ai.mit.edu as the file /pub/screamer.tar.Z. Contact Jeffrey Mark Siskind for further information. Eliza and Similar Programs: 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". Source code for ELIZA in Prolog (implemented by Viren Patel) is available by ftp from aisun1.ai.uga.edu. 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. 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). Expert Systems: Free ftpable expert system shells are listed in [6-3]. Frame Systems: FrameWork -- ftp.cs.cmu.edu:user/ai/software/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 Contact: vestli@ifr.ethz.ch Fuzzy Logic Inference Engine, Institute of Robotics, ETH. 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 [128.232.0.56] in users/bdp/metagame.tar.Z. 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 [4-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] Nici Schraudolph 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 ICOT: Japan's Institute for New Generation Computer Technology (ICOT) has made their software available to the public free of charge. The collection includes a variety of prolog-based programs in symbol processing, knowledge representation, reasoning and problem solving, natural language processing. All programs are available by anonymous ftp from ftp.icot.or.jp. Note that most of the programs are written for the PSI machines, and very few have been ported to Unix-based emulators. For further information, send email to ifs@icot.or.jp, or write to ICOT Free Software Desk, Institute for New Generation Computer Technology, 21st Floor, Mita Kokusai Bldg., 4-28, Mita 1-chome, Minato-ku, Tokyo 108, Japan, fax +81-3-4456-1618. Knowledge Representation: KNOWBEL -- ai.toronto.edu:/pub/kr/{knowbel.tar.Z,manual.txt.tar.Z} Contact: Bryan M. Kramer, Telos temporal/sorted logic system. SB-ONE -- Contact: kobsa@inf-wiss.uni-konstanz.de KL-ONE family KRIS -- Contact: baader@dfki.uni-kl.de KL-ONE family (Symbolics only) BACK -- Contact: back@cs.tu-berlin.de KL-ONE family CLASSIC -- Contact: dlm@research.att.com KL-ONE family MOTEL -- Contact: hustadt@mpi-sb.mpg.de Modal KL-ONE (contains KRIS as a kernel). Implemented in Prolog. FOL GETFOL -- Contact: fausto@irst.it Weyrauch's FOL system SNePS -- Contact: shapiro@cs.buffalo.edu Semantic Nets COLAB/RELFUN -- Contact: boley@informatik.uni-kl.de Logic Programming COLAB/FORWARD -- Contact: hinkelma@dfki.uni-kl.de Logic Programming COLAB/CONTAX -- Contact: meyer@dfki.uni-kl.de Constraint System for Weighted Constraints over Hierarchically Structured Finite Domains. COLAB/TAXON -- Contact: hanschke@dfki.uni-kl.de Terminological Knowl. Rep. w/Concrete Domains Machine Learning: COBWEB/3 -- Contact: cobweb@ptolemy.arc.nasa.gov FOIL -- ftp.cs.su.oz.au:pub/{foil4.sh,foil5.sh} [129.78.8.208] Each shell archive contains source, a brief manual, and several sample datasets. FOIL2 should be available from sumex-aim.stanford.edu:/pub/FOIL.sh. RWM -- Contact: H. Altay Guvenir RWM is a program for learning problem solving strategies, written in Common Lisp (tested on Suns and NeXT). IND -- Contact: NASA COSMIC, Tel: 706-542-3265 (ask for customer support) Fax: 706-542-4807 IND is a C program for the creation and manipulation of decision trees from data, integrating the CART, ID3/C4.5, Buntine's smoothing and option trees, Wallace and Patrick's MML method, and Oliver and Wallace's MML decision graphs which extend the tree representation to graphs. Written by Wray Buntine, . Mathematics: SymbMath is a "symbolic calculator that can solve symbolic math problems" written by Weiguang Huang . It runs on IBM PCs (8086) under MS-DOS. Shareware versions are available by anonymous ftp from wsmr-simtel20.army.mil:/calculator/sm22a.zip or rana.cc.deakin.oz.au:/huang/sm22a.zip or by e-mail from listserv@vm1.nodak.edu (listserv@ndsuvm1.bitnet). Medical Reasoning: TMYCIN -- sumex-aix.stanford.edu:/tmycin Natural Language Processing: YACC -- ftp.cs.cmu.edu:user/ai/lang/lisp/lisp/parse/johnson-yacc.lisp Contact: Mark Johnson Lisp YACC/Parser. BABBLER -- Contact: rsf1@ra.msstate.edu Markov chains/NLP PENMAN -- Contact: hovy@isi.edu Natural Language Generation. PC-KIMMO -- msdos.archive.umich.edu:/msdos/linguistics/pckim105.zip An implementation of KIMMO morphological analyzer for the IBM PC. FUF -- Contact: elhadad@bengus.bgu.ac.il cs.columbia.edu: or ftp: black.bgu.ac.il:/pub/fuf/fuf5.2.tar.Z cs.columbia.edu:pub/fuf/fuf5.2.tar.Z Natural language generation system based on Functional Unification Grammars. Includes unifier, large grammar of English (surge) user manual and many examples. Written in Common Lisp. InterBASE -- Contact: Sergei Kuchin ftp: files interbas.exe, interba1.exe, interbas.txt on sics.se:/pub/packet-incoming ftp.uu.net:/tmp clr.nmsu.edu:/incoming debra.dgbt.doc.ca:/pub/incoming Natural language database front end RegEx -- csd4.csd.uwm.edu:/pub/regex/ Translates regular expressions to DFAs. Written in C. Mark Hopkins Tom -- csd4.csd.uwm.edu:/pub/regex/tomita/ C implementation of the Tomita parsing algorithm Mark Hopkins Common Lisp versions of the miniature natural language understanding programs from "Inside Computer Understanding" by Schank and Riesbeck, 1981, are available by anonymous ftp from cs.umd.edu in the directory pub/schank/icu. This includes the SAM and ELI miniatures. It will eventually include copies of the miniature versions of PAM, POLITICS, and Tale-Spin. The FOR macro is also available in this directory, as are a set of functions for manipulating and matching lisp representations of Conceptual Dependency formulas. Contact Bill Andersen for more information. 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. The Xerox part-of-speech tagger is available by anonymous ftp from parcftp.xerox.com:pub/tagger/tagger-1-0.tar.Z. It is implemented in Common Lisp and has been tested in Allegro CL 4.1, CMU CL 16e, and Macintosh CL 2.0p2. For more information, contact the authors, Doug Cutting , and Jan Pedersen . The Prolog and DCG programs from Pereira and Shieber's book, "Prolog and Natural Language Analysis", are available by anonymous ftp from das.harvard.edu:pub/shieber/pnla/. See the file README for the conditions under which the material is distributed. If you retrieve the files, please send an email message to the authors letting them know how you plan to use them. For further information, write to Fernando Pereira or Stuart Shieber . Neural Networks: 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 am6.tar.Z. They include many examples in the release, include an implementation of NETtalk. For more information, contact Russell Leighton . MUME (Multi-Module Neural Computing Environment) is a simulation environment for multi-modules neural computing. It provides an object oriented facility for the simulation and training of multiple nets with various architectures and learning algorithms. The object oriented structure makes simple the addition of new network classes and new learning algorithms. _ MUME includes a library of network architectures including feedforward, simple recurrent, and continuously running recurrent neural networks. Each architecture is supported by a variety of learning algorithms, including backprop, weight perturbation, node perturbation, and simulated annealing. MUME can be used for large scale neural network simulations as it provides support for learning in multi-net environments. It also provide pre- and post-processing facilities. MUME can be used to include non-neural computing modules (decision trees, etc.) in applications. _ MUME is being developed at the Machine Intelligence Group at Sydney University Electrical Engineering. The software is written in 'C' and is being used on Sun and DEC workstations. Efforts are underway to port it to the Fujitsu VP2200 vector processor using the VCC vectorising C compiler, HP 9000/700, SGI workstations, DEC Alphas, and PC DOS (with DJGCC). MUME is available to research institutions on a media/doc/postage cost arrangement after signing a license agreement. The license agreement is available by anonymous ftp from 129.78.13.39:/pub/license.ps. An overview of mume is available from the same machine as /pub/mume-overview.ps.Z. It is also available free for MSDOS by anonymous ftp from brutus.ee.su.oz.au:/pub/MUME-0.5-DOS.zip For further information, write to Marwan Jabri, SEDAL, Sydney University Electrical Engineering, NSW 2006 Australia, call +61-2-692-2240, fax +61-2-660-1228, or send email to Marwan Jabri . To be added to the mailing list, send email to mume-request@sedal.su.oz.au. Adaptive Logic Network (ALN) The atree adapative logic network simulation package is available by anonymous ftp from ftp.cs.ualberta.ca [129.128.4.241] in pub/atree/atree2.tar.Z (Unix). The MS-Windows 3.x version for the IBM PC is available as either pub/atree/atre27.exe (includes C/C++ sources) or pub/atree/a27exe.exe (just the executables). The PC version has a lot more documentation than the Unix version. The Unix version has been ported to the Macintosh, Amiga, and other machines. Documentation is in pub/atree/atree2.ps.Z. Also in this directory is a rather impressive OCR demo using atree. To be added to the mailing list, send email to alnl-request@cs.ualberta.ca. For more information, contact William W. Armstrong, . BPS Neural network simulator. Other files of interest. Executables are free; source code for a small fee. gmuvax2.gmu.edu:nn [no longer there?] NeuralShell Availible by anonymous ftp from quanta.eng.ohio-state.edu [128.146.35.1] in the directory pub/NeuralShell/ as the file NeuralShell.tar. CONDELA A neural network definition language. tut.cis.ohio-state.edu:/pub/condela ROCHESTER CONNECTIONIST SIMULATOR Available from cs.rochester.edu:pub/simulator [192.5.53.209]. Includes a backprop package and an X11/SunView interface. UCLA-SFINX retina.cs.ucla.edu:pub/sfinx_v2.0.tar.Z [131.179.16.6] Username sfinxftp, password joshua. Contact sfinx@retina.cs.ucla.edu for more information. XERION A neural network simulator from Drew van Camp at the University of Toronto. It provides a library of routines for building networks and graphically displaying them. Written in C and uses the X window system for graphics. Example simulators include Back Propagation, Recurrent Back Propagation, Boltzmann Machine, Mean Field Theory, Free Energy Manipulation, Kohonnen Net, and Hard and Soft Competitive Learning. Xerion runs on SGI Personal Iris, SGI 4d, Sun3 (SunOS), Sun4 (SunOS). Available by anonymous ftp from ai.toronto.edu:/pub/xerion. See the file /pub/xerion.README for more information. Also included is a little program called sciam that contains the basic kernel that was published in the September 1992 issue of Scientific American. To be added to the mailing list, send mail to xerion-request@ai.toronto.edu. Bugs should be reported to xerion-bugs@ai.toronto.edu. Complaints, suggestions or comments may be sent to xerion@ai.toronto.edu. SNNS (Stuttgart Neural Network Simulator) is a software simulator for neural networks on Unix workstations developed at the Institute for Parallel and Distributed High Performance Systems (IPVR) at the University of Stuttgart. The SNNS simulator contains a simultor kernel written in ANSI C and a 2D/3D graphical user interface running under X11R4/X11R5. It runs under Sun Sparc (SLC, ELC, SS2, GX, GS), DECstation (2100, 3100, 5000/200), IBM RS 6000, HP 9000, and IBM-PC (386/486). SNNS includes the following learning procedures: backpropagation (online, batch, with momentum and flat spot elimin., time delay), counterpropagation, quickprop, backpercolation 1, and generalized radial basis functions (RBF), RProp, recurrent ART1, ART2 and ARTMAP, Cascade Correlation and Recurrent Cascade Correlation, Dynamic LVQ, and Time delay networks (TDNN). (Elman networks and some other network paradigms have already been implemented but are scheduled for a later release.) The SNNS simulator can be obtained via anonymous ftp from ftp.informatik.uni-stuttgart.de:/pub/SNNS/SNNSv2.1.tar.Z [129.69.211.2]. The PostScript version of the user manual can be obtained as file SNNSv2.1.Manual.ps.Z. To be added to the mailing list, send a message to listserv@informatik.uni-stuttgart.de with "subscribe snns " in the message body. Submissions may be sent to snns@informatik.uni-stuttgart.de. For further information, contact Andreas Zell, . NEOCOGNITRON SIMULATOR The Neocognitron Simulator is written in C and is available by anonymous ftp from tamsun.tamu.edu:/pub/neocognitron.Z.tar [128.194.15.32] unix.hensa.ac.uk:/pub/uunet/pub/ai/neural/neocognitron.tar.Z [129.12.21.7] PLANET (aka SunNet) Simulator that runs under X Windows. Written by Yoshiro Miyata of Chukyo University, Japan. Available by anonymous ftp from tutserver.tut.ac.jp:pub/misc/PlaNet5.7.tar.Z [133.15.240.3] boulder.colorado.edu:pub/generic-sources/PlaNet5.7.tar.Z [128.138.240.1] Includes documentation. LVQ_PAK and SOM_PAK LVQ_PAK (Learning Vector Quantization) and SOM_PAK (Self-Organizing Maps) were written by the LVQ/SOM Programming Team of the Helsinki University of Technology, Laboratory of Computer and Information Science, Rakentajanaukio 2 C, SF-02150 Espoo, FINLAND. The PAKs run in Unix and MS-DOS systems. Available by anonymous ftp from cochlea.hut.fi [130.233.168.48] in the directories /pub/lvq_pak/ and /pub/som_pak/. MACTIVATION bruno.cs.colorado.edu:/pub/cs/misc/ [128.138.243.151] as the file Mactivation-3.3.sea.hqx. DartNet A Macintosh-based Neural Network Simulator with a nice graphical interface. Available by anonymous ftp from dartvax.dartmouth.edu:/pub/mac/dartnet.sit.hqx [129.170.16.4] or by email from bharucha@dartmouth.edu. New network architectures and learning algorithms can be added to the system by writing small XCMD-like CODE resources called nDEF's ("Network Definitions"). For more information, send email to Sean P. Nolan, . NevProp is a C implementation of general purpose backpropagation software, based on Quickprop 1.0 by Scott Fahlman, as translated from Common Lisp into C by Terry Regier. It runs on Unix, Macintosh, and DOS. The quickprop algorithm itself has not changed substantially, but it now includes options to force gradient descent (per-epoch or per-pattern), generalization & stopped training, c index, and interface enhancements. It is available by anonymous ftp from unssun.scs.unr.edu [134.197.10.128] pub/goodman/nevpropdir/ as the file npxxx.shar (replace xxx with the version number) or from the CMU Simulator Collection. For further information, contact Phil Goodman . TCS (Tasmanian Connectionist Simulator) is a neural network simulation package written in Borland C++ for Windows available by anonymous ftp from ftp.psychol.utas.edu.au:/pub/tcs [131.217.35.98] For further information, write to Zoltan Schreter Dept. Psychology University of Tasmania Hobart, Tasmania AUSTRALIA, . Probabilistic Reasoning: BELIEF -- ftp.stat.washington.edu (128.95.17.34) Contact: Russell Almond IDEAL -- Contact: srinivas@rpal.rockwell.com Bayesian networks Planning: NONLIN -- cs.umd.edu:/pub/nonlin (128.8.128.8) Contact: nonlin-users-request@cs.umd.edu nonlin-bugs@cs.umd.edu ABTWEAK -- jupiter.drev.dnd.ca:pub/steve/Abtweak Contact: Steven Woods RHETORICAL -- cs.rochester.edu:/pub/knowledge-tools Contact: Brad Miller SNLP -- cs.washington.edu:/pub/snlp.tar.Z Contact: weld@cs.washington.edu Nonlinear planner. IDM -- sauquoit.gsfc.nasa.gov (128.183.101.29) Contact: idm-users@chelmsford.gsfc.nasa.gov STRIPS-like planning. PRODIGY -- Contact: prodigy@cs.cmu.edu Integrated Planning and Learning System SOAR -- ftp.cs.cmu.edu: /afs/cs.cmu.edu/project/soar/public/Soar5/ -- Lisp Version /afs/cs.cmu.edu/project/soar/public/Soar6/ -- C Version Contact: soar-request@cs.cmu.edu Integrated Agent Architecture. Supports learning through chunking. MATS -- Contact: kautz@research.att.com Temporal constraints Qualitative Reasoning/Qualitative Physics: QSIM -- cs.utexas.edu:/pub/qsim Contact: Ben Kuipers QPE -- multivac.ils.nwu.edu:pub/QPE contact: Prof. Kenneth D. Forbus Qualitative Process Engine (an implementation of QP theory) Robotics (Planning Testbeds and Simulators): TILEWORLD -- cs.washington.edu:new-tileworld.tar.Z Planning testbed The ARS MAGNA abstract robot simular provides an abstract world in which a planner controls a mobile robot. This abstract world is more realistic than typical blocks worlds, in which micro-world simplifying assumptions do not hold. Experiments may be controlled by varying global world parameters, such as perceptual noise, as well as building specific environments in order to exercise particular planner features. The world is also extensible to allow new experimental designs that were not thought of originally. The simulator also includes a simple graphical user-interface which uses the CLX interface to the X window system. ARS MAGNA can be obtained by anonymous ftp from ftp.cs.yale.edu, as ars-magna.tar.Z in the pub/nisp directory. Installation instructions are in the file Installation.readme. The simulator is written in Nisp, a macro-package for Common Lisp. Nisp can be retrieved in the same way as the simulator. Version 1.0 of the ARS MAGNA simulator is documented in Yale Technical Report YALEU/DCS/RR #928, "ARS MAGNA: The Abstract Robot Simulator". This report is available in the distribution as a PostScript file. Comments should be directed to Sean Philip Engelson . Simderella is a robot simulator consisting of three programs: CONNEL (the controller), SIMMEL (the robot simulator), and BEMMEL (the X-windows oriented graphics back-end). SIMMEL performs a few matrix multiplications, based on the Denavit Hartenberg method, calculates velocities with the Newton-Euler scheme, and communicates with the other two programs. BEMMEL only displays the robot. CONNEL is the controller, which must be designed by the user (in the distributed version, CONNEL is a simple inverse kinematics routine.) The programs use Unix sockets for communication, so you must have sockets, but you can run the programs on different machines. The software is available by anonymous ftp from galba.mbfys.kun.nl:pub/neuro-software/pd/ [131.174.82.73] as the file simderella.1.0.tar.Z The software has been compiled using gcc on SunOS running under X11R4/5 on Sun3, Sun4, Sun Sparc 1, 2, and 10, and Silicon Graphics architectures. For more information, send email to Patrick van der Smagt, . The Michigan Intelligent Coordination Experiment (MICE) testbed is a tool for experimenting with coordination between intelligent systems under a variety of conditions. MICE simulates a two-dimensional grid-world in which agents may move, communicate, and affect their environment. MICE is essentially a discrete-event simulator that helps control the domain and a graphical representation, but provides relatively few constraints on the form of the domain and the agents' abilities. Users may specify the time required by various activities, the constraints on an agents' sensors, the configuration of the domain and its properties, etc. MICE runs under XWindows on Un*x boxes, on Macs, and on TI Explorers, with relatively consistent graphical displays. Source code, documentation, and examples are available via anonymous ftp to ftp.eecs.umich.edu:Mice/Mice.tar.Z. MICE was produced by the University of Michigan's Distributed Intelligent Agent Group (UM DIAG). For further information, write to umdiagmice@caen.engin.umich.edu. Simulated Annealing: VFSR (Very Fast Simulated Reannealing) is a powerful global optimization C-code algorithm especially useful for nonlinear and/or stochastic systems. Most current copies usually can be obtained by anonymous ftp from ftp.uu.net:tmp/vfsr.Z. Older versions can be found in the Netlib archive (research.att.com:opt/, logging in as netlib), the Statlib archive (lib.stat.cmu.edu, logging in as statlib), the UMIACS archive (ftp.umiacs.umd.edu:pub/ingber), and the UTSA archive (ringer.cs.utsa.edu:/pub/rosen). The authors have (p)reprints related to VFSR in their archives: Lester Ingber has a review article, sarev.ps.Z, in the UMIACS archive (and on uunet in /tmp), and Bruce Rosen has a comparison study, "Function Optimization based on Advanced Simulated Annealing", which is available in the UTSA archive as the file rosen.advsim.ps.Z. Copies of the code are also available by email from the author, Lester Ingber . Adaptive Simulated Annealing (ASA) is available by anonymous ftp from ftp.caltech.edu:pub/ingber [131.215.48.151]. Speech: RECNET is a complete speech recognition system for the DARPA TIMIT and Resource Management tasks. It uses recurrent networks to estimate phone probabilities and Markov models to find the most probable sequence of phones or words. The system is a snapshot of evolving research code. There is no documentation other than published research papers. It is configured for the two specific databases and is unlikely to be of use as a complete system for other tasks. It is available by anonymous ftp from svr-ftp.eng.cam.ac.uk:misc/recnet-1.3.tar.Z. Related publications can be found in svr-ftp.eng.cam.ac.uk:reports/ (see the ABSTRACT file first). You will need the relevant CDROMs, 150MByte of free space for TIMIT and 300MByte for RM. If you use the code, the author would appreciate an email message so that he can keep you informed of new releases. Write to Tony Robinson, , for more information. CELP 3.2a is available from super.org:/pub/celp_3.2a.tar.Z [192.31.192.1] with copies available on svr-ftp.eng.cam.ac.uk:comp.speech/sources/ The code (C, FORTRAN, diskio) all has been built and tested on a Sun4 under SunOS4.1.3. If you want to run it somewhere else, then you may have to do a bit of work. (A Solaris 2.x-compatible release is planned soon.) Written by Joe Campbell of the Department of Defense. Distribution facilitated by Craig F. Reese , IDA/Supercomputing Research Center. Theorem Proving/Automated Reasoning: Otter -- info.mcs.anl.gov:pub/Otter/Otter-2.2/otter22.tar.Z anagram.mcs.anl.gov:pub/Otter/ Contact: otter@mcs.anl.gov Resolution-based theorem prover. ATP Problems -- anagram.mcs.anl.gov:pub/ATP_Problems/* Collection of ATP problems from Otter, CADE, and JAR. The problems include algebra, analysis, circuits, geometry, logic problems, Pelletier's problem set, program verification, puzzles, set theory, and topology. SETHEO -- flop.informatik.tu-muenchen.de:pub/fki/ [131.159.8.35] Get the files setheo.info and setheo.tar.Z. SETHEO (SEquential THEOrem prover) is an automated theorem prover for formulae of predicate logic. SETHEO is based on the calculus of ``connection tableaux''. SETHEO runs on Sun SPARCs only. Contact: setheo@informatik.tu-muenchen.de Isabelle -- ftp.cl.cam.ac.uk:ml/ [128.232.0.56] ftp.informatik.tu-muenchen.de:lehrstuhl/nipkow/ [131.159.0.110] Relevant files include: intro.dvi.Z "Introduction to Isabelle" ref.dvi.Z "The Isabelle Reference Manual" logics.dvi.Z "Isabelle's Object-Logics" 92.tar.Z Isabelle-92 distribution directory Written in Standard ML, and comes with 8 different logics, including LCF, some modal logics, first-order logic, Zermelo-Fraenkel set theory, and higher-order logic. Contact: Larry.Paulson@cl.cam.ac.uk Tobias.Nipkow@informatik.tu-muenchen.de MVL -- t.stanford.edu:/mvl/mvl.tar.Z Contact: ginsberg@t.stanford.edu Multi-valued logics Boyer-Moore -- ftp.cli.com:pub/nqthm/nqthm.tar.Z rascal.ics.utexas.edu:/pub/nqthm 128.83.138.20 Contact: kaufmann@cli.com DTP -- meta.stanford.edu:/pub/dtp/ [36.8.0.54] Contact: Don Geddis Domain-independent search control of inference. Runs in Allegro and Lucid Common Lisp. RRL -- herky.cs.uiowa.edu:public/rrl [128.255.28.100] Rewrite Rule Laboratory FRAPPS (Framework for Resolution-based Automated Proof Procedures) is a portable resolution theorem-prover written in Common Lisp. It is available via anonymous ftp from a.cs.uiuc.edu:/pub/frapps [128.174.252.1]. If you take a copy of FRAPPS, please send a short note to Prof. Alan M. Frisch . XPNet (X Proof Net) is a graphical interface to proof nets with an efficient proof checker. It is available by anonymous ftp to ftp.cis.upenn.edu:/pub/xpnet.tar.Z [130.91.6.8]. For further information, write to Jawahar Chirimar , Carl A. Gunter , or Myra VanInwegen . Gazer is a sequent calculus based system for first order logic with a novel inference rule, gazing, that enables the system to determine which of a possibly large number of definitions and lemmas should be used at any point in a proof. Available from the authors, Dave Barker-Plummer and Alex Rothenberg . Truth Maintenance: The truth maintenance system and problem solver implementations described in the book "Building Problem Solvers" by Ken Forbus and Johan de Kleer are available by anonymous ftp from parcftp.xerox.com:/ftp/pub/bps/. For more information send mail to Johan de Kleer . Miscellaneous: University of Toronto: ftp -- ftp.cs.toronto.edu:/pub/ailist Archives of ailist mailing list, defunct as of January 19, 1990 PAIL (Portable AI Lab) ftp -- pobox.cscs.ch:/pub/ai/pail-2.2/ [148.187.10.13] contact: pail-info@idsia.ch authors: Mike Rosner Dean Allemang CD-ROMS: 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). The AI CD-ROM is an ISO-9660 format disk usable on any computer system, and contain a variety of public domain, shareware, and other software of special interest to the AI community. The disk contains source code, executable programs, demonstration versions of commercial programs, tutorials and other files for a variety of operating systems. Among the supported operating systems are MS-DOS, OS/2, Mac, Amiga, and Unix. Among the items included are CLIPS v5.1 and NETS, courtesy of COSMIC, the collected source code from AIExpert magazine from the premier issue in June of 1986 to the present, and complete transcriptions of the first annual Loebner Prize competition, which took place at the Boston Computer Museum. It also includes examples many different kinds of neural networks, genetic algorithms, artificial life simulators, natural language software, public domain and shareware compilers for a wide range of languages such as Lisp, Xlisp, Scheme, XScheme, Smalltalk, Prolog, ICON, SNOBOL, and many others. Complete collections of the Neural Digest, Genetic Algorithms Digest, and Vision List Digest are included. Network Cybernetics Corporation intends to release annual revisions to the AI CD-ROM to keep it up to date with current developments in the field. For more information, write to Network Cybernetics Corporation, 4201 Wingren Road, Suite 202, Irving, Texas 75062-2763, call 214-650-2002, fax 214-650-1929, or send email to ai-cdrom@ncc.com or steve.rainwater@ncc.com (Steve Rainwater). PTF is a semi-annual CD-ROM collection of UNIX-related freeware source code and documentation. PTF in no way modifies the legal restrictions on any package it includes. Each issue consists of two ISO-9660 CD-ROMs, bound into a 50+ page booklet. PTF is particularly useful for programmers who do not have FTP access, but may also be useful as a way of saving disk space and avoiding annoying FTP searches and retrievals. The current issue (2-1; January, 1993) includes, among other things, ICOT collection and several varieties of Lisp and other AI languages. It sells (list) for $60 US plus applicable sales tax and shipping and handling charges. SUG and USENIX members may purchase the issue for $50. Payable through Visa, Mastercard, postal money orders in US funds, and checks in US funds drawn on a US bank. For more information write to Prime Time Freeware, 370 Altair Way, Suite 150, Sunnyvale, CA 94086 call 408-433-9662, fax 408-432-6149, or send email to ptf@cfcl.com. ---------------------------------------------------------------- ;;; *EOF* Return-path: Received: from ccsun.unicamp.br by ccvax.unicamp.br (PMDF #2801 ) id <01H1OPK2K3DS8WWDNV@ccvax.unicamp.br>; Fri, 13 Aug 1993 05:51:59 BSC (-0300 C) Received: from dcc.unicamp.br by ccsun.unicamp.br (4.1/SMI-4.0) id AA07052; Fri, 13 Aug 93 05:47:34 BSC Received: from dcc.unicamp.br by dcc.unicamp.br (4.1/SMI-4.1) id AA04649; Fri, 13 Aug 93 05:42:58 EST Date: 13 Aug 1993 07:10:15 +0000 (GMT) From: mkant+@cs.cmu.edu (Mark Kantrowitz) Subject: FAQ: Artificial Intelligence FTP Resources 4/6 [Monthly posting] Sender: news@cs.cmu.edu (Usenet News System) To: news-answers@cs.utexas.edu Reply-to: mkant+ai-faq@cs.cmu.edu Message-id: Organization: School of Computer Science, Carnegie Mellon University X-Envelope-to: sabbatini Content-transfer-encoding: 7BIT Xref: dcc.unicamp.br comp.ai:8708 news.answers:5218 Newsgroups: comp.ai,news.answers,comp.answers Path: dcc.unicamp.br!agate!howland.reston.ans.net!noc.near.net!das-news.harvard.edu!cantaloupe.srv.cs.cmu.edu!crabapple.srv.cs.cmu.edu!mkant Followup-To: poster Summary: FTP Resources for AI Supersedes: Nntp-Posting-Host: a.gp.cs.cmu.edu Approved: news-answers-request@MIT.Edu Expires: Fri, 24 Sep 1993 07:09:35 GMT Lines: 1319