Date: Wed, 20 Nov 1996 22:33:14 GMT
Server: Apache/1.0.3
Content-type: text/html
Content-length: 9504
Last-modified: Tue, 19 Nov 1996 02:25:34 GMT
B551 Main Page
B551: Introduction to Artificial Intelligence
Contents
Administrative information
Everyone is responsible for reading the following pages.
Class-related information
Other assorted pointers
- Due November 21: Russel & Norvig 15.5, 15.6
- Due November 19: Russel & Norvig Chapter 14
- Due November 8: Russel & Norvig Chapter 11, 12.1, and 12.2.
- Due October 15: Russel & Norvig 8.1-8.3, 9.1-9.6
- Due October 4: Russel & Norvig chapter 7 (6 may be helpful but is
optional)
- Due October 1: Russel & Norvig chapter 5.
- Due September 20: Russell & Norvig chapters 2-4 except for 4.3
and the applications to constraint satisfaction in 4.4.
- Due September 5: Russell & Norvig chapter 1.
2-hour reserve
- Goldberg, D. Genetic Algorithms in Search, Optimization, and
Machine Learning. Addison-Wesley, 1989.
- Haugland, J., Ed., Mind Design: Philosophy, Psychology,
Artificial Intelligence, Bradford Books, 1980.
- Riesbeck, C. and Schank, R. Inside Case-Based Reasoning.
Erlbaum, 1989.
- Russell, S. and Norvig, P.
Artificial Intelligence: A Modern
Approach, Prentice Hall, 1995. (On reserve for this course and
the CS qualifying exam.)
- Schank, R.C., and Riesbeck, C. "The
Theory Behind the Programs: Conceptual Dependency," from Inside
Computer Understanding, Erlbaum, 1981. Only this chapter is
available; the book itself is not on reserve.
When the
class newsgroup is created it will be possible to
access it from this page.
If you do this from lynx
or netscape
,
you can post and respond to articles, as well as read them.
If you're interested in going deeper into AI/Cog Sci, you should consider
joining societies such as the American
Association for Artificial Intelligence, the Cognitive Science
Society, or the ACM's SIGART.
All offer very reasonable student membership rates
including publications (AI Magazine, Cognitive
Science, and SIGART Bulletin).
Cognoscente is a mail server account used for announcements of
Cognitive Science Meetings, Conferences and Colloquia at Indiana
University. Please do not use this for
discussion purposes or to send individual messages.
Cogd is a local Indiana University mailing list available for
those within Cognoscente for discussion purposes only.
If you wish you can subscribe or unsubscribe to these lists by doing the
following:
TO: majordomo
SUBJECT: leave blank
The body of your message should read:
subscribe cognoscente
subscribe cogd
or
unsubscribe cognoscente
unsubscribe cogd
Comp.ai
Sci.cognitive
The following are recommended sources for brushing up on scheme, and should
be available at Swain library or in local bookstores:
- Dybvig, R. K. The Scheme programming language, Prentice-Hall,
1987.
- Friedman, D.P. and Felleisen, M. The Little Schemer. MIT Press, 1996.
- Springer, S. and Friedman, D. Scheme and the art of programming.
MIT Press, 1989.
In addition to the above books, the following may be useful:
A crash introduction to scheme
The course will be in LH004 ("the Burrow") in three sessions:
TIME/DATE WHAT WE'LL COVER
Th, 5th, 4:35 - 5:35pm scheme basics, emacs&scheme
F, 6th, 10:00 - 11:30am most common scheme constructs,
designing/building functions
F, 13th, 10:00 - 11:30am style, advanced stuff (no call/cc!),
more complex examples
Students will need to get accounts for these machines, if they don't
already have them (quite probably they don't). They can do this by
doing "telnet account", selecting "UNIX systems", and then selecting
"Burrow account".
The following preparation is recommended:
- Read chapters 1-2 of The Little Schemer, and on p. 33 (the
first page of chapter 3), try to write "rember." (Code for rember is
on page 37.) Then go through 1-2 again trying out the code in
scheme. Or,
- Read Chapter 2, sections 2-1 to 2-8 inclusive of
The Scheme programming language. Again, read them once and
then go through them trying out the code. You can also try to write
rember:
> rember:
> Write a function that takes 2 arguments: an atom and a list.
> Return the list with the *first* occurrence of the given atom
> removed. (rember = remove + member)
>
> e.g.,
> (rember 'blue '(red white and blue))
> => (red white and)
>
> (rember 'tigers '(lions tigers and bears ohmy!))
> => (lions and bears ohmy!)
>
> (rember 'the '(attack of the the eye creatures))
> => (attack of the eye creatures)