|
Computer
Science Department |
Artificial Intelligence
CS 300 - Fall 2009
| Date | Topic | Slide set | Assignments | |
|---|---|---|---|---|
| 1. | 9/9/09 | What is AI? | syllabus slides 1-9 Linux basics vnc.pdf |
Assignment 1 |
| 2. | 9/11/09 | Solving the mapping task using a simple-reflex agent | slides 10-37 | |
| 3. | 9/14/09 | History of AI | slides 38-45 | |
| 4. | 9/16/09 | AI as search in a problem space | slides 46-55 | |
| 5. | 9/18/09 | Uninformed search: Breadth-first search | slides 56-63 | |
| 6. | 9/21/09 | Uninformed search: Depth-first search, and Depth-First Iterative Deepening | slides 64-71 | |
| 7. | 9/23/09 | Uninformed search: Bi-directional search; Least-cost search | slides 72-82 | Assignment 2 |
| 8. | 9/25/09 | Informed search: Pure heuristic search, A* search | slides 83-88 | |
| 9. | 9/28/09 | Informed search: Admissible and consistent heuristics | slides 89-92 | |
| 10. | 9/30/09 | Informed search: WA* search Constraint-satisfaction problems |
slides 93-99 | |
| 11. | 10/02/09 | Chronological backtracking; AC-3 algorithm | slides 100-107 | |
| 12. | 10/05/09 | Local search algorithms; Hill-climbing; Random restarts | slides 108-113 | Assignment 3 |
| 13. | 10/07/09 | Simulated annealing; Adversarial search; Minimax theorem | slides 114-122 | |
| 14. | 10/09/09 | The minimax search algorithm | slides 123-126 | |
| 15. | 10/12/09 | Alpha-beta pruning | slides 127-132 | |
| 16. | 10/14/09 | Knowledge-based agents; Logic: Entailment, models, inference; Propositional logic | slides 133-142 | |
| 10/15/09 | First exam 5:00PM-7:00PM in HS 208 | |||
| 17. | 10/16/09 | Satisfiability, validity, and inference rules for propositional logic | slides 143-150 | |
| 18. | 10/19/09 | Proofs in and limitations of propositional logic | slides 151-154 | |
| 19. | 10/21/09 | More proofs in propositional logic | no new slides | Assignment 4 |
| 20. | 10/23/09 | Introduction to first-order predicate calculus | slides 155-162 | |
| 21. | 10/26/09 | Inference rules for FOL; forward chaining | slides 163-169 | |
| 22. | 10/28/09 | Backward chaining | slides 170-172 | |
| 23. | 10/30/09 | Conversion to Conjunctive Normal Form | slides 173-178 | Assignment 5 - Part A |
| 24. | 11/2/09 | Resolution | slides 179-182 | Assignment 5 - Part B |
| 25. | 11/4/09 | Resolution strategies; Discussion of assignment 4 | ||
| 26. | 11/6/09 | Introduction to Prolog | Slides 183-187 | |
| 27. | 11/9/09 | Discussion of Assignment 5 - Part A; Declarative versus procedural meaning in Prolog | Slides 188-194 | |
| 28. | 11/11/09 | Discussion of Assignment 5 - Part B; Q&A for second exam | ||
| 11/12/09 | Second exam 5:00PM-7:00PM in HS 208 | |||
| 29. | 11/13/09 | Manipulating numbers and lists in Prolog | Slides 195-199 | Assignment 6 |
| 30. | 11/16/09 | Controlling backtracking using the "cut" | Slides 200-20? | |