Search algorithms including BFS, DFS, iterative deepening and A*, radomized search algorithms including Walksat, syntas and semantics of first-order logic (FOL), knowledge representation in FOL including reasoning, basic reasoning with probabilities, basic Bayesian learning.
Introductory course in artificial intelligence programming, concentrating on the use of the LISP and Prolog languages. Familiarity with computer programming, especially the ideas of procedural abstraction, recursion, list and tree data structures, and elementary tree traversal algorithms is presupposed.
3 hours of lecture per week, 1 hour of discussion section, and 8 hours of outside preparation.
Please see Prerequisites page.
Restricted to undergraduate students with sophomore, junior, and senior standing within the CS25, CS26, CS27, CS28, and EC26 majors. Graduate students will be allowed as space permits.
One quarter per year, normally in the Winter. Please see Tentative Course Offerings page.
Formerly CSE 162