Professor: Dr. Thomas R. Ioerger
email: | ioerger@cs.tamu.edu | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
office hours: | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
email address: | devesh@tamu.edu | |
Zoom link: | https://tamu.zoom.us/j/9456737206 | |
office hours: | Mon, 4:00-6:00 | |
Meeting: MWF 12:00-12:50, ONLINE
Zoom link for lectures: https://tamu.zoom.us/j/92276910648?pwd=QnJmNlZjZFhyTjNNMTI1K0MwbEFFZz09
Course Web Page: http://faculty.cs.tamu.edu/ioerger/cs420-spr21/index.html (this page)
Syllabus (contains information about projects, exams, grading policy, etc)
Materials for projects (i.e. handouts, source code, data files) will be posted on the course project site
on the TAMU Github server https://github.tamu.edu/ioerger/cs420-spr21.
Students will be expected to clone this repository and pull updates throughout the semester.
topic | concepts | reading | assignment | |
---|---|---|---|---|
Wed, Jan 20 | What is AI? | perspectives on AI; core concepts | read Ch. 1 | |
Fri, Jan 22 | ||||
Mon, Jan 25 | Search Algorithms | BDS, DFS | Ch. 3 (you can skip 3.5.3-3.5.6) | |
Wed, Jan 27 | iterative deepening | |||
Fri, Jan 29 | heuristics; Greedy Search | |||
Mon, Feb 1 | A* search | |||
Wed, Feb 3 | Iterative Improvement | hill-climbing | Sec. 4.1 | |
Fri, Feb 5 | beam search; simulated annealing | |||
Mon, Feb 8 | genetic algorithms | |||
Wed, Feb 10 | Game Search | minimax, alpha-beta pruning | Ch. 5 | |
Fri, Feb 12 | board eval functions, expectiminimax, Deep Blue, Monte Carlo tree search, AlphaGo | |||
Mon, Feb 15 | (class canceled due to winter storm) | |||
Wed, Feb 17 | (class canceled due to winter storm) | |||
Fri, Feb 19 | (class canceled due to winter storm) | |||
Mon, Feb 22 | Constraint Satisfaction | back-tracking search, CSP heuristics | Ch. 6 (skip 6.5) | |
Wed, Feb 24 | constraint propagation, AC-3 | |||
Fri, Feb 26 | min-conflicts algorithm | |||
Mon, Mar 1 | Propositional Logic | syntax, semantics | Ch. 7 | |
Wed, Mar 3 | inference; Natural Deduction | |||
Fri, Mar 5 | forward chaining, backward chaining | Project 2 due | ||
Mon, Mar 8 | backward chaining | |||
Wed, Mar 10 | resolution refutation | |||
Fri, Mar 12 | Satisfiability, DPLL | |||
Mon, Mar 15 | First-Order Logic | syntax | Ch. 8 | |
Wed, Mar 17 | usage, translating knowledge to FOL | |||
Thursday, Mar 19 | (redefined day due to Spring Break on Fri) | semantics (model theory) | ||
Mon, Mar 22 | FOL rules of inference, unification | Ch. 9 | Project 3 due | |
Wed, Mar 24 | Natural Deduction in FOL | |||
Fri, Mar 26 | Resolution in FOL; Forward-chaining | |||
Mon, Mar 29 | Backward-chaining; PROLOG | |||
Wed, Mar 31 | Prolog | tutorial | ||
Fri, Apr 2 | (class canceled, Reading Day) | |||
Mon, Apr 5 | Knowledge Engineering, Ontologies | Ch. 10 (skip 10.4) | ||
Wed, Apr 7 | Event Calculus, Interval Logic | |||
Fri, Apr 9 | Description Logics, Semantic Web | Project 4 due | ||
Mon, Apr 12 | Uncertainty Reasoning | Limitations of FOL: handling defaults and exceptions | Sec 10.6 | |
Wed, Apr 14 | Negation in PROLOG | |||
Fri, Apr 16 | Bayesian Probability and Uncertainty Reasoning | Ch. 12 (skip 12.6 and 12.7) | ||
Mon, Apr 19 | Planning Algorithms | PDDL, Forward State-space search | Ch. 11 (skip 11.3-11.5) | |
Wed, Apr 21 | Goal Regression | |||
Fri, Apr 23 | Other planning algorithms | |||
Mon, Apr 26 | Intelligent Agents | agent characteristics and environments | Ch. 2 | |
Wed, Apr 28 (last day of class) | agent architectures | Project 5 due | ||
Fri, Apr 30 (Reading Day) (regular class time and Zoom link; attendance optional) | review session | |||
Wed, May 5, 11:00-1:30 | final exam | |||