Subject: FAQ: Artificial Intelligence FTP Resources 6/6 [Monthly posting] Newsgroups: comp.ai,news.answers,comp.answers Summary: FTP Resources for AI Distribution: world Followup-To: poster Reply-To: mkant+ai-faq@cs.cmu.edu Organization: School of Computer Science, Carnegie Mellon University Approved: news-answers-request@MIT.Edu Archive-name: ai-faq/general/part6 Last-Modified: Thu Dec 21 20:57:43 1995 by Mark Kantrowitz Version: 1.31 Maintainer: Mark Kantrowitz URL: http://www.cs.cmu.edu/Web/Groups/AI/html/faqs/ai/ai_general/top.html Size: 84098 bytes, 1871 lines ;;; **************************************************************** ;;; Answers to Questions about Artificial Intelligence ************* ;;; **************************************************************** ;;; Written by Mark Kantrowitz ;;; ai_6.faq 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 5 and 6 of the AI FAQ. Note: Question [5-2] is split across parts 5 and 6. Part 6 (FTP Resources): [5-2b] FTP and Other Resources: Qualitative Reasoning -- Theorem Proving [6-1] AI Bibliographies available by FTP [6-2] AI Technical Reports available by FTP [6-3] Where can I get a machine readable dictionary, thesaurus, and other text corpora? [6-4] List of Smalltalk implementations. [6-5] AI-related CD-ROMs [6-6] World-Wide Web (WWW) Resources Search for [#] to get to question number # quickly. ---------------------------------------------------------------- Subject: [5-2b] FTP and Other Resources: Qualitative Reasoning -- Theorem Proving 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): See Steve Hanks, Martha E. Pollack, and Paul R. Cohen, "Benchmarks, Test Beds, Controlled Experimentation, and the Design of Agent Architectures", AI Magazine 14(4):17-42, Winter 1993. The ARS MAGNA abstract robot simulator 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:/pub/nisp as the file ars-magna.tar.Z. 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 . Erratic, a mobile robot simulator and controller by konolige@ai.sri.com is available by anonymous ftp from ftp.ai.sri.com:pub/konolige/erratic-ver1.tar.Z 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:/software/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. RSIM, a SGI-based simulator from the University of Melbourne, with very nice graphics, is available by anonymous ftp from krang.vis.citri.edu.au:/pub/robot Write to cdillon@vis.citri.edu.au for more information. 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.2.0.tar.gz. The software has been compiled using gcc on SunOS running under X11R4/5 on Sun3, Sun4, Sun Sparc 1, 2, and 10, DEC Alpha, HP700, 386/486 (Linux), and Silicon Graphics architectures. For more information, send email to Patrick van der Smagt, . TILEWORLD -- cs.washington.edu:/new-tileworld.tar.Z Planning testbed Search: AISEARCH is a C++ class library for search algorithms implemented by Peter Bouthoorn . It includes implementations of DFS, BFS, uniform cost, best-first, bidirectional DFS/BFS, and AND/OR DFS/BFS search algorithms. It is available by anonymous ftp from obelix.icce.rug.nl:/pub/peter/ as aisearch.zip or aisearch.tar.Z. Simulated Annealing: ASA (Adaptive Simulated Annealing) is a powerful global optimization C-code algorithm especially useful for nonlinear and/or stochastic systems. Most current copies can be obtained by anonymous ftp from ftp.alumni.caltech.edu:/pub/ingber/ASA.tar.gz [131.215.48.62] an uncompressed version, asa, also is in that archive. There are several related (p)reprints in the Caltech archive, including sa_pvt93.ps.Z, "Simulated annealing: Practice versus theory." The first VFSR code was developed by Lester Ingber in 1987, and the reprint of that paper is vfsr89.ps.Z, "Very fast simulated re-annealing". If you cannot use ftp or ftpmail, then copies of the code are also available by email from the author at ingber@alumni.caltech.edu. To be added to the mailing list, send mail to asa-request@alumni.caltech.edu. The VFSR code was made publicly available in 1992 under the GNU GPL, by Lester Ingber and Bruce Rosen. The last version of that code before the introduction of ASA is available via anonymous ftp from ringer.cs.utsa.edu:/pub/rosen/vfsr.tar.Z. Bruce Rosen has a comparison study, "Function Optimization based on Advanced Simulated Annealing," which is available via anonymous ftp from archive.cis.ohio-state.edu:/pub/neuroprose/rosen.advsim.ps.Z. [VFSR is no longer supported, but ASA is. --mk] 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. The OGI Speech Tools are set of speech data manipulation tools developed at the Center for Spoken Language Understanding (CSLU) at the Oregon Graduate Institute of Science and Technology (Portland Oregon). The tools can be used to compute and display signal representations, label speech at different levels (e.g., phonetic, phonemic and word), train neural network classifiers, and display the output of classification or recognition algorithms time-aligned with the speech. The OGI Speech Tools were written in ANSI C. The OGI Speech Tools are available by anonymous ftp from speech.cse.ogi.edu:/pub/tools/ as ogitools.v1.0.tar.Z. For more information, write to Johan Schalkwyk . If you're using the tools, please let Johan know by sending him a mail message. PC Convolution is a educational software package that graphically demonstrates the convolution operation. It runs on IBM PC compatibles using DOS 4.0 or later. A demo version is available by anonymous ftp from ee.umr.edu:/pub/ [131.151.4.11] as pc_conv.*. University instructors may obtain a free, fully operational version by contacting Dr. Kurt Kosbar at 117 Electrical Engineering Building, University of Missouri/Rolla, Rolla, Missouri, 65401, phone 314-341-4894. The LOTEC Speech Recognition Package is all you need to build a single-speaker, small-vocabulary, low-quality continuous speech recognition module, for use as part of a larger system. It accepts input in the form of Sun .au format sound files, along with a set of word templates in the same format, and outputs a lattice of word hypotheses. LOTEC is available by anonymous ftp from ftp.sanpo.t.u-tokyo.ac.jp:/pub/nigel/lotec/ [130.69.134.32] as the files lotec.tar.Z or lotec-no-bin.tar.Z. For more information, write to Nigel Ward . Temporal Reasoning: See also KNOWBEL above. MATS -- Metric/Allen Time System Contact: Henry Kautz MATS is a Common Lisp program which solves temporal constraint problems. Input constraints are either difference inequalities or Allen-style qualitative constraints. TMM -- New implementation of Dean & McDermott's Temporal Map Manager system written in Common Lisp. See SIGART Bulletin 4(3), July 1993. Contact: carciofi@src.honeywell.com MTMM -- Modified version of Dean & McDermott's TMM written in MCL. Available on diskette. Contact: Eckehard Gross TimeGraph-- Metric and Qualitative temporal reasoning system which handles (<, =, >) point relations, bounds on absolute calendar/clock times, and bounds on durations. Data entry and retrieval is through interval or point relations. The system is scalable in the sense that storage remains linear in the number of relations added. Efficient retrieval is achieved through a simple timepoint numbering scheme and metagraph structure. See SIGART Bulletin 4 (3), pp. 21-25, July 1993. Contact: Lenhart Schubert (schubert@cs.rochester.edu) TimeGraph II (TG-II) handles the set of the relations of the Point Algebra and of the Pointizable Interval Algebra (also called Simple Interval Algebra by P. van Beek). Temporal relations are represented through a "timegraph", a graph partitioned into a collection of "time chains" which are automatically structured for efficiency. The system is scalable, in the sense that the storage tends to remain linear in the number of relations asserted. Efficient query handling is achieved through a time point numbering scheme and a "metagraph" data structure. TG-II is written in Common Lisp. For a description of the theory underlying the system see: [1] Alfonso Gerevini and Lenhart Schubert, "Efficient Temporal Reasoning through Timegraphs", in Proceedings of IJCAI-93. [2] Alfonso Gerevini and Lenhart Schubert, "Temporal Reasoning in TimeGraph I-II", SIGART Bulletin 4(3), July 1993. [3] Alfonso Gerevini and Lenhart Schubert, "Efficient Algorithms for Qualitative Reasoning about Time", Artificial Intelligece, to appear. Also available as IRST Technical Report 9307-44, IRST 38050 Povo, TN Italy; or Tech. report 496, Computer Science Department, University of Rochester, Rochester 14627 NY, USA. TimeGraph II is available by anonymous ftp from ftp.cs.rochester.edu:/pub/packages/knowledge-tools/ as the files tg-ii.readme and tg-ii-1.tar.gz. If you retrieve a copy of TimeGraph II by anonymous ftp, please let them know that you've retrieved a copy by sending a message to bug-tg2-request@cs.rochester.edu For more information, contact Alfonso Gerevini or Lenhart Schubert . Tachyon -- Performs constraint satisfaction for point-based metric reasoning. Qualitative constraints are also handled by translation into quantitative ones. Written in C++. See SIGART Bulletin 4(3), July 1993. Contact: Richard Arthur (arthurr@crd.ge.com) TimeLogic-- The TimeLogic system is an interval-based forward chaining inference engine and database manager of temporal constraints. Relational constraints, indicating relative order between intervals, are based on Allen's interval logic. The TimeLogic system also supports durational constraints, indicating relative magnitude between intervals, and reference links, used for the explicit or automatic construction of interval hierarchies. Constraints are posed and propagated in user-defined contexts with inheritance. Supports relative metric constraints but no absolute dates or times. Written in Common Lisp. Contact: Peggy Meeker (timelogic-request@cs.rochester.edu) TemPro -- A temporal constraint system that uses both interval algebra and point-based algebra. Written in Common Lisp. Contact: J-P Haton or F. Charpillet TIE -- Temporal Inference Engine. Written in Common Lisp. Contact: E. Tsang (Essex University, UK) TCNM (Temporal Constraint Network Manager) manages non-disjunctive metric constraints on time-points and on durations in an integrated way. These constraints allow us express absolute, qualitative and metric constraints on time-points and on durations, which are managed in an integrated way. In the updating processes, a non-redundant and global consistent Temporal Constraint Network is always maintained by means of an efficient and complete propagation method, with a O(n**2) temporal complexity. Sound and complete retrieval processes have a constant cost. Written in Common Lisp. For more information, contact Federico A. Barber . See also SIGART Bulletin 4(3), July 1993. Theorem Proving/Automated Reasoning: Coq is the Calculus of Inductive Constructions. It runs in Caml-Light and is available by anonymous ftp from ftp.inria.fr:/INRIA/coq/V5.8.3 (unix version) ftp.inria.fr:/INRIA/coq/V5.8.2 (mac version) The Mac version is standalone, not requiring Caml-Light. The unix version requires Caml-Light, however, which is available from ftp.inria.fr:/lang/caml-light Documentation is included in the distribution. Questions and comments should be directed to the Coq hotline . DTP is a general first-order theorem prover incorporating intelligent backtracking and subgoal caching, as well as a trace facility that can display proof spaces graphically. Implemented in CLtL2 Common Lisp, it runs in Franz Allegro, Lucid, and Macintosh (MCL) Common Lisp. DTP is available on the Web at http://logic.stanford.edu/dtp/ Contact Don Geddis for more information. Elf implements the LF Logical Framework (based on the theory of dependent types) and gives it a logic programming interpretation in order to support search and the implementation of other algorithms (e.g. evaluation or compilation in programming languages). It comes with a number of examples from logic and the theory of programming languages such as the Church Rosser theorem for the untyped lambda-calculus and type soundness for Mini-ML. It is written in Standard ML and includes some support code for editing and interaction in gnu-emacs. It is available by anonymous ftp from ftp.cs.cmu.edu:/afs/cs/user/fp/public/ as the files README (general information), elf-04.tar.Z (Version 0.4 of Elf, 1 Jul 1993), elf-examples.tar.Z (Version 0.4 of Elf examples, unchanged from Version 0.3), and elf-papers/ (DVI files for papers related to LF and Elf, including a "tutorial" and a bibliography). For more information, contact Frank Pfenning , Department of Computer Science, Carnegie Mellon University. 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 . 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 . ISABELLE-93. Isabelle is a highly automated generic theorem prover written in Standard ML. New logics are introduced by specifying their syntax and rules of inference. Proof procedures can be expressed using tactics and tacticals. Isabelle comes with 8 different logics, including LCF, some modal logics, first-order logic, Zermelo-Fraenkel set theory, and higher-order logic. Isabelle-93 is not upwardly compatible with its predecessor, but comes with advice on converting to the new simplifier. Isabelle-93 is available by anonymous ftp from the University of Cambridge, ftp.cl.cam.ac.uk:/ml/ [128.232.0.56] as Isabelle93.tar.gz. It is also available from the Technical University of Munich, ftp.informatik.tu-muenchen.de:/lehrstuhl/nipkow/ [131.159.0.198] The distribution includes extensive documentation, including a 71-page introduction, an 85-page reference manual, and a 166-page description of the various logics supplied with Isabelle. For more information, write to Larry.Paulson@cl.cam.ac.uk and Tobias.Nipkow@informatik.tu-muenchen.de. An Emacs-Lisp package for Isabelle by David.Aspinall@dcs.ed.ac.uk is available from ftp.dcs.ed.ac.uk:/pub/da/isa-mode.tar.gz The users mailing list is isabelle-users@cl.cam.ac.uk and is moderated. KEIM is a collection of software modules, written in Common Lisp with CLOS, designed to be used in the production of theorem proving systems. KEIM is intended to be used by those who want to build or use deduction systems (such as resolution theorem provers) without having to write the entire framework. KEIM is also suitable for embedding a reasoning component into another Common Lisp program. KEIM offers a range of datatypes implementing a logical language of type theory (higher order logic), in which first order logic can be embedded. KEIM's datatypes and algorithms include: types; terms (symbols, applications, abstractions), environments (e.g., associating symbols with types); unification and substitutions; proofs, including resolution and natural deduction style. KEIM also provides functionality for the pretty-printing, error handling, formula parsing and user interface facilities which form a large part of any theorem prover. Implementing with KEIM thus allows the programmer to avoid a great deal of drudgery. KEIM has been tested in Allegro CL 4.1 and Lucid CL 4.0 on Sun 4 workstations. KEIM is available for noncommercial use via anonymous FTP from js-sfbsun.cs.uni-sb.de:/pub/keim/keim* For more information contact Dan Nesmith, Fachbereich Informatik/AG Siekmann, Universitaet des Saarlandes, Postfach 1150, D-66041 Saarbruecken, Germany, or send email to keim@cs.uni-sb.de. A mailing list for KEIM users is also being set up. Send mail to keim-users-request@cs.uni-sb.de to be put on the list. MVL -- t.uoregon.edu:/mvl/mvl.tar.Z [128.223.56.46] 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 See also the pub/proof-checker/ subdirectory, which contains Matt Kaufmann's proof checking enhancements to nqthm. Nqthm-1992 is the Boyer-Moore theorem prover. The 1992 version of the theorem prover is upwardly compatible with the previous (1987) version. Included in the distribution are thousands of Nqthm-checked theorems formulated by Bevier, Boyer, Brock, Bronstein, Cowles, Flatau, Hunt, Kaufmann, Kunen, Moore, Nagayama, Russinoff, Shankar, Talcott, Wilding, Yu, and others. The release of Nqthm-1992 includes three revised chapters of the book `A Computational Logic Handbook', including Chapter 4, on the formal logic for which the system is a prover, and Chapter 12, the reference guide to user commands. Nqthm runs in Common Lisp, and has been tested in AKCL, CMU CL, Allegro CL, Lucid CL, MCL, and Symbolics CL. Nqthm-1992 is available by anonymous ftp from ftp.cli.com:/pub/nqthm/nqthm-1992/ [192.31.85.129] as the file nqthm-1992.tar.Z. See the file README in the same directory for instructions on retrieving nqthm. See also the /pub/pc-nqthm/pc-nqthm-1992/ directory (files README-pc and pc-nqthm-1992.tar.Z), which contains Matt Kaufmann's interactive proof-checking enhancements to Nqthm-1992. For more information, contact Robert S. Boyer , J. Strother Moore , or Matt Kaufmann , Computational Logic Inc., 1717 West 6th Street, Suite 290, Austin, TX 78703-4776. Send mail to nqthm-users-request@cli.com to be added to the mailing list. The Nuprl Proof Development System is available by anonymous ftp from ftp.cs.cornell.edu:/pub/n/. Nuprl should run in any Common Lisp with CLX. There are also (obsolete) interfaces for Symbolics Lisp machines and Suns running the SunView window system. Nuprl has been tested with Allegro, Lucid, AKCL. For further information, contact Elizabeth Maxwell, , Nuprl Distribution Coordinator, Department of Computer Science, Upson Hall, Cornell University, Ithaca, NY 14853. 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. RRL -- herky.cs.uiowa.edu:/public/rrl [128.255.28.100] Rewrite Rule Laboratory See SEQUEL entry in the Lisp FAQ, part 6. 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 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 . Theorem Proving/Automated Reasoning (Problems): 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. The TPTP (Thousands of Problems for Theorem Provers) Problem Library is a collection of test problems for automated theorem provers (ATPs), using the clausal normal form of 1st order predicate logic. The goal of the TPTP is to provide a firm basis for the testing, evaluation, and comparison of ATP systems through a comprehensive library of ATP test problems in a general purpose format. The TPTP includes tools to convert the problems to existing ATP formats, such as the OTTER, MGTP, PTTP, SETHEO, and SPRFN formats. Each problem includes a list of references and other relevant information. The TPTP also aims to supply general guidelines outlining the requirements for ATP system evaluation. The TPTP can be obtained by anonymous ftp from either the Department of Computer Science, James Cook University, Australia, coral.cs.jcu.edu.au:/pub/research/tptp-library/ [137.219.17.4] or the Institut fuer Informatik, TU Muenchen, Germany, flop.informatik.tu-muenchen.de:/pub/tptp-library/ [131.159.8.35] as the files ReadMe (general information about the library), TPTP-v1.1.0.tar.gz (the library itself), and TR-v1.0.0.ps.gz (a postscript technical report about the TPTP). The TPTP is also accessible through WWW using either of the URLs ftp://coral.cs.jcu.edu.au/users/GSutcliffe/WWW/TPTP.HTML http://wwwjessen.informatik.tu-muenchen.de/~suttner/tptp.html Additions and corrections may be sent to Geoff Sutcliffe (Fax: +61-77-814029) or Christian Suttner (Fax: +49-89-526502). If you would like to be kept informed of new versions of the TPTP, please send email to either of them. 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 multivac.ils.nwu.edu:/pub/BPS/ parcftp.xerox.com:/pub/bps/ For more information send mail to Johan de Kleer . Send bug reports to bug-bps@ils.nwu.edu. 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/ [148.187.10.13] contact: pail-info@idsia.ch authors: Mike Rosner Dean Allemang ---------------------------------------------------------------- Subject: [6-1] AI Bibliographies available by FTP AI: The Computer Science Department at the University of Saarbruecken, Germany, maintains a large bibliographic database of articles pertaining to the field of Artificial Intelligence. Currently the database contains more than 25,000 references, which can be retrieved by electronic mail from the LIDO mailserver at lido@cs.uni-sb.de. Send a mail message with subject line "lidosearch help info" to get instructions on using the mail server. A variety of queries based on author names, title and year of publication are possible. The references can be provided in BibTeX or Refer formats. The entire bibliographic database can be obtained for a fee by ftp or on tape. Questions may be directed to bib-1@cs.uni-sb.de. A variety of AI-related bibliographies are available by anonymous ftp from nexus.yorku.ca:/pub/bibliographies/ Stanford University (SUMEX-AIM) has a large BibTeX bibliography of Artificial Intelligence papers and technical reports. Available by anonymous ftp from aim.stanford.edu:/pub/ai{1,2,3}.bib A large collection of BibTeX bibliographies (290,000+ references) on a variety of subjects, including artificial intelligence (29,402 entries), neural networks (8,111 entries), and object-oriented programming (3,493 entries), is available by anonymous ftp from ftp.ira.uka.de:/pub/bibliography/ [129.13.10.90] and in the mirror sites faui80.informatik.uni-erlangen.de:/pub/literatur/Mirror/bibliography/ ftp.cs.umanitoba.ca:/pub/bibliographies/ or by WWW from ftp://ftp.ira.uka.de/pub/bibliography/index.html http://www.ira.uka.de/ftp/ira/bibliography/index.html Some of the bibliographies prohibit commercial use. For more information, see the README file, or write to Alf-Christian Achilles or . Glimpse, a searchable interface to the UKA and other bibliographies, is accessible as http://glimpse.cs.arizona.edu:1994/bib/ Write to glimpse@cs.arizone.edu for more information. OFAI Library Bibliography, in Austria http://www.ai.univie.ac.at/biblio.html Fuzzy Logic: A BibTeX database of references addressing neuro-fuzzy issues can be obtained by anonymous ftp from ftp.tu-bs.de:/local/papers/ [134.169.34.15] as the (ascii) file fuzzy-nn.bib. Genetic Algorithms: A bibliography of over 400 Evolutionary Computation references (GA, ES, EP, GP) is available by anonymous ftp from magenta.me.fau.edu:/pub/ep-list/bib/ The file EC-ref.bib.Z is in BibTeX format; EC-ref.ps.Z is a postscript version of the bibliography. Please send additions and corrections to saravan@amber.me.fau.edu or EP-List@amber.me.fau.edu. Logic Programming, Constraints: A BibTeX bibliography for Constraint Logic Programming is available by anonymous ftp from archive.cis.ohio-state.edu:/pub/clp/ in the bib/ and papers/ subdirectories. NLP/CL: For information on a fairly complete bibliography of computational linguistics and natural language processing work from the 1980s, send mail to clbib@csli.stanford.edu with the subject HELP. The CSLI linguistics bibliography contains 3,300 entries in bib/tib/refer format. The bibliography is heavily slanted towards phonetics and phonology but also includes a fair amount of computational morphology, syntax, semantics, and psycholinguistics. The bibliography can be used with James Alexander's tib bibliography system, which is available from minos.inria.fr [128.93.39.5] among other places. The bibliography itself is available by anonymous ftp from csli.stanford.edu:/pub/bibliography/ Contributions are welcome, but should be in tib format. For more information, contact Andras Kornai NLG: Robert Dale's Natural Language Generation (NLG) bibliography is available by anonymous ftp from scott.cogsci.ed.ac.uk:/pub/nlg/ [129.215.144.3] Note that it is formatted for A4 paper. Stick in a line .94 .94 scale after the %! line to print on 8.5 x 11 paper. For further information, write to Robert Dale, University of Edinburgh, Centre for Cognitive Science, 2 Buccleuch Place, Edinburgh EH8 9LW Scotland, or or . Mark Kantrowitz's Natural Language Generation (NLG) bibliography is available by anonymous ftp from ftp.cs.cmu.edu:/user/ai/areas/nlp/nlg/bib/mk/ [128.2.206.173] In addition to the tech report, the BibTeX file containing the bibliography is also available. The bibliography contains more than 1,200 entries. A searchable index to the bibliography is available via the URL http://liinwww.ira.uka.de/bibliography/Ai/nlg.html Additions and corrections should be sent to mkant@cs.cmu.edu. Neural Nets, Learning: A bibliography of over 1000 entries about Self-Organizing Map (SOM) and Learning vector Quantization (LVQ) studies is available by anonymous ftp from cochlea.hut.fi:/pub/ref/ as the files references.bib.Z (BibTeX file) and references.ps.Z (PostScript file). Please send additions and corrections to biblio@cochlea.hut.fi. An extensive collection of references on Principal Component Analysis (PCA) neural networks and learning algorithms is available by anonymous ftp from dendrite.hut.fi:/pub/ref/ in LaTeX and PostScript formats. The list was compiled by Liu-Yue Wang, a graduate student of Erkki Oja, and updated by Juha Karhunen, all from Helsinki University of Technology, Finland. For more information, contact Erkki Oja . A bibliography of PCA algorithms is available by anonymous ftp from ftp.ai.mit.edu:/pub/sanger-papers/ as pca.bib. For more information, contact Terry Sanger . A 36-page bibliography of connectionist models with symbolic processing is available by anonymous ftp from Neuroprose archive.cis.ohio-state.edu:/pub/neuroprose/ [128.146.8.52] as the file sun.nn-sp-bib.ps.Z. For more information, contact Ron Sun . Nonmonotonic Logic, Belief Revision: A bibliography on belief revision and nonmonotonic logics with about 2,000 items is available by anonymous ftp from tarski.phil.indiana.edu:/pub/morado/ [129.79.134.34] as nonmono.bib or nonmono.bib.Z. The file is also available by WAIS as wais://tarski.phil.indiana.edu/nonmono.bib? and by gopher/WWW. Please send additions and corrections to Raymundo Morado . Speech: A bibliography of papers on Silicon Auditory Models (VLSI implementations of auditory representations) is available by anonymous ftp from hobiecat.pcmp.caltech.edu:/pub/anaprose/lazzaro/sa-biblio.ps.Z For more information, write to John Lazzaro ---------------------------------------------------------------- Subject: [6-2] Technical Reports available by FTP This section lists the anonymous ftp sites for technical reports from several universities and other organizations. Some of the sites provide only an online catalog of technical reports, while the rest make the actual reports available online. The email address listed is that of the appropriate person to contact with questions about ordering technical reports. When ftping compressed .Z files, remember to set the transfer type to binary first, using the command ftp> binary Other general locations for technical reports from several universities include: wuarchive.wustl.edu:/doc/techreports/ [128.252.135.4] cs-archive.uwaterloo.edu:/cs-archive/ (see Index for an index) AKA watdragon.uwaterloo.ca [129.97.140.24] The uwaterloo archive includes tech reports from the Logic Programming and Artificial Intelligence Group (LPAIG) of the University of Waterloo. There is also a WAIS server containing tech report abstracts that can be searched. To use, create the file ~/wais-sources/cs-techreport-abstracts.src containing (:source :version 3 :ip-address "130.194.74.201" :ip-name "daneel.rdt.monash.edu.au" :tcp-port 210 :database-name "cs-techreport-abstracts" :cost 0.00 :cost-unit :free :maintainer "wais@daneel.rdt.monash.edu.au") and invoke your local wais client. To add to it, email abstracts of your papers to wais@rdt.monash.edu.au in the following format: %TI Title %AU Author (use multiple %AU lines for multiple authors) %PU Published In (citation information) %AV Availability (e.g., ftp reports.adm.cs.cmu.edu:/1992/CMU-CS-92-101.ps) %OR Organization (see cs-techreport-archives.src for institution codes) %LT Local title (e.g., tech report number) %DA Date (and, if you want, %MN Month, %YR Year) %AB Abstract If your papers are not available by FTP, you can use a %AV line such as: %AV mail harry.bovik@cs.cmu.edu Further instructions are available from daneel.rdt.monash.edu.au:/pub/techreports/reports/README [Based on a post by Ashwin Ram.] Also see the Unified Computer Science Technical Report Index http://cs.indiana.edu/cstr/search A list of FTP sites for technical reports and papers can be found in http://www.rdt.monash.edu.au/tr/siteslist.html A list of more than 230 sites publishing CS tech reports may be obtained by anonymous ftp from ftp.rdt.monash.edu.au:/pub/techreports/sites/sites-list-data To receive notification of new tech report sites, send mail to compdoc-techreports-request@ftp.cse.ucsc.edu to join the mailing list. An archive of linguistics papers and preprints is available from linguistics.archive.umich.edu:/linguistics/papers/. Contact John Lawler (jlawler@umich.edu) or linguistics-archivist@umich.edu for more information. The Concurrent Engineering Research Center (CERC) at West Virginia University has placed ASCII versions of the concurrent engineering-related abstracts (over 500) that were on CERCnet, ASCII back issues of the Concurrent Engineering Research in Review journal (now discontinued), and Postscript copies of CERC technical reports in the gopher server gopher.cerc.wvu.edu. In addition, many of the CERC technical reports, including journal articles, symposium papers, theses, dissertations, and issues of the Concurrent Engineering Research in Review journal, are available as Postscript versions via anonymous ftp from babcock.cerc.wvu.edu:/pub/techReports/ [157.182.44.36] An index to all the reports, including some that are available only in hardcopy, is contained in the file "CERC-TR-INDEX". If you need additional information, contact Mary Carriger, CERC Office of Information Services, at carriger@cerc.wvu.edu. The newsgroup comp.doc.techreports is devoted to distributing lists of tech reports and their abstracts. MIT Artificial Intelligence Laboratory: ftp -- publications.ai.mit.edu:/ai-publications/ email -- publications@ai.mit.edu browse -- telnet reading-room.lcs.mit.edu A full catalog of MIT AI Lab technical reports (and a listing of recent updates) may be obtained from the above location, by writing to Publications, Room NE43-818, M.I.T. Artificial Intelligence Laboratory, 545 Technology Square, Cambridge, MA 02139, USA, or by calling 1-617-253-6773. The catalog lists the technical reports ("AI Memos") with a short abstract and their current prices. There is also a charge for shipping. Some recent tech reports (since 1991) are available in the ai-publications/ subdirectory; older technical reports are NOT available by ftp. A bibliography is in the bibliography/ directory. CMU School of Computer Science: ftp -- reports.adm.cs.cmu.edu email -- Technical.Reports@cs.cmu.edu CMU Software Engineering Institute: ftp -- ftp.sei.cmu.edu:/pub/documents email -- bjz@sei.cmu.edu Yale: ftp -- dept.cs.yale.edu:/pub/TR/ University of Washington CSE Tech Reports: ftp -- june.cs.washington.edu:/tr email -- tr-request@cs.washington.edu ================ AT&T Bell Laboratories: ftp -- netlib.att.com:/netlib/research/cstr/ bib.Z contains short bibliography, including all the technical reports contained in this directory. ftp -- research.att.com:/dist/ai Argonne National Laboratory: ftp -- anagram.mcs.anl.gov:/pub/tech_reports email -- wright@mcs.anl.gov Contains MCS Division preprints and technical memoranda, available as either .dvi or .ps files. For descriptions of the contents, see the subdirectory pub/tech_reports/abstracts; for the files themselves see the subdirectory pub/tech_reports/reports. Boston University: ftp -- cs.bu.edu:/techreports/ email -- techreports@cs.bu.edu Brown University: ftp -- wilma.cs.brown.edu:/techreports/ email -- techreports@cs.brown.edu Cambridge University: Speech, Vision & Robotics Group ftp -- svr-ftp.eng.cam.ac.uk:/reports/ Columbia University: ftp -- cs.columbia.edu:/pub/reports email -- tech-reports@cs.columbia.edu DEC Cambridge Research Lab: ftp -- crl.dec.com:/pub/DEC/CRL/abstracts/ crl.dec.com:/pub/DEC/CRL/tech-reports/ DEC Paris Research Lab: email -- doc-server@prl.dec.com Put commands in Subject: line of the message. To get a list of articles, use send index articles To get a list of tech reports, use send index reports DEC WRL: email -- wrl-techreports@decwrl.dec.com To get a helpfile, send a message with help in the subject line. DFKI: ftp -- duck.dfki.uni-sb.de:/pub/papers email -- Martin Henz (henz@dfki.uni-sb.de) Duke University: ftp -- cs.duke.edu:/dist/papers/ cs.duke.edu:/dist/theses/ email -- techreport@cs.duke.edu [unknown user, 7/7/93] Edinburgh: A list of available reports can be sent via email. Send requests for information about reports from the Center for Cognitive Science to cogsci%ed.ac.uk@nsfnet-relay.ac.uk, and from the Human Communication Research Center to HCRC%ed.ac.uk@nsfnet-relay.ac.uk. Electrotechnical Laboratory, Japan: Reports from the Cooperative Architecture project (half AI, half software engineering). ftp -- etlport.etl.go.jp:/pub/kyocho/Papers [192.31.197.99] See file Index.English. email -- Hideyuki Nakashima . Georgia Tech College of Computing, AI Group: ftp -- ftp.cc.gatech.edu:/pub/ai (130.207.3.245) email -- Professor Ashwin Ram HCRC (Human Communication Research Centre): ftp -- scott.cogsci.ed.ac.uk:/pub/HCRC-papers/ mail -- Fiona-Anne Malcolm Human Communication Research Centre 2 Buccleuch Place, Edinburgh, UK Illinois: email -- Erna Amerman Illinois Genetic Algorithms Laboratory (IlliGAL): email -- Eric Thompson phone -- 217-333-2346 (9AM to 5PM CT, M-F) mail -- Illinois Genetic Algorithms Laboratory Department of General Engineering 117 Transportation Building 104 South Mathews Avenue Urbana, IL 61801-2996 ftp -- gal4.ge.uiuc.edu:/pub/papers/IlliGALs/ Includes the GA bibliography and the Messy GA code in C (in /pub/src/) and preprints (in /pub/papers/Publications) www -- http://gal4.ge.uiuc.edu/illigal.home.html Indiana: ftp -- cogsci.indiana.edu:/pub [129.79.238.12] ftp -- ftp.cs.indiana.edu:/pub/techreports [129.79.254.191] INRIA, France: ftp -- ftp.inria.fr:/INRIA/publication/ Institute for Learning Sciences at Northwestern University: ftp -- aristotle.ils.nwu.edu:/pub/papers/ phone -- 708-491-3500 Mechanized Reasoning Group (MRG): ftp -- ftp.mrg.dist.unige.it:/pub/mrg-ftp email -- Fausto Giunchiglia Mechanized Reasoning Group, IRST 38050 Povo Trento, Italy Tel: +39 461-314444 (secr.) +39 461-314436 (office) Fax: +39 461-302040 / 314591 National University of Singapore: ftp -- ftp.nus.sg:/pub/NUS/ISCS/techreports New York University (NYU): ftp -- cs.nyu.edu:/pub/tech-reports OGI: ftp -- cse.ogi.edu:/pub/tech-reports email -- csedept@cse.ogi.edu Ohio State University, Laboratory for AI Research ftp -- nervous.cis.ohio-state.edu:/pub/papers email -- lair-librarian@cis.ohio-state.edu OSU Neuroprose: ftp -- archive.cis.ohio-state.edu:/pub/neuroprose (128.146.8.52) This directory contains technical reports as a public service to the connectionist and neural network scientific community which has an organized mailing list (for info: connectionists-request@cs.cmu.edu) Includes several bibliographies. Stanford: ftp -- elib.stanford.edu:/cs Very spotty collection. SRI: email -- Donna O'Neal, donna@ai.sri.com SUNY Buffalo: ftp -- ftp.cs.buffalo.edu:/pub/tech-reports/ SUNY at Stony Brook: ftp -- sbcs.sunysb.edu:/pub/TechReports email -- rick@cs.sunysb.edu or stark@cs.sunysb.edu The /pub/sunysb directory contains the SB-Prolog implementation of the Prolog language. Contact warren@sbcs.sunysb.edu for more information. TCGA (The Clearinghouse for Genetic Algorithms): email -- Robert Elliott Smith Department of Engineering of Mechanics Room 210 Hardaway Hall The University of Alabama PO Box 870278 Tuscaloosa, AL 35487 205-348-1618, fax 205-348-6419 Thinking Machines: ftp -- ftp.think.com:/think/techreport.list This file contains a list of Thinking Machines technical reports. Orders may be placed by email (limit 5) to t-rex@think.com, or by US Mail to Thinking Machines Corporation, Attn: Technical reports, 245 First Street, Cambridge, MA 01241. In addition, the directories cm/starlisp and cm/starlogo contain code for the *Lisp and *Logo simulators. Tulane University: ftp -- rex.cs.tulane.edu:/pub/tech/ [129.81.132.1] University of Alabama: ftp -- aramis.cs.ua.edu:/pub/tech-reports/ University of Arizona: ftp -- cs.arizona.edu:/reports/ email -- tr_libr@cs.arizona.edu The directory /japan/kahaner.reports contains reports on AI in Japan, among other things, written by Dr. David Kahaner, a numerical analyst on sabbatical to the Office of Naval Research-Asia (ONR Asia) in Tokyo from NIST. The reports are not written in any sort of official capacity, but are quite interesting. University of California/Santa Cruz: ftp -- ftp.cse.ucsc.edu:/pub/bib/ ftp.cse.ucsc.edu:/pub/tr/ email -- jean@cs.ucsc.edu University of Cambridge Computer Lab: email -- tech-reports@cl.cam.ac.uk University of Colorado: ftp -- ftp.cs.colorado.edu:/pub/cs/techreports University of Florida: ftp -- bikini.cis.ufl.edu:/cis/tech-reports University of Genoa, Mechanized Reasoning Group: ftp -- ftp.mrg.dist.unige.it:/pub/mrg-ftp/ email -- Fausto Giunchiglia University of Georgia: ftp -- ai.uga.edu:/pub/ai.reports/ University of Illinois at Urbana: ftp -- a.cs.uiuc.edu:/pub/dcs email -- e-amerman@a.cs.uiuc.edu University of Indiana, Center for Research on Concepts and Cognition: ftp -- cogsci.indiana.edu:/pub/ email -- helga@cogsci.indiana.edu University of Kaiserslautern, Germany: ftp -- ftp.uni-kl.de:/reports_uni-kl/computer_science/ University of Kentucky: ftp -- ftp.ms.uky.edu:/pub/tech-reports/UK/cs/ University of Massachusetts at Amherst: email -- techrept@cs.umass.edu University of Melbourne, Australia, Computer Vision and Pattern Recognition Laboratory (CVPRL): ftp -- krang.vis.mu.oz.au:/pub/articles University of Michigan: ftp -- ftp.eecs.umich.edu:/techreports University of North Carolina: ftp -- ftp.cs.unc.edu:/pub/technical-reports/ University of Pennsylvania: ftp -- ftp.cis.upenn.edu:/pub/papers/ email -- publications@upenn.edu [email bounced 7/7/93] USC/Information Sciences Institute: email -- Sheila Coyazo is the contact. [email bounced 7/7/93] University of Toronto: ftp -- ftp.cs.toronto.edu:/pub/cogrob/ (Cognitive Robotics) ftp.cs.toronto.edu:/pub/reports/ email -- tech-reports@cs.toronto.edu University of Virginia: ftp -- uvacs.cs.virginia.edu:/pub/techreports/cs University of Western Australia: ftp -- ciips.ee.uwa.edu.au Centre for Intelligent Information Processing Systems (CIIPS) EE Engineering Department University of Wisconsin: ftp -- ftp.cs.wisc.edu:/tech-reports ftp.cs.wisc.edu:/machine-learning ftp.cs.wisc.edu:/computer-vision email -- tech-reports-archive@cs.wisc.edu Some AI authors have set up repositories of their own papers: Matthew Ginsberg: t.stanford.edu:/u/ftp/papers ---------------------------------------------------------------- Subject: [6-3] Where can I get a machine readable dictionary, thesaurus, and other text corpora? Free: /usr/dict/words Roget's 1911 Thesaurus is available by anonymous FTP from the Consortium for Lexical Research clr.nmsu.edu:/CLR/lexica/roget-1911 [128.123.1.12] It is also available from src.doc.ic.ac.uk:/literary/collections/project_gutenberg/roget11.txt.Z An old Webster's dictionary is in /text/dict/{DICT.Z,DICT.INDEX.Z}. Project Gutenberg also has Roget's 1911 Thesaurus. The Project Gutenberg archive is at mrcnext.cso.uiuc.edu:/pub/etext/. The Project Gutenberg archive collects public domain electronic books. For more information, write to Michael S. Hart, Professor of Electronic Text, Executive Director of Project Gutenberg Etext, Illinois Benedictine College, 5700 College Road, Lisle, IL 60532 or send email to hart@vmd.cso.uiuc.edu. For people without FTP, Austin Code Works sells floppy disks containing Roget's 1911 Thesaurus for $40.00. This money helps support the production of other useful texts, such as the 1913 Webster's dictionary. The Online Book Initiative maintains a text repository on ftp.std.com (a public access UNIX system, 617-739-WRLD). See the README file on obi.std.com:/obi/. For more information, send email to obi@world.std.com, write to Software Tool & Die, 1330 Beacon Street, Brookline, MA 02146, or call 617-739-0202. The CHILDES project at Carnegie Mellon University has a lot of data of children speaking to adults, as well as the adult written and adult spoken corpora from the CORNELL project. Contact Brian MacWhinney for more information. The Association for Computational Linguistics (ACL) has a Data Collection Initiative. For more information, contact Donald Walker at Bellcore, walker@flash.bellcore.com. Two lists of common female first names (4967 names) and male first names (2924 names) are available for anonymous ftp from ftp.cs.cmu.edu:/user/ai/areas/nlp/corpora/names/ Read the file README first. Send mail to mkant@cs.cmu.edu for more information. A list of 110,000 English words (one per line, in ASCII) is available in the PD1: directory on SIMTEL20 as the files WORDS1.ZIP, WORDS2.ZIP, WORDS3.ZIP, and WORDS4.ZIP. Although the list is in MS-DOS files, it can easily be used on other machines (but first you'll have to unzip the files on a DOS machine). The list includes inflected forms of the words, such as plural nouns and the -s, -ed, and -ing forms of verbs; thus the number of lexical stems in the list is considerably smaller than the total number of word forms. These files are available via FTP from WSMR-SIMTEL20.ARMY.MIL [192.88.110.20]. SIMTEL20 files are mirrored on wuarchive.wustl.edu. The Collins English Dictionary encoded as a Prolog fact base is available from the Oxford Text Archive by anonymous ftp from ota.ox.ac.uk:/pub/ota/dicts/1192/ [129.67.1.165] The Oxford Text Archive includes many other texts, dictionaries, thesauri, word lists, and so on, most of which are available for scholarly use and research only. See the files ota.ox.ac.uk:/pub/ota/textarchive.form ota.ox.ac.uk:/pub/ota/textarchive.info ota.ox.ac.uk:/pub/ota/textarchive.list ota.ox.ac.uk:/pub/ota/textarchive.sgml for more information, or write to archive@ox.ac.uk, Oxford Text Archive, Oxford University Computing Services, 13 Banbury Road, Oxford OX2 6NN, UK, call 44-865-273238 or fax 44-865-273275. Chuck Wooters has extracted the most likely pronunciation for each of about 6100 words in the hand-labeled TIMIT database, and made them available by anonymous ftp from ftp.icsi.berkeley.edu:/pub/speech/TIMIT.mostlikely.Z. A list of homophones from general American English is available by anonymous ftp from svr-ftp.eng.cam.ac.uk:/comp.speech/data/ as the file homophones-1.01.txt. To receive the list by email, send mail to Evan.Antworth@sil.org. The list was compiled by Tony Robinson. Sigurd P. Crossland has been compiling a dictionary of English words, including most common American words, abbreviations, hyphenations, and even incorrect spellings. The most recent version is available by anonymous ftp from wocket.vantage.gte.com:/pub/standard_dictionary/dic-0394.tar.gz The tar file includes 31 text files, one for each word-length from 2 to 32. The compressed tar file takes up just over 4mb of space, and includes approximately 870,000 words. WordNet is an English lexical reference system based on current psycholinguistic theories of human lexical memory. It organizes nouns, verbs and adjectives into synonym sets corresponding to lexical concepts. The sets are linked by a variety of relations. Besides being of scientific interest, it makes a handy thesaurus. WordNet is available by anonymous ftp from clarity.princeton.edu:/pub/ If you retrieve a copy of wordnet by ftp, please send mail to wordnet@princeton.edu. Commercial: Illumind publishes the Moby Thesaurus (25,000 roots/1.2 million synonyms), Moby Words (560,000 entries), Moby Hyphenator (155,000 entries), and the Moby Part-of-Speech (214,000 entries), Moby Pronunciator (167,000 entries with IPA encoding, syllabification, and primary, secondary, and tertiary stress marks) and Moby Language (100,000 word word lists in five major world languages) lexical databases. All databases are supplied in pure ASCII, royalty-free, in both Macintosh and MS-DOS disk formats (also in .Z file formats). Both commercial (to resell derived structures as part of commercial applications) and educational/research licenses are available. Samples of each of the lexical databases are available by anonymous ftp from netcom.com:/pub/grady/Moby_Sampler.tar.Z [192.100.81.100]. For more information, write to Illumind, Attn: Grady Ward, 3449 Martha Court, Arcata, CA 95521, call/fax 707-826-7715, or send email to grady@netcom.com. The Oxford Text Archive has hundreds of online texts in a wide variety of languages, including a few dictionaries (the OED, Collins, etc.). The Lancaster-Oslo-Bergen (LOB), Brown, and London-Lund corpii are also available from them. For more information, write to Oxford Electronic Publishing, Oxford University Press, 200 Madison Avenue, New York, NY 10016, call 212-889-0206, or send mail to archive@vax.oxford.ac.uk. (Their contact information in England is Oxford Text Archive, Oxford University Computing Service, 13 Banbury Road, Oxford OX2 6NN, UK, +44 (865) 273238.) Mailing Lists: CORPORA is a mailing list for Text Corpora. It welcomes information and questions about text corpora such as availability, aspects of compiling and using corpora, software, tagging, parsing, and bibliography. To be added to the list, send a message to corpora-request@x400.hd.uib.no. Contributions should be sent to corpora@x400.hd.uib.no. Linguistic Data Consortium: The Linguistic Data Consortium was established to broaden the collection and distribution of speech and natural language data bases for the purposes of research and technology development in automatic speech recognition, natural language processing, and other areas where large amounts of linguistic data are needed. Information about the LDC is available by anonymous ftp from ftp.cis.upenn.edu:/pub/ldc [130.91.6.8]. Documents available in this directory include a paper on the background, rationale and goals of the LDC, a brief list of available data bases, and some tables summarizing these corpora. For further information, contact Elizabeth Hodas, , Mark Liberman , or Jack Godfrey . ---------------------------------------------------------------- Subject: [6-4] List of Smalltalk implementations. Little Smalltalk -- Tim Budd's version of Smalltalk cs.orst.edu:/pub/budd/small.v3.tar GNU Smalltalk prep.ai.mit.edu:/pub/gnu/smalltalk-1.1.1.tar.Z ---------------------------------------------------------------- Subject: [6-5] AI-related CD-ROMs Prime Time Freeware for AI: Prime Time Freeware for AI is an annual CD-ROM collection of Artificial Intelligence freeware source code and documentation. Prime Time Freeware for AI in no way modifies the legal restrictions on any package it includes. Each issue consists of two ISO-9660 CD-ROMs, bound into a 224 page book. The current issue (1-1; July 1994) includes a selection of the contents of the CMU AI Repository (see [5-1]), including most of the AI Programming Languages section and most of the AI Software Packages section. Thus the CD-ROMs contain nearly every free implementation of Lisp, Prolog, Scheme, and Smalltalk, including graphical user interfaces, object-oriented programming extensions, and other software development tools. They also contain the most complete collection of free software in every area of artificial intelligence research and practice, including Artificial Life, Expert Systems, Fuzzy Logic, Genetic Algorithms, Knowledge Representation, Machine Learning, Natural Language Understanding and Generation, Neural Networks, Planning, Reasoning, Speech Recognition and Synthesis, and Theorem Proving, and much, much more. All of the more than 1,300 packages are extensively annotated and indexed, with programs for searching the index included on the CDs. Since the CD-ROMs use gzip for compression, this means that Prime Time Freeware for AI contains more than 5,000 megabytes of AI-related software. Prime Time Freeware for AI is targeted at AI researchers, educators, students, and practitioners. Prime Time Freeware for AI 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. Prime Time Freeware helped establish the CMU AI Repository, and sales of Prime Time Freeware for AI will continue to help support the expansion and maintenance of the repository. The product sells (list) for $60 US plus applicable sales tax and shipping and handling charges. Payable through Visa, Mastercard, postal money orders in US funds, and checks in US funds drawn on a US bank. Thus Prime Time Freeware for AI offers more than twice the contents of the NCC AI CD-ROM. For more information write to Prime Time Freeware 370 Altair Way, Suite 150 Sunnyvale, CA 94086 USA Tel: 408-433-9662 Fax: 408-433-0727 E-mail: ptf@cfcl.com NCC AI CD-ROM: The AI CD-ROM Revision 3 is available from Network Cybernetics Corporation for $89.00 per copy (plus $3 shipping domestic, $8 shipping international). The AI CD-ROM is an ISO-9660 format disk usable on any computer system, and contains 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 DOS, OS/2, Mac, Amiga, and Unix. Among the items included are the latest version NASA software such as CLIPS v6, NETS, and SPLICER, 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. 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. Most files on the disk are compressed in ZIP format. Macintosh specific files are in BinHex v4 (.HQX) format. Network Cybernetics Corporation releases 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-info@ncc.com. ---------------------------------------------------------------- Subject: [6-6] World-Wide Web (WWW) Resources The World Wide Web (WWW) is a hypermedia document that spans the Internet. It uses the http (HyperText Transfer Protocol) for the light-weight exchange of files over the Internet. NCSA Mosaic is a World Wide Web browser developed at the National Center for Supercomputing Applications (NCSA). Mosaic's popularity derives, in part, from its ability to communicate using more traditional Internet protocols like FTP, Gopher, WAIS, and NNTP, in addition to http. Mosaic can display text, hypertext links, and inlined graphics directly. When Mosaic encounters a file type it can't handle internally, such as Postscript documents, mpeg movies, sound files, and JPEG images, it uses an external viewer (or player) like Ghostscript to handle the file. Mosaic also includes facilities for exploring the Internet. In other words, Mosaic is an multimedia interface to the Internet. The hypertext documents viewed with Mosaic are written in HTML (HyperText Markup Language), which is a subset of SGML (Standard Generalized Markup Language). All that is needed is just a few more improvements, such as the ability to format tables and mathematics, and a WYSIWYG editor, for HTML to greatly facilitate electronic journals and other publications. NCSA Mosaic for the X Window System is available by anonymous ftp from ftp.ncsa.uiuc.edu:/Mosaic/ as source code and binaries for Sun, SGI, IBM RS/6000, DEC Alpha OSF/1, DEC Ultrix, and HP-UX. Questions about NCSA Mosaic should be directed to mosaic-x@ncsa.uiuc.edu (X-Windows version), mosaic-mac@ncsa.uiuc.edu (Macintosh), and mosaic-win@ncsa.uiuc.edu (Microsoft Windows). If you do not have a WWW client like Mosaic, you can search the WWW by telnet to info.cern.ch. There is also an email interface; to use it, send mail to listproc@www-0.cern.ch, and use lines like www http://www.cs.cmu.edu/Web/Groups/AI/html/faqs/top.html to retrieve the text of a particular URL (in this case, the AI FAQs page). The remainder of this section lists WWW resources of interest to AI researchers, students, and practitioners. Other URLs are scattered throughout the FAQ. If the entry includes an email address, that is the email address to which suggestions for additional links should be sent. AI-related FAQ Postings: A simple HTML version of the AI FAQ (this FAQ) and several other AI-related FAQs is available as http://www.cs.cmu.edu/Web/Groups/AI/html/faqs/top.html or equivalently, http://www.cs.cmu.edu/afs/cs/project/ai-repository/ai/html/faqs/top.html It is prepared automatically from the original once a week and ftp sites, gopher, and other WWW references in the text are automatically converted to http references. General AI Pages: http://www.cs.ucl.ac.uk/misc/ai/ Stephanie Warrick Includes pointers to a large number of AI, Neural Nets, CogSci, and Robotics WWW sites. gopher://ukoln.bath.ac.uk:7070/11/Link/Tree/Computing/Artificial_Intelligence BUBL (Bulletin Board for University Libraries) gopher from Glasgow, Strathclyde, and Bath. Pointers to various network resources for AI. http://ai.iit.nrc.ca/ai_top.html [NRC's AI Page] http://ai.iit.nrc.ca/ai_point.html [Artificial Intelligence Resources -- very good] http://ai.iit.nrc.ca/misc.html [Artificial Intelligence Resources organized by Subject] http://yoda.cis.temple.edu:8080/IIIA/ai.html [Pedagogic resources for Teaching and Learning Introductory AI] ingargiola@cis.temple.edu http://www.comlab.ox.ac.uk/archive/comp/ai.html [World-Wide Web Virtual Library: Artificial Intelligence] Jonathan.Bowen@comlab.ox.ac.uk AI-related News Archives: http://www.cs.cmu.edu/Web/Groups/AI/pubs/news/0.html [Archives of all the AI-related newsgroups, maintained as part of the CMU AI Repository.] ftp://ftp.neosoft.com/pub/users/claird/news.lists/newsgroup_archives.html [WWW page containing pointers to newsgroup archives.] Agents: http://www.cl.cam.ac.uk/users/rwab1/agents.html Ralph.Becket@cl.cam.ac.uk http://www.cs.bham.ac.uk/~amw/agents/index.html [Interface Agents] Andy Wood Artificial Life: http://alife.santafe.edu/ ACM SIGART: The Association for Computing Machinery's Special Interest Group for AI's gopher server is gopher://sigart.acm.org:70/ The WWW URL is http://sigart.acm.org/ Also available by FTP and Telnet (login eis). Calls for Papers: http://www.cs.cmu.edu/Web/Groups/scandal/www/conferences.html [Calls for papers for conferences and journals. Indexed.] Cognitive Science: http://www.c3.lanl.gov/~rutvik/cogsci-prog.html [Cognitive Science academic programs in US. Includes links to psychology, neuroscience, and linguistics lists.] Rutvik Desai Contests: http://www.usc.edu/dept/robotics/other/auvsarc/auvsarc.html usc.edu:/pub/nn_robotics/other/auvsarc/auvsarc.FAQ.Z [Association for Unmanned Vehicle Systems, International Aerial Robotics Competition FAQ.] FAQ maintained by Jim Montgomery For more information, write to Robert C. Michelson, the Technical Chairman and President of the AUVS . http://fuzine.mt.cs.cmu.edu/mlm/loebner94call.html [Loebner Prize Competition] http://fuzine.mt.cs.cmu.edu/mlm/julia.html [Information on Julia, one of the previous entries in the Loebner competition.] Data Mining and Knowledge Discovery in Databases: Data Mine http://www.cs.bham.ac.uk/~anp/TheDataMine.html [Bibliographies, On-line papers, Software, and Other Resources] Andy Pryke Knowledge Discovery Mine http://info.gte.com/~kdd/ ftp.gte.com:/pub/kdd/ [The Knowledge Discovery Mine includes the KDD FAQ, a catalog of commercial and public domain tools for discovery in data, workshop reports, as well as back issues of the KDD-Nugget mailing list. It also includes a list of AI resources compiled by Chris Matheus ] Gregory Piatetsky-Shapiro DAI and Multi-Agent AI: http://www.elec.qmw.ac.uk/dai.html ftp.elec.qmw.ac.uk:/pub/keag/distributed-ai [Multiagent and distributed AI research at Queen Mary & Westfield College in London.] http://www-lgis.univ-savoie.fr/~stinckwi/sma.html http://www.cs.umbc.edu/agents/ [Tim Finin's Software Agents Page] Expert Systems: http://www-ksl.stanford.edu/knowledge-sharing/agents.html [Interactive expert systems and "agents". Includes nice model of space shuttle engines.] Functional Programming: London and South East Centre for High Performance Computing Article Archive http://www.lpac.qmw.ac.uk/bin/monoFilter?/SEL-HPC/Articles/index.html [monochrome users] http://www.lpac.qmw.ac.uk/SEL-HPC/Articles/index.html [Kitsch colour page] Articles may be added using a series of forms. The archive also provides cross-reference indexes for author, institution, conference, and journal, and can be searched using Perl regular expressions. The underlying BibTeX databases are available for downloading. J.M.D. Hill or http://www.lpac.ac.uk/SEL-HPC/People/Hilly Genetic Art and Movies: Programs which use genetic algorithms to create art, inspired by the work of Karl Sims at Thinking Machines. Votes from human users (folks like you) are used to determine the "fitness" of the pictures in the current generation. The more fit pictures are more likely to be used in the creation of the next generation. After about a dozen or so generations, really pretty pictures result. Interactive Genetic Art II http://mixing.sp.cs.cmu.edu:8001/htbin/mjwgenform Interactive Genetic Movies http://mixing.sp.cs.cmu.edu:8001/htbin/moviegenform Genetic Music: Genetically Programmed Music http://nmt.edu/~jefu/notes/notes.html For more info, write to Jeff Putnam . IJCAI: International Joint Conference on Artificial Intelligence http://ijcai.org/ gopher://ijcai.org:70/1 ijcai.org:/pub/ijcai/ or by email to info@ijcai.org. Information Extraction: Information Extraction and Evaluations http://ciir.cs.umass.edu/info/ie.html For more information, write to Wendy Lehnert . Knowledge Representation: http://ai.iit.nrc.ca/home_page.html http://info.gte.com/ftp/doc/doc.html http://logic.stanford.edu/KIF http://logic.stanford.edu/knowledge.html http://www-ksl.stanford.edu/knowledge-sharing/README.html http://www.cs.umbc.edu/kqml/ http://www.cs.umbc.edu/kse/ ftp://ftp.cs.umbc.edu/pub/DARPA/interlingua/kif.ps ftp://ftp.cs.umbc.edu/pub/kqml/ [Knowledge Sharing, Knowledge Interchange Format (KIF)] Linguistics: http://www.bbk.ac.uk/Departments/AppliedLinguistics/VirtualLibrary.html [Internet resources for applied linguistics, compiled by the Univ. of London's Applied Linguistics Department.] Larry Selinker http://www.willamette.edu/~tjones/Language-Page.html. [Human-Languages Page. Links to dictionaries and resources for linguists.] Tyler Jones http://www.cog.brown.edu/pointers/linguistics.html [Brown University Linguistics] http://www.lib.virginia.edu/etext/ETC.html [Univ. of Virginia electronic text center.] gopher://marvel.loc.gov/11/global/lit [US Government language and literature page] Logic Programming: http://www.comlab.ox.ac.uk/archive/logic-prog.html Jonathan Bowen Machine Learning: http://ai.iit.nrc.ca/home_page.html [Knowledge Systems Laboratory of the National Research Council of Canada's WWW server for AI, with an emphasis on machine learning.] Peter Turney http://www.ics.uci.edu/AI/ML/Machine-Learning.html [Machine Learning group of the Department of Information and Computer Science at the University of California/Irvine. Includes UCI's repository of databases for machine learning research, digests of the Machine Learning List, programs (FOCL, Occam, and HYDRA) developed at UCI, and papers by authors from UCI. The Machine Learning List digests are searchable, and the repository should be searchable later this year.] Tim Hume Natural Language Processing: http://www.uio.no/~mwatz/c-g.writing/ [Computer Generated Writing] Marius Watz or http://www.uio.no/~mwatz/ Neural Networks: http://www.emsl.pnl.gov:2080/docs/cie/neural/neural.homepage.html [Pacific Northwest Laboratory's home page -- very good.] Paul Keller http://http2.sils.umich.edu/Public/nirg/nirg1.html [Neurosciences Internet Resource Guide] http://www.eeb.ele.tue.nl/index.html [Eindhoven Neural Networks home page] http://www.cs.utexas.edu/~nn [University of Texas at Austin Computer Science NN Home Page] http://www.cosy.sbg.ac.at/~rschwaig/rschwaig/projects.html http://www.erg.abdn.ac.uk/projects/neuralweb/ (Neural Web, Univ of Aberdeen) http://www.erg.abdn.ac.uk/projects/neuralweb/digests/ (Neuron Digest) http://www-dsi.ing.unifi.it/neural/home.html [DSI Neural Networks Group, Florence University, Italy] http://diwww.epfl.ch/w3mantra [Centre for Neuro-Mimetic Systems (MANTRA) at EPFL Lausanne (Switzerland)] http://web.bu.edu/CNS/CNS.html [Department of Cognitive and Neural Systems at Boston University] http://www.neuronet.ph.kcl.ac.uk/ NEuroNet is the European `Network of Excellence' for Neural Networks, based at King's College in London. Contact: ch@physig.ph.kcl.ac.uk or www@physig.ph.kcl.ac.uk http://www.ai.univie.ac.at/oefai/nn/nngroup.html [Austrian Research Institute for Artificial Intelligence. Includes a search engine to search 3,500 book and article citations.] The Center for the Neural Basis of Cognition (CNBC) and The Neural Processes in Cognition Training Program (NPC) are joint projects of Carnegie Mellon University and the University of Pittsburgh. http://www.cs.cmu.edu/afs/cs/project/cnbc/CNBC.html http://www.cs.cmu.edu/afs/cs/project/nnspeech/WorldWideWeb/PUBLIC/HomePage.html [Carnegie Mellon's Neural Net Speech Group] http://carol.fwi.uva.nl/~smagt/neuro/index.html [University of Amsterdam Robotics and Neurocomputing] http://physig.ph.kcl.ac.uk/cnn/cnn.html/ [Centre for Neural Networks (CNN) at King's College] http://synap.neuro.sfc.keio.ac.jp/ [Keio University (Shonon Fujisawa Campus) Neural Computing Center] http://www.yale.edu/HTML/YaleCTAN-Info.html [Center for Theoretical & Applied Neuroscience (CTAN)] http://salk.edu/NeuroWeb/ [University of California at San Diego NeuroWeb Home Page] http://www.lpac.ac.uk/SEL-HPC/Articles/NeuralArchive.html [Neural Networks Article Archive] Dimitris Tsaptsinos http://www.dice.ucl.ac.be/neural-nets/NNgroup.html [UCL NN Group's home page] http://www.dice.ucl.ac.be/neural-nets/NPL/NPL.html [Neural Processing Letters] http://www.cs.cmu.edu/afs/cs/project/cnbc/nips/NIPS.html [NIPS: Neural Information Processing Systems] http://www.hrz.uni-kassel.de/fb17/neuro/ [FG Neuronale Netzwerke, Uni Kassel. Most text in german.] Dutch Foundation for Neural Networks (SNN) Collecting URLs for Neural Network Groups; send to snn@mbfys.kun.nl. OCR: http://hcslx1.essex.ac.uk/ [Handwriting Recognition] Robotics: A list of pointers to sources of robotics information on the Internet. http://cs.indiana.edu/robotics/world.html Includes a HTML version of the comp.robotics FAQ, http://cs.indiana.edu/robotics/copy.html maintained by Jason Almeter . The Grad Students Who's Who in Robotics: http://www.sm.luth.se/csee/ra/sm-roa/RoboticsJump.html http://www.sm.luth.se/csee/ra/sm-roa/Robotics/WhoSWho.html http://www.ucs.edu/dept/raiders [USC's robot demo -- move a real robot arm] http://web.nexor.co.uk/mak/doc/robots/robots.html [Nice robotics page, including web agents.] http://piglet.cs.umass.edu:4321/robotics.html [Robotics Internet Resources Page] Speech: http://mambo.ucsc.edu/psl/speech.html Online Speech Synthesizer using the RSYNTH package http://www_tios.cs.utwente.nl/say/ (prefered URL) Axel.Belinfante@cs.utwente.nl AsTeR (Audio System For Technical Readings) is a computing system that orally renders technical documents marked up in LaTeX. An interactive demo is accessible via the URL http://www.cs.cornell.edu/Info/People/raman/aster/demo.html This document presents a collection of math examples rendered in audio by AsTeR and in Postscript by LaTeX/DVIPS from the same original LaTeX source. A version of the demo that uses inline images can be found in the URL http://www.cs.cornell.edu/Info/People/raman/aster/aster-toplevel.html For more information, write to T.V. Raman , http://www.cs.cornell.edu/Info/People/raman/raman.html If you download a copy of his thesis, please send him a short email message. http://ophale.icp.grenet.fr/esca/esca.html [European Speech Communication Association (ESCA)] Christian Benoit, or http://www.cs.bham.ac.uk/~jpi/synth/museum.html [Examples of speech synthesis from different systems.] Jon Iles or http://www.cs.bham.ac.uk/~jpi/ http://weber.u.washington.edu/~dillon/PhonResources.html [Archive of resources for studying speech sounds, primarily English. Includes symbols and samples of English phones/phonemes, both American and British; tips, tutorials, basic walk-throughs of waveform analysis; and examples and links to TTS synthesizers, mainly in Europe.] George Dillon Computer Vision: http://www.cs.cmu.edu/afs/cs/project/cil/ftp/html/vision.html http://www.cs.cmu.edu/afs/cs/project/cil/www/vision.html [Pretty version with icons.] http://www.cs.cmu.edu/afs/cs/project/cil/ftp/html/txtvision.html http://www.cs.cmu.edu/afs/cs/project/cil/www/txtvision.html [Text-only version.] Mark Maimone Various Universities: These Mosaic/WWW pages typically contain information about research projects, on-line technical reports, lists of faculty and students, and other relevant information pertaining to the university. CIRL http://wrigley.uoregon.edu/ CMU Oz Project: http://www.cs.cmu.edu/afs/cs.cmu.edu/project/oz/web/oz.html Some of the project's papers are also accessible as ftp.cs.cmu.edu:/afs/cs.cmu.edu/project/oz/ftp/papers/ Please read the copyright information in that directory before grabbing any papers. CMU SCS http://www.cs.cmu.edu/Web/FrontDoor.html DFKI: http://www.dfki.uni-sb.de/ ELIS Speech Lab http://www.elis.rug.ac.be/ELISgroups/speech/ [Includes demos of Eurovocs speech synthesizer.] GATech AI http://www.gatech.edu/ai/ai.html GATech CogSci http://www.gatech.edu/cogsci/cogsci.html Glasgow and Strathclyde Universities BUBL: Artificial Intelligence gopher://ukoln.bath.ac.uk:7070/1/Link/Tree/Computing/Artificial_Intelligence Indiana University Cognitive Science Program: http://www.psych.indiana.edu/ Bill Wang Institute for Language Technology and AI: http://itkwww.kub.nl:2080:/itk/itkhome.html ISSCO U Geneva http://issco_www.unige.ch/ Afzal Ballim JAIR gopher://p.gp.cs.cmu.edu/ Los Alamos (Neural Networks): http://laws.lanl.gov/x1_homepage.html Roger D. Jones OGI http://www.cse.ogi.edu MIT AI Lab http://www.ai.mit.edu/ Pacific Northwest Laboratory: (Neural Networks) http://www.emsl.pnl.gov:2080/docs/cie/neural/neural.homepage.html Paul Keller Stanford KSL http://www-ksl.stanford.edu/ UC Davis AI Lab http://phobos.cs.ucdavis.edu:8001 [Includes links to other AI resources.] Kenrick J. Mock UC Irvine Machine Learning http://www.ics.uci.edu/AI/ML/Machine-Learning.html [Testbed databases, FOCL, Occam, and Hydra.] UCL http://www.cs.ucl.ac.uk/people/ai/ Tim J. Norman Includes a pointer to a large number of other AI, CogSci, and Robotics WWW sites. University of Edinburgh's AI Applications Institute: http://www.aiai.ed.ac.uk/ aiai@ed.ac.uk UMass DAI Lab http://dis.cs.umass.edu/ UMass Robotics http://piglet.cs.umass.edu:4321/lpr.html University of Leeds Speech Laboratory: URL: http://lethe.leeds.ac.uk/ Provides access to the MAchine Readable Spoken English Corpus (MARSEC) data via anonymous ftp and a bulletin board for users of the corpus. UPenn IRCS: http://www.cis.upenn.edu/~ircs/homepage.html (NSF Institute for Research in Cognitive Science) Univ. of Stuttgart's Institute for Natural Language Processing: http://www.ims.uni-stuttgart.de/IMS.html Univ. of Vienna: http://www.ai.univie.ac.at Georg Dorffner U. of Washington AI http://www.cs.washington.edu/research/projects/ai/www/ University of Western Australia, Centre for Intelligent Information Processing Systems (CIIPS), EE Engineering Department http://ciips.ee.uwa.edu.au/ ---------------------------------------------------------------- ;;; *EOF*