Professor: Dr. Thomas R. Ioerger
Office: | 322C Bright Bldg. |
Phone: | 458-5518 |
email: | ioerger@cs.tamu.edu |
office hours: | Wed, 11:10-12:00 (after class) |
TA: Eric Nelson
email: | ejn8411@tamu.edu |
office: | RDMC-B021 |
office hours: | Tues, 2:00-3:00 |
Meeting: MWF, 10:20-11:10, HRBB 113
Course Web Page: http://www.cs.tamu.edu/faculty/ioerger/cs625-spr15/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 (or an equivalent undergraduate course on data structures and algorithms)
Textbook
Course Objectives
The work for this course will consist of 11 programming assignments. There will be no exams. The final grade for the course will be determined from the weighted-average of assignment scores as follows:
The penalty for late assignments is -5% per day (pro-rated
over 24 hours).
After 10 days late, the deductions cease, and 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.
P1 | due Feb 2 | Search | compare DFS, BFS, and BestFirst on map navigation | P1 handout ; ATM.graph data file |
P2 | due Feb 13 | A* | implement a heuristic to solve Blocksworld problems | P2 handout |
P3 | due Feb 23 | SA | use Simulated Annealing to solve TSP for tour of Texas | P3 handout, input file, mapping tool |
P4 | due Mar 4 | CSP | backtracking search with MRV heuristic | P4 handout |
P5 | due Mar 13 | Game AI | Othello competition using Minimax search (+ board eval function) | P5 handout, play online, rules of othello |
P6 | due Mar 25 | Reso | solve Sammy's Sport Shop in propositional logic using resolution refutation | P6 handout |
P7 | due Apr 6 | DPLL | Boolean satisfiability solver, use to solve Farmer-Fox-Chicken-Grain problem via SatPlan | P7 handout |
P8 | due Apr 24 | Prolog | practice problems | P8 handout |
P9 | due May 8 | GoalReg | goal-regression planner for Blocksworld | P9 handout |
assignment | topic | concepts | reading | |
---|---|---|---|---|
Wed Jan 21 | (first day of class) | What is AI? | perspectives on AI | Ch. 1 |
Fri, Jan 23 | Search Algorithms | DFS, BFS, BestFirst, UC, ID, A* | Ch. 3 | |
Mon, Jan 26 | ||||
Wed, Jan 28 | ||||
Fri, Jan 30 | ||||
Mon, Feb 2 | P1 due (Search) | Iterative improvement | hill-climbing, simulated annealing | Ch. 4 |
Wed, Feb 4 | ||||
Fri, Feb 6 | ||||
Mon, Feb 9 | Game-Playing | minimax, alpha-beta pruning | Ch. 5 | |
Wed, Feb 11 | ||||
Fri, Feb 13 | P2 due (A*) | |||
Mon, Feb 16 | Constraint-Satisfaction | back-tracking, MRV, AC-3 | Ch. 6 | |
Wed, Feb 18 | ||||
Fri, Feb 20 | ||||
Mon, Feb 23 | P3 due (SA) | Propositional Logic |
syntax, semantics propositional inference algs: natural deduction | Ch. 7 |
Wed, Feb 25 | ||||
Fri, Feb 27 | ||||
Mon, Mar 2 | resolution refutation proof procedure | |||
Wed, Mar 4 | P4 due (CSP) | |||
Fri, Mar 6 | satifiability algs: DPLL, WalkSat | |||
Mon, Mar 9 | class cancelled | |||
Wed, Mar 11 | in-class help session, pre-competition | |||
Fri, Mar 13 | P5 due (othello) | |||
Mon, Mar 16 | (Spring Break) | |||
Wed, Mar 18 | in-class help session | |||
Fri, Mar 20 | (Spring Break) | |||
Mon, Mar 23 | First-Order Logic | syntax, semantics | Ch. 8 | |
Wed, Mar 25 | P6 due (reso) | |||
Fri, Mar 27 | FOL inference methods | Ch. 9 | ||
Mon, Mar 30 | ||||
Wed, Apr 1 | ||||
Fri, Apr 3 | class cancelled (reading day) | |||
Mon, Apr 6 | P7 due (DPLL) | unification | ||
Wed, Apr 8 | resolution in FOL, Herbrand's Theorem | |||
Fri, Apr 10 | back-chaining | |||
Mon, Apr 13 | Prolog | |||
Wed, Apr 15 | arithemetic in Prolog | |||
Fri, Apr 17 | negation in Prolog | |||
Mon, Apr 20 | Defaults and Exceptions | |||
Wed, Apr 22 | Planning | Situation Calculus | Ch. 10 | |
Fri, Apr 24 | P8 due (Prolog) | Frame Problem | ||
Mon, Apr 27 | STRIPS operators, Goal Regression | Weld (1994) | ||
Wed, Apr 29 | Uncertainty (probability) | Bayes Rule, conditional independence, utility | Ch. 13 | |
Fri, May 1 | Bayesian networks | exact inference, belief propagation, HMMs | Ch. 14, slides | |
Mon, May 4 | ||||
Tues, May 5 | last day of class (redefined day) | |||
Fri, May 8 | P9 due (Goal Regr) | |||
Mon, May 11 | No final exam | |||