Professor: Dr. Thomas R. Ioerger
| email: | ioerger@cs.tamu.edu |
| office: | 438 Peterson |
| office hours: | Tues, 1:30-3:00 |
TA: Jeff Hykin
| email address: | jeff.hykin@tamu.edu |
| office hours: | Tues, Thurs, 5:15-6:15 (after class) |
| location: | 124 HRBB |
Meeting: TR, 3:55-5:10, 124 HRBB
Textbook: Artificial Intelligence: A Modern Approach, 4th US ed. (2020) Stuart Russell and Peter Norvig.
Course Web Page: http://faculty.cs.tamu.edu/ioerger/cs420-spr22/index.html (this page)
Syllabus (contains information about projects, exams, grading policy, etc)
| topic | concepts | reading | assignments | |
|---|---|---|---|---|
| Tues, Jan 18 | What is AI? | perspectives on AI; core concepts | Ch. 1; slides | |
| Thurs, Jan 20 | ||||
| Tues Jan 25 | Uninformed Search | BFS, DFS, iterative deepening | Ch. 3; slides | |
| Thur Jan 27 | complexity analysis, GraphSearch, Uniform Cost | |||
| Tues Feb 1 | Informed/heuristic Search | heuristics, Greedy, A* | hand out A1; probs.zip | |
| Thur Feb 3 | optimality | |||
| Tues Feb 8 | Iterative Improvement | hill-climbing, simulated annealing | Ch. 4.1; slides | |
| Thur Feb 10 | genetic algorithms | |||
| Tues Feb 15 | Game Search | minimax, alpha-beta pruning | Ch. 5; slides | |
| Thur Feb 17 | board eval functions; Deep Blue | |||
| Tues Feb 22 | Constraint Satisfaction | back-tracking search, CSP heuristics, | Ch. 6; slides | A1 due; hand out A2 |
| Thur Feb 24 | AC-3; min-conflicts | |||
| Tues Mar 1 | Propositional Logic | syntax, semantics/models, entailment, ROI | Ch. 7; slides | |
| Thur Mar 3 | *** exam 1 *** | |||
| Tues Mar 8 | Inference algorithms | natural deduction proofs, FC, BC | ||
| Thur Mar 10 | resolution refutation, conversion to CNF | A2 due; hand out A3 | ||
| Tues Mar 15 | (Spring Break) | |||
| Thur Mar 17 | (Spring Break) | |||
| Tues Mar 22 | Satisfiability | DPLL; hard problems; WalkSAT | ||
| Thur Mar 24 | FOL | syntax, semantics (models), ontologies | Ch. 8; slides | |
| Tues Mar 29 | Inference in FOL | Rules of Inference, unification, Natural Deduction proofs | Ch. 9 | A3 due; hand out A4 |
| Thur Mar 31 | Resolution in FOL, conversion to CNF, Herbrand's Theorem | |||
| Tues Apr 5 | Forward-chaining; Backward-chaining | |||
| Thur Apr 7 | PROLOG | Prolog slides, Prolog mini-tutorial | ||
| Tues Apr 12 | Uncertainty | default reasoning, nonmonotonic logics, negation in Prolog | Ch. 10.6 slides | |
| Thur Apr 14 | Probabilistic Knowledge Representation, Bayes' Rule | Ch. 12 (skip 12.6-7) | hand out A5 | |
| Tues Apr 19 | Planning | Sit Calc, Frame Prob, PDDL, Forward SSS | Ch. 11 (skip 11.3-11.5); slides | A4 due |
| Thur Apr 21 | goal regression; other types of planners | |||
| Tues Apr 26 | Intelligent Agents | Ch. 2; slides | A5 due (3:55pm) solutions HARD DEADLINE, NO LATE HOMEWORKS ACCEPTED hand out A6 | |
| Thur Apr 28: | ***exam 2*** | |||
| Mon, May 9, 3:00pm | (finals week) | Assignment A6 due at 3:00pm | ||