FTP is a file transfer protocol that is widely accepted by computers around the world. FTP makes it easy to transfer files between two computers on which you have accounts. But more importantly, it also allows a user on one computer to access files on a computer on which he or she does not have an account, as long as both computers are connected to the Internet. This is known as anonymous FTP.
All the code in this book is available for anonymous FTP from the computer mkp.com
in files in the directory pub/norvig
.
The file README
in that directory gives further instructions on using the files.
In the session below, the user smith
retrieves the files from mkp.com
.
Smith's input is in slanted font. The login name must be anonymous, and Smith's own mail address is used as the password.
The command cd pub/norvig changes to that directory, and the command ls lists all the files.
The command mget * retrieves all files (the m stands for "multiple").
Normally, there would be a prompt before each file asking if you do indeed want to copy it, but the prompt command disabled this.
The command bye ends the FTP session.
% *ftp mkp.com* (or *ftp 199.182.55.2*)
Name (mkp.com:smith): *anonymous*
331 Guest login ok, send ident as password
Password: *[email protected]*
230 Guest login ok, access restrictions apply
ftp>*cd pub/norvig*
250 CWD command successful.
ftp>*ls*
...
ftp>*prompt*
Interactive mode off.
ftp>*mget**
...
ftp> bye
%
Anonymous FTP is a privilege, not a right.
The site administrators at mkp.com
and at other sites below have made their systems available out of a spirit of sharing, but there are real costs that must be paid for the connections, storage, and processing that makes this sharing possible.
To avoid overloading these systems, do not FTP from 7:00 a.m.
to 6:00 p.m.
local time.
This is especially true for sites not in your country.
If you are using this book in a class, ask your professor for a particular piece of software before you try to FTP it; it would be wasteful if everybody in the class transferred the same thing.
Use common sense and be considerate: none of us want to see sites start to close down because a few are abusing their privileges.
If you do not have FTP access to the Internet, you can still obtain the files from this book by contacting Morgan Kaufmann at the following:
Morgan Kaufmann Publishers, Inc.
340 Pine Street, Sixth Floor
San Francisco, CA 94104-3205
USA
Telephone 415/392-2665
Facsimile 415/982-2665
Internet [email protected]
(800) 745-7323
Make sure to specify which format you want:
Macintosh diskette ISBN 1-55860-227-5
DOS 5.25 diskette ISBN 1-55860-228-3
DOS 3.5 diskette ISBN 1-55860-229-1
In addition to the program from this book, a good deal of other software is available.
The tables below list some of the relevant AI/Lisp programs.
Each entry lists the name of the system, an address, and some comments.
The address is either a computer from which you can FTP, or a mail address of a contact.
Unless it is stated that distribution is by email or Floppy or requires a license, then you can FTP from the contact's home computer.
In some cases the host computer and/or directory have been provided in italics in the comments field.
However, in most cases it should be obvious what files to transfer.
First do an ls
command to see what files and directories are available.
If there is a file called README
, follow its advice: do a get README
and then look at the file.
If you still haven't found what you are looking for, be aware that most hosts keep their public software in the directory pub
.
Do a cd pub
and then another ls
, and you should find the desired files.
If a file ends in the suffix .Z
, then you should give the FTP command binary
before transferring it, and then give the UNIX command uncompress
to recover the original file.
Files with the suffix .tar
contain several files that can be unpacked with the tar
command.
If you have problems, consult your local documentation or system administrator.
Knowledge Representation
System | Address | Comments | |||||||
Babbler | [email protected] | *email;*Markov chains/NLP | |||||||
BACK | [email protected] | 3.5" floppy; KL-ONE family | |||||||
Belief | [email protected] | belief networks | |||||||
Classic | [email protected] | license; KL-ONE family | |||||||
Fol Getfol | [email protected] | tape; Weyrauch's FOL system | |||||||
Framekit | [email protected] | floppy; frames | |||||||
Framework | [email protected] | a.gp.cs.cmu.edu:/usr/mkant/Public; frames | |||||||
Frobs | [email protected] | frames | |||||||
Knowbel | [email protected] | sorted/temporal logic | |||||||
MVL | [email protected] | multivalued logics | |||||||
OPS | [email protected] | Forgy's OPS-5 language | |||||||
PARKA | [email protected] | frames (designed for connection machine) | |||||||
Parmenides | [email protected] | frames | |||||||
Rhetorical | [email protected] | planning, time logic | |||||||
SB-ONE | [email protected] | license; in German; KL-ONE family | |||||||
SNePS | [email protected] | license; semantic net/NLP | |||||||
SPI | cs.orst.edu | Probabilistic inference | |||||||
YAK | [email protected] | KL-ONE family |
Planning and Learning
System | Address | Comments | |||||||
COBWEB/3 | [email protected] | email; concept formation | |||||||
MATS | [email protected] | license; temporal constraints | |||||||
MICRO-xxx | [email protected] | case-based reasoning | |||||||
Nonlin | [email protected] | Tate's planner in Common Lisp | |||||||
Prodigy | [email protected] | license; planning and learning | |||||||
PROTOS | [email protected] | knowledge acquisition | |||||||
SNLP | [email protected] | nonlinear planner | |||||||
SOAR | soar-requests/@cs.cmu.edu | license; integrated architecture | |||||||
THEO | [email protected] | frames, learning | |||||||
Tileworld | [email protected] | planning testbed | |||||||
TileWorld | [email protected] | planning testbed |
Mathematics
System | Address | Comments | |||||||
JACAL | [email protected] | algebraic manipulation | |||||||
Maxima | rascal.ics.utexas.edu | version of Macsyma; also proof-checker, nqthm | |||||||
MMA | [email protected] | peoplesparc.berkeley.edu:pub/mma.*; algebra | |||||||
XLispStat | umnstat.stat.umn.edu | Statistics; also S Bayes |
Compilers and Utilities
System | Address | Comments | |||||||
AKCL | rascal.ics.utexas.edu | Austin Koyoto Common Lisp | |||||||
CLX, CLUE | export.lcs.mit.edu | Common Lisp interface to X Windows | |||||||
Gambit | [email protected] | acorn.cs.brandeis.edu:dist/gambit*; Scheme compiler | |||||||
ISI Grapher | isi.edu | Graph displayer; also NLP word lists | |||||||
PCL | arisia.xerox.com | Implementation of CLOS | |||||||
Prolog | aisun1.ai.uga.edu | Prolog-based utilities and NLP programs | |||||||
PYTHON | [email protected] | a.gp.cs.cmu.edu: Common Lisp Compiler and tools | |||||||
SBProlog | arizona.edu | Stony Brook Prolog, Icon, Snobol | |||||||
Scheme | altdorf.ai.mit.edu | Scheme utilities and compilers | |||||||
Scheme | [email protected] | Scheme utilities and programs | |||||||
SIOD | bu.edu | users/gjc; small scheme interpreter | |||||||
Utilities | a.gp.cs.cmu.edu | /usr/mkant/Public; profiling, def system, etc. | |||||||
XLisp | cs.orst.edu | Lisp interpreter | |||||||
XScheme | tut.cis.ohio-state.edu | Also mitscheme compiler; sbprolog |