Please note that all dates except the final exam are tentative. My primary concern is that you master the material and the schedule may be adjusted in either direction to optimize comprehension and scope of material. The units in Russell and Norvig corresponding to material are listed on the first slide of each slide deck.
There is a special election this fall. If you are a US citizen and have not registered to vote, please consider doing so now. California voters can do so online: https://covr.sos.ca.gov/. Democracies only work when the public participates.
- Aug 24 – Foundations of AI
August 30th is the Last day to register to vote in California recall election
- Aug 31 – Problem formulation and uninformed search
- Sep 7 – Heuristic search
- Sep 14 – Constraint satisfaction problems (CSP)
Tuesday September 14th is California recall election. Vote if you are eligible.
- Sep 21 – (CSP), Learning: supervised methods
- Sep 28 – Learning: supervised & unsupervised methods
- Oct 5 – Learning: unsupervised method, Deep neural networks
- Oct 12 – Midterm Tue Oct 12, Deep neural networks
- Oct 19 – Computer Vision
- Oct 26 – Propositional logic
- Nov 2 – Uncertainty: Bayes’ rule, probability models, Bayesian network, hidden Markov models
- Nov 9 – Uncertainty continued, no class on Veteran’s Day: Thu Nov 11
- Nov 16 – Professor Roch at conference (work on project)
- Nov 23 – Natural language processing (NLP), no class on Thanksgiving: Thu Nov 25
- Nov 30 – NLP continued
- Dec 7 – Speech recognition
Final exam is Tuesday, December 14th from 3:30 PM – 5:30 PM in our normal class room.
- Russell, S. J., and Norvig, P. (2021). Artificial intelligence: a modern approach (Prentice Hall, Upper Saddle River), pp. xviii, 1115 pp.
Programming exercises will be implemented using Python 3. While we have created a Python quick start video that is available on Canvas, we will not be devoting much time to how to program in Python as upper division computer scientists should have the skills to learn new languages without an extraordinary effort. I am more than happy to help you with questions that you may have about Python during office hours. Optional books to help you with this are freely available from SDSU Library through Safari Technical Books:
- Lutz, M. (2015). Learning Python, 5th Edition, O’Reilly Media, Sebastapol, CA
- Martelli, A., Ravenscroft, A., and Holden, S. (2017). Python in a Nutshell, 3rd Edition, O’Reilly Media, Sebastapol, CA) or
- Reitz, K. (2016). The Hitchhiker’s Guide to Python: Best Practices for Development (O’Reilly Media, Sebastopol)
In addition, the python.org’s tutorial is also quite good. If you prefer to watch videos to reading, you might want to try Jessica McKellar’s Introduction to Python on Safari.
Python is rapidly becoming one of the most popular languages for AI. This is primarily due to a large number of scientific libraries such as NumPy and SciPy coupled with popular machine learning language libraries such as scikit-learn, TensorFlow, and PyTorch. Python can be downloaded from the Python Software Foundation if it is not already available on your machine. When your code is graded, it will be executed on Python 3.8. We recommend using 3.8 for your development.
You are welcome to use any integrated development environment (IDE) that you wish. There are many popular IDEs for Python (Computerworld has a 2016 review covering some of the more popular ones). I personally have used both eclipse with the pydev extension and PyCharm, both of which have free versions. PyCharm has a professional version that is free to students although you must register.
About the course:
Students will master a number of basic areas in artificial intelligence.
After successful completion of the course, students will be able to:
- Construct intelligent agents capable of interacting with their environments.
- Understand and implement heuristic searches for problem solving and game playing (adversarial search)
- Understand first-order logic and its application to theorem proving.
- Analyze constraint satisfaction problems and resolve them through search.
- Understand and be able to apply machine learning algorithms
Prerequisites: CS 310 Data Structures, Mathematics: Discrete Math (245) or Mathematical Logic (523)
Course meets Tu/Th from 4-5:15 PM in AH 3177. Office hours will be held via Zoom (see Canvas for link), times are listed in the sidebar.
TA: Mr. Jordan Mata
Please see syllabus for detailed course policies.