![]() |
Introduction to Artificial Intelligence Fall 2001 Department of Computer Science | ![]() |
Nov. 29: Project presentation shedule is being added to the Semester Project section of this page.
Nov. 29: The file assignment4.problem2.help.txt has been added to help you with the last assignment.
Nov. 26: The file understanding.prolog.txt has been added to help you through Prolog.
| | | | Aug 21 | Class description. Lisp and AI introduction. |
|
| Aug 23 | Emacs. Common Lisp. | Read Comparing
Java vs.C/C++, by Lutz Prechelt, Lisp
as an Alternative to Java, by Erann Gat, and Beating
the Averages, by Paul Graham. You will take a short, easy quiz on
this material and we will discuss the results. Also, read the
introductions listed in the On-Line Resources
below about using Allegro Common Lisp with Emacs. |
| Aug 28 | Common Lisp | Read the preface and chapters 1 and 2 in
Basic
Lisp Techniques, by David J. Cooper. Also read the preface and
chapters 1 and 2 of our text ANSI Common Lisp, by Paul Graham |
| Aug 30 | Common Lisp (dribble file from class)
| ANSI Common Lisp: Chapter 3 |
| Sep 4 | Other lisp data structures. (dribble file from class) | ANSI Common Lisp: Chapter 4. |
| Sep 6 | Quiz Today. Control and functions. Intelligent agents. |
ANSI Common Lisp:
Chapters 5 | Artficial Intelligence: Preface and Chapters 1 and 2. Assignment 1 , due today at start of class. (Here is a pdf version.)
| Sep 11 | Functions, I/O, symbols, numbers.
(dribble file from class)
| ANSI Common Lisp: Chapter 6, 7, 8, and 9. |
| Sep 13 | Search.
(dribble file from class)
| ANSI Common Lisp: Chapter 10. |
| Sep 18 | State space. Uninformed search. Assignment 2. | Artficial Intelligence: Chapter 3. |
| Sep 20 | Sequence prediction problem. Backquote. Multiple-value-bind. | Chapter 4. |
| Sep 25 | | all-ways-to-replace-atoms (dribble file from class).Informed search. Chapter 4. |
| Sep 27 | Depth-limited. Iterative deepening. (dribble file from class)
| Chapter 4 | Project proposals due at start
of class. Assignment 2 , due today at 5:00 PM.
| Oct 2 | Simpler way to keep track of paths. Iterative
deepening. | Chapter 4 |
| Oct 4 | Greedy and A*. Effective branching factor. Heuristic functions. IDA*. SMA*. | Chapter 4 | Updated project proposals due
at start of class.
| Oct 9 | Iterative improvement algorithms | (Lisp hash tables discussion) Chapter 4 |
| Oct 11 | Midterm Exam | |
| Oct 16 | Review exam. Assignment help. | Chapter 5 |
| Oct 18 | Games | Chapter 5 | Assignment 3 , due Oct. 19th at 5:00 PM.
| Oct 23 | Algorithm and lisp for game playing |
Chapter 5 |
| Oct 25 | Minimax and alpha-beta pruning in lisp. | Chapter 5 |
| Oct 30 | Introduction to logic. Propositional logic. |
Chapter 6 |
| Nov 1 | Rules of inference | Chapter 6 |
| Nov 6 | First-order logic | Chapter 7 (7.1 and 7.3 only) |
| Nov 8 | First-order logic and inference | Chapter 9 |
| Nov 13 | Prolog | Read and do all of the interactive exercises at
this site on an Introduction to
Prolog. Do not turn anything in for this. It will not be graded. |
| Nov 15 | Prolog | |
| Nov 20 - 22 | Thanksgiving Break | |
| Nov 27 | Prolog
| Read understanding.prolog.txt.
|
| Nov 29 | Prolog
|
| Extra-credit problems due by December 1st, 5:00PM.
| Dec 4 | | Chapter 10 | Assignment 4 due by
December 4th, 5:00PM.
| Dec 6 | Frames and semantic networks | Chapter 10 | Drafts of semester project reports due today in class.
| Dec 8 | In class presentations of semester projects | Room 310B USC, 9:00 AM - 5:00 PM (See shedule). |
| Dec 11 | Final Exam, 9:10 - 11:10 am | |
| Dec 12, 4:00 PM | | | Final semester project reports are due, Dec 12, 4:00 PM. Bring printed report to Chuck's office or mailbox.
| |
The course objectives are to learn symbolic computation using Common Lisp and Prolog, to practice techniques for programming AI applications, and to introduce the fundamental theories, algorithms and representational structures underlying Artificial Intelligence.
Class discussions will range from Lisp and Prolog programming fundamentals to philosophical issues in Artificial Intelligence. Lisp and Prolog are used to illustrate basic data structures and programming techniques in AI. Common Lisp and Prolog programs implementing problem-solving search methods and logical reasoning techniques will be studied and modified. Other topics will be covered as time permits. Students must complete a number of written and programming assignments and a semester project. Class size permitting, during the last week of class, semester projects will be presented by students.
As prerequisites for this class, you must be familiar with data structures as taught in CS253 and formal languages and automata as taught in CS301. Familiarity with Common Lisp and Prolog will make programming assignments much easier, but is not required.
Students will have access to the Allegro Common Lisp and SBProlog environments to do their homework and projects. Other common lisp and prolog environments are available. Allegro Common Lisp is a commercial product and SBProlog is public domain. Details on the use of these environments on the computer science network at CSU will be discussed in class. Code you turn in must run in these environments. However, you may develop your assignment solutions in other common lisp and prolog environments. A number of them are available for Macs and PCs, some of which are free or shareware. See the On-Line Resources below.
Student responsibilities include the following. Completion of
reading and homework assignments by the beginning of class on the day
they are due. Completion of programming assignments requires handing
in printouts of programs, data, and results, and possibly
electronically checking them in. Unless prior arrangements have been
made with the professor (to address special situations) or
documentation of an emergency situation is presented,
The class will be a mix of lecture and discussion. Students are expected to voice all of their questions and to be ready to discuss the reading material.
Instructor: Chuck Anderson
Graduate Teaching Assistant: Jean-Luc Romano
Project proposals must be turned in by September 20th. Proposals must be a typed description, at least two pages long, of the project's objectives, method, and expected results. Proposals with instructor's comments will be returned September 25th. Updated proposals are due September 27th and on this day all students will briefly present their proposals in front of class.
Drafts of the final, written project reports are due on December 6th. The final versions of the written reports must be at least 15 pages long. They are due on December 12th, at 4:00 PM. If time permits, near the end of the semester during scheduled class time or other agreed upon time, in-class presentations of the projects will be given. Details on the structure of the written report and of the presentations will be dicussed in class.
Here are some suggestions in postscript about how to structure the report for your semester project. Here is the LaTeX file that generated the postscript file. To produce postscript from this file, you will also need to download this silly figure. To latex it, just do
latex report (assuming your report is in report.tex)
latex report (do it again so latex can read the table of contents and
references generated by the first pass)
dvips -o report.ps report.dvi
gv report.ps
or
lp report.ps
An easy way to generate pdf output is to login to one of our Linux
machines (see our
list of machines) and simply do
pdflatex report acroread report.pdfSee the LaTeX section in On-Line Resources below for links to LaTeX tutorials.
Here is the schedule for presentations on December 8, Room 310B USC.
| | |
| | | | 9:00-9:10 | Aaron Webb | Reinforcement Learning
|
| 1:00-1:10 | Dustin Perkins | Artificial Life
| 9:10-9:20 | Dan Elliott | Checkers Playing Program
|
| 1:10-1:20 | Kris Johnson | Statistical Simulations
| 9:20-9:30 | Andy Jenkins | Cognitive Science
|
| 1:20-1:30 | Aaron Alexander | Artificial Life and Genetic Algorithms
| 9:30-9:40 | Al Lionelle | Grand Challenge of AI
|
| 1:30-1:40 | Jeremy Bradley | AI in space exploration
| 9:40-9:50 | Carolyn Torpy | AI: Fact vs. Fiction
|
| 1:40-1:50 | Tuan Bui | Machine Replication
| 9:50-10:00 | Troy Heithecker | Fuzzy Logic
|
| 1:50-2:00 | Chuck Sharp | Planning for Dummies
| 10:00-10:10 | |
|
| 2:00-2:10 | Aaron Galuzzi | Creating Intelligent Machines
| 10:10-10:20 | Ben Thomas | Game AI
|
| 2:10-2:20 | Mike Brake | Genetic algorithms for the game RoboRally
| 10:20-10:30 | Russell Voss | Constraint Satisfaction Problems relating to NLSI
|
| 2:20-2:30 | Ivan Drinks | Expert Systems
| 10:30-10:40 | Jeff Hill | AI in the Customer Service Domain
|
| 2:30-2:40 | Adam Lorber | AI involvement in NCAV's
| 10:40-10:50 | Jason Kauffman | Philosophy of AI
|
| 2:40-2:50 | |
| 10:50-11:00 | Emel Meadors | Socially Intelligent Agents
|
| 2:50-3:00 | Thomas Conklin | Neural Networks
| 11:00-11:10 | Chris Hamp | N-Queens
|
| 3:00-3:10 | Ryan Rohlman | KDD vs. Data Mining
| 11:10-11:20 | Renelle Kelleher | Remote Sensing Using Neural Networks
|
| 3:10-3:20 | Jeremiah Bush | Sparky the Cricket
| 11:20-11:30 | Hector Aguilar | Computer Vision
|
| 3:20-3:30 | Carol Kaito | K-means algorithm
| 11:30-11:40 | Tai Xin | Data Clustering
|
| 3:30-3:40 | Jochen Deyke | Game AI
| 11:40-11:50 | Chauncy McCaughey | AI use in credit card fraud detection
|
| 3:40-3:50 | |
| 11:50-12:00 | Wendell Stack | Autonomous Vehicle Navigation
|
| 3:50-4:00 | |
| | |
|
| 4:00-4:10 | |
| | |
|
| 4:10-4:20 | |
| | |
|
| 4:20-4:30 | |
| | |
|
| 4:30-4:40 | Mark Roberts | Cascade Correlation Neural Networks
| | |
|
| 4:40-4:50 | Karn Sukwong | Agent-Based Virtual Market
| | |
|
| 4:50-5:00 | |
| |
alias xemacs /usr/local/bin/xemacsYou may want to add this line to your .cshrc file so you won't have to type it in every single time you log on to use Allegro Common Lisp with xemacs.)
loop macro explanation from Steele's book.