Artificial Intelligence for HEDSPI program |
|
Lectures
|
LECTURESLecture 1. IntroductionLecture 3. Problem solving by searching (1) – Basics of searching Lecture 4. Problem solving by searching (2) – A* search Lecture 5. Problem solving by searching (4) – alpha-beta pruning Lecture 6. Logics and knowledge-based inference – Propositional logic Lecture 7. Logics and knowledge-based inference – First-order logic Lecture 8. Logics and knowledge-based inference – First-order logic (continue) Lecture 9. Machine Learning, Decision Tree Learning Lecture 10. Reinforcement Learning Note for final exam: 90', open materials, no electronic devices. Please bring your calculator with you. Limitations for the early final exam on Dec. 20th: all lectures (pay attention to exercises but you may still have theory questions) excepts Robinson's resolution, forward chaining and backward chaining for First Order Logic, reinforcement learning. Normal final exam: everything you have studied (pay attention to exercises but you may still have theory questions)
|
Lê Thanh Hương - Department
of Information Systems - School of Information and Communication Technology
- HUST Email: huonglt@soict.hust.edu.vn |