CS472/473 Fall 1999
Foundations of Artificial Intelligence
Course Materials
Note: Many of these files are Postscript files (their names end
in ".ps"). No browser we know of can display them directly, so you either
a) have to specify a helper application (like ghostview) to display them
for you, or b) you can download the file and do something with it locally
(for example, in unix you could "lpr" it to a laser-printer which understands
Postscript).
Netscape Navigator in the PC lab, at least on some machines,
is already configured to use ghostview. If you try it, and it
doesn't work, try this.
CS472 Handouts
General Course Information
Final exam: Tue., Dec. 14, 12-2:30pm, Uris Auditorium.
REVIEW SESSION: Monday, Dec. 13th, Philips 101 (auditorium)
from 3 p.m. - 4:00 p.m. Alin Dobra.
Solution set for hwk #5 will be posted on Friday evening (Dec. 10).
Office hours:
Mon./Wed., 2:00-3:00pm, Prof. Selman, Upson 4148.
Homework #1
(pdf),
Solution #1(ps)
(pdf)
Homework #2
(pdf),
Solution #2(ps)
(pdf)
Homework #3
(pdf),
Solution #3(ps)
(pdf)
Example midterm
(pdf),
Solution(ps)
(pdf)
Homework #4
(pdf),
NEW!! Homework #5
(pdf),
Solution#5(ps)
(pdf)
Code for the graphic interface
for the quasigroup completion problem (read the
notes for an explanation).
The html page that starts the applet can look like
this
To be able to stop the search you need to use threads. To get an idea how to do this look at the modified version of quasigroup.java and the implementation of the Class forward. Please use only lower case letters for the names of classes and files you write since going from a Windows platform to a UNIX platform is problematic otherwise.
To submit the homework click HERE and follow the instructions.
CS472 Lecture Notes
-
Lect #1. Defining Artificial Intelligence
[ .ps;
2 per page, .ps;
pdf
]
-
Lect #2. Problem Solving as Search
[ .ps;
2 per page, .ps;
pdf
]
-
Lect #3. Uninformed Search
[ .ps;
2 per page, .ps;
pdf
]
-
Lect #4. Heuristic Search --- Greedy / A*
[ .ps;
2 per page, .ps;
pdf
]
-
Lect #5. Heuristic Search --- Local Search
[ .ps;
2 per page, .ps;
pdf
]
-
Lect #6. Heuristic Search --- Local Search / GSAT
[cont. notes from lect. #5
]
-
Lect #7. Adversary search
[ 2 per page, .ps;
pdf
]
-
Lect #8. Adversary search
[cont. notes from lect. #7
]
-
Lect #9. Adversary search
[ 2 per page, .ps;
pdf
]
-
Lect #10. Adversary search
[cont. notes from lect. #9
]
-
Lect #11. Adversary search
[ 2 per page, .ps;
pdf
]
-
Lect #12. Search wrap-up
[cont. notes from lect. #11
]
-
Lect #13. Knowledge Representation, intro.
[ 2 per page, .ps;
pdf
]
-
Lect #14. Knowledge Repr.
[ 2 per page, .ps;
pdf
]
-
Lect #15. Knowledge Repr.
[cont. notes from lect. #14
]
-
Lect #16. Knowledge. Repr.
[ 2 per page, .ps;
pdf
]
-
Lect #17. Knowledge Repr.
[cont. notes from lect. #16
]
-
Lect #18. Knowl. Repr.
[ 2 per page, .ps;
pdf
]
-
Lect #19. Knowl. Repr.
[cont. notes from lect. #18
]
-
Lect #20. Knowl. Repr.
[ 2 per page, .ps;
pdf
]
-
Lect #21. Knowl. Repr.
[ 2 per page, .ps;
pdf
]
-
Lect #22. Intro. learning
[ 2 per page, .ps;
pdf
]
-
Lect #23. Learning / decision trees
[ 2 per page, .ps;
pdf
]
-
Lect #24-25. Learning
[ 2 per page, .ps;
pdf
]
-
Midterm
-
Lect #26. Learning
[ 2 per page, .ps;
pdf
]
-
Lect #27. Learning
[ 2 per page, .ps;
pdf
]
-
Lect #28-29. Learning
[ 2 per page, .ps;
pdf
]
-
Lect #30-31. Learning
[ 2 per page, .ps;
pdf
]
-
Lect #32-34. Learning
[ 2 per page, .ps;
pdf
]
-
Lect #35. Learning
[ 2 per page, .ps;
pdf
]
-
Lect #36. Learning
[ 2 per page, .ps;
pdf
]
CS473 Handouts
Project proposals
Some project suggestions (prelim.)
CS473 Project Suggestions
Return to CS472/473 home page