Description
This course explores principles and methods for knowledge representation, reasoning, learning, problem solving, planning, heuristic search, and natural language processing and their application to building intelligent systems in a variety of domains. LISP programming language is used.
Prerequisites:
A working knowledge of computer systems and several programming languages is required. The material covered in CS 310 and CS 330 as well as general computer science maturity is assumed and used throughout the course.
General Information
Artificial Intelligence: A Modern Approach (3rd Edition), Russell & Norvig, Prentice Hall
Lisp Book:
ANSI Common Lisp, Graham, Prentice-Hall
Recommended:
Common LISPcraft, R. Wilensky, Norton Publishing
Common Lisp - The Language, G. Steele, Digital Press
Artifical Intelligence, Luger & Stubblefield, Addison Wesley
Artificial Intelligence: A New Synthesis, Nilsson, Morgan Kaufmann
homework: 30%
project: 10%
midterm: 25%
final: 35%
Eye on the prize, Nilsson's paper on AI: http://cs.gmu.edu/~zduric/cs580/prize.pdf
Playing with AI - a collection of short articles on games: http://cs.gmu.edu/~zduric/cs580/Games.pdf
Matlab primer, Introduction to matlab: http://cs.gmu.edu/~zduric/cs580/primer40.pdf
CMU Artificial Intelligence Repository: http://www.cs.cmu.edu/afs/cs.cmu.edu/project/ai-repository/ai/0.html
Artificial Intelligence: A Modern Approach Russel & Norvig book: http://aima.cs.berkeley.edu
Common Lisp the Language, 2nd Edition, Guy L. Steele: http://www.cs.cmu.edu/afs/cs/project/ai-repository/ai/html/cltl/cltl2.html
Peter Norvig Lisp Resources: http://www.norvig.com
Sbcl info Steel Bank Common Lisp: http://sbcl.org
Lispworks LispWorks Personal Edition: http://www.lispworks.com
Computer Vision Homepage: http://www.cs.cmu.edu/~cil/vision.html
UCI Machine Learning Data Repository: http://archive.ics.uci.edu/ml/
Announcements
Hi all,
The final project deadline has been extended to Thursday Dec 4, 11:59 pm.
#pin
The teaching staff has posted a new general resource.
Title: cs580Finalreview.pdf
You can view it on the course page: https://piazza.com/gmu/fall2014/cs580/resources
These are some additional problems for studying. The numbering is incorrect since I removed some search problems (not a part of the final exam this time).
cs580ta@cs.gmu.edu is working again, you should direct all queries to the TA using that.
If you wish to contact the TA, please directly send to ibanerje@gmu.edu instead of cs580ta@cs.gmu.edu. Use CS580 tag in the subject line.
The teaching staff has posted a new homework resource.
Title: Hwk4f14.pdf
http://www.piazza.com/class_profile/get_resource/hz1kvxhofcx1vk/i2dmryzihg12sm
Due date: Nov 25, 2014 in class - first 5 minutes or you will have to run after the TA
You can view it on the course page: https://piazza.com/gmu/fall2014/cs580/resources
The teaching staff has posted a new homework resource.
Title: Projectf14.pdf
http://www.piazza.com/class_profile/get_resource/hz1kvxhofcx1vk/i26z9zlkgze1vm
Due date: Dec 2, 2014
You can view it on the course page: https://piazza.com/gmu/fall2014/cs580/resources
The teaching staff has posted a new general resource.
Title: 1302.6787v1.pdf
You can view it on the course page: https://piazza.com/gmu/fall2014/cs580/resources
This is the paper which describes the cutset algorithm. You do not need to read proofs and you only need to understand the greedy algorithm (GA) with all vertex weights ( w(v_i) ) equal to 1.
For groups of 4 and for those who would like extra credit modified greedy algorithm (MGA) should be implemented. For that an algorithm for finding cycles in a graph is needed (see cycles.pdf file).
I wanted to mention couple of common mistakes for which I deducted points:
1. In TSP problem, you needed to verify all neighboring states before concluding that you reached a local minima. (-1.5)
2. In P5, the question is referring to whether the first player has at least one move, such that if he/she plays that move, he guarantees a win regardless of the other players' moves. (-2)
| Name | Office Hours | |
|---|---|---|
Zoran Duric | When? Where? | |
Indranil Banerjee | When? Where? | |
YajieYang | When? Where? |