Notes and Slides
Week 1 - 2: Introduction and review of some mathematical notations
 |
Chapter 1 Introduction |
|
Note for week 1 and 2 (Last update: January 26) |
Week 3: Search
|
Chapter 3 Solving Problem as Seach |
|
Note on Search Part 1 |
Week 4 and 5: Informed Search
|
Chapter 4 Informed Seach and Local Search algorithms (updated Feb 26) |
|
Note on Search Part 2 (updated Feb 14) |
|
Further reading: application of generic search in bioinformatics and application of genetic algorithm in bioinformatics. |
Week 6: Constraint Satisfaction Problems
|
Chapter 5: CSP |
|
My note on CSP (Updated Feb 26) |
Week 7: Knowledge Based Agents
|
Chapter 7: Logical Agents |
|
My note on propositional logic (Updated March 7) |
Week 9-12: Continue with Chapter 7
|
|
Extra Programming project: Design and develop an algorithm to solve the problem of tagSNP selection. Evaluation criteria: 10% of the total grade if the program is workable according to the specification of the FESTA system (http://www.sph.umich.edu/csg/qin/FESTA) in that it can accept inputs as FESTA and compute a correct solution; 15% of the total grade if your program is comparable in performance with FESTA. |
|
|
My note on first order logic (Update April 5) |
|
|
A first order logic theory about circuit (Update April 5) |
Chapter 9: Inference in First order logic
Week 13-14: Situation Calculus Optional homework
|
Note on situation calculus (Updated April 30) |
Week 15: Action Languages
|
Note on action language (Updated May 1) |
|