Professor: Dr. Thomas R. Ioerger
Office: 322C Bright Bldg.
Phone: 845-0161
email: ioerger@cs.tamu.edu
office hours: Tues, 1:00-2:00, or by appointment
TA: Jaewook Yoo
email: jwookyoo@neo.tamu.edu
office hours: Mon, Wed, 12:30-1:30pm, HRBB 339
Meeting: MWF, 10:20 am-11:10, HRBB 113
Course Web Page: http://www.cs.tamu.edu/faculty/ioerger/cs625-fall12/index.html
Course Description (from TAMU course catalog): Basic concepts and methods of artificial intelligence; Heuristic search procedures for general graphs; game playing strategies; resolution and rule based deduction systems; knowledge representation; reasoning with uncertainty.
Prerequisites: CSCE 221 (Data Structures and Algorithms)
Textbook
Russell, S. and Norvig, P. (2002). Artificial Intelligence: A Modern Approach. 3rd edition (blue cover). Prentice Hall.
Course Objectives
The work for this course will consist of a mix of homework assignments, programming projects, and exams. The final grade for the course will be a weighted combination of these three components, which is tentatively set as follows: 50% homework/programming projects, 50% exams. There will most likely be 2 mid-term exams and a final exam. The minimum score for an grade of an A will be 90%, the minimum for a B will be 80%, 70% for C, and so on, though these thresholds may be lowered depending on the performance of the class overall.
The penalty for late assignments is -5% per day (pro-rated
over 24 hours).
After 10 days late, the deductions cease; the maximum
loss of points is 50%. As long as you
turn an assignment in by the end of the semester, it could still be
worth as much as half-credit. This is to encourage you to eventually complete
the assignment, even if you can't get it in on time initially.
Mon, Aug 27 | first day of class; core concepts | ||||||||||||||||||
Wed, Aug 29 | perspectives on AI | read Ch. 1 | |||||||||||||||||
Fri, Aug 31 | (discussion continued) | ||||||||||||||||||
Mon, Sep 3 | Search Algorithms | read Ch. 3 (skip 3.5.3) | |||||||||||||||||
Wed, Sep 5 | iterative deepening | ||||||||||||||||||
Fri, Sep 7 | heuristics | ||||||||||||||||||
Mon, Sep 10 | A* search | ||||||||||||||||||
Wed, Sep 12 | optimality and efficiency of A* | ||||||||||||||||||
Fri, Sep 14 | hill climbing, simulated annealing | read Ch. 4.1 | |||||||||||||||||
Mon, Sep 17 | TSP, genetic algorithms | Project #1 due | |||||||||||||||||
Wed, Sep 19 | Game-playing, minimax search | Ch. 5 (skip 5.6) | |||||||||||||||||
Fri, Sep 21 | alpha-beta pruning | ||||||||||||||||||
Mon, Sep 24 | Constraint Satisfaction | Ch. 6 (skip 6.3.3 and 6.5) | |||||||||||||||||
Wed, Sep 26 | heuristics, AC-3 | ||||||||||||||||||
Fri, Sep 28 | local search for CSP | Project #2 due | |||||||||||||||||
Mon, Oct 1 | Mid-term Exam #1 | ||||||||||||||||||
Wed, Oct 3 | Propositional Logic | Ch. 7 (skip 7.7 for now) | |||||||||||||||||
Fri, Oct 5 | natural deduction proofs | ||||||||||||||||||
Mon, Oct 8 | forward- and backward-chaining | ||||||||||||||||||
Wed, Oct 10 | resolution | ||||||||||||||||||
Fri, Oct 12 | DPLL, WalkSAT | ||||||||||||||||||
Mon, Oct 15 | First-Order Logic, syntax | Ch. 8; Homework #3 due, solutions | |||||||||||||||||
Wed, Oct 17 | semantics (model theory) | ||||||||||||||||||
Fri, Oct 19 | ontologies, axiomatizing numbers, quantities | ||||||||||||||||||
Mon, Oct 22 | temporal reasoning, Events and Interval Logic | read Sec 12.1-12.3 | |||||||||||||||||
Wed, Oct 24 | inference in FOL; unification | read Ch. 9; Homework #4 due, solutions | |||||||||||||||||
Fri, Oct 26 | natural deduction, resolution in FOL | ||||||||||||||||||
Mon, Oct 29 | Herbrand's Theorem | ||||||||||||||||||
Wed, Oct 31 | Rete, Expert Systems, Logic Programming (PROLOG) | ||||||||||||||||||
Fri, Nov 2 | Description Logics | Sec. 12.5.2; Homework #5 due, solutions | |||||||||||||||||
Mon, Nov 5 | Mid-term Exam #2 | ||||||||||||||||||
Wed, Nov 7 | Default Reasoning (semantic nets, non-monotonic logics, negation in Prolog) | Sec. 12.5-12.6 | |||||||||||||||||
Fri, Nov 9 | probability, Bayes rule | Ch. 13 | |||||||||||||||||
Mon, Nov 12 | |||||||||||||||||||
Wed, Nov 14 | Bayesian networks | Ch. 14.1, 14.2, 14.4 | |||||||||||||||||
Fri, Nov 16 | Reasoning about action, situation calculus | Sec. 7.7, 10.4.2 | |||||||||||||||||
Mon, Nov 19 | Frame Problem, PDDL | Ch. 10; Homework #6 due | |||||||||||||||||
Wed, Nov 21 | goal regression | see also sec 3.2 of
Weld, 1994
Fri, Nov 23 | Thanksgiving break (no class) | Mon, Nov 26 | partial-order (nonlinear) planning, GraphPlan, SatPlan |
due | Wed, Nov 28 | other planning algorithms | Ch. 11; Homework #7 due | Fri, Nov 30 | Intelligent Agents | Ch. 2 | Mon, Dec 3 | last day of class |
Homework #8 due,
solutions | Tues, Dec 11 | Final Exam, 8:00-10:00 | |