CIS603
S03
Artificial Intelligence
Course Information - Topics
The class covers fundamental and advanced topics in Artificial Intelligence:
-
Search: uninformed search, heuristic search, A*, game search.
-
Planning: deterministic planning, STRIPS planning, nonlinear planning.
-
Theorem proving: propositional calculus, first order logic, inference with
clauses, resolution.
-
Heuristics for NP hard problems: optimizations, simulated annealing, genetic
algorithms.
-
Knowledge Representation: inference rules, models of computation, semantics,
semantic nets, frame-based.
-
Probabilistic inference: uncertainty, Bayesian inference, Bayesian belief
networks, HMMs, Markov random fields, planning in stochastic domains.
-
Learning: Concept learning, PAC learning, inductive learning, decision trees,
neural networks.
-
Programming languages for AI: Lisp (Scheme), Prolog.
-
Other topics: Robotics, Computer Vision, Natural language processing.
Instructor
- Vasilis Megalooikonomou, email: vasilis@cis.temple.edu
- Office: 314 Wachman Hall, phone: 215-204-5774
- Office Hours: M 1-2pm, W 3-5pm and by appointment
Class
- Meets: M 4:40-7:10pm (classes will have two parts:
the first 4:40-5:50 and the second 6:00-7:10),
room: TL 305B
Prerequisites
- CIS511 or equivalent. If you have not taken this course, please see me asap.
E-mail
-
The mailing list cis603-s03@listserv.temple.edu will be created for the
class and it will be used to send messages about the presentations, projects, and other
topics. Please send an email to vasilis@cis.temple.edu to be added to the list.
I expect that you read your email regularly. Otherwise you may
miss important information.
Web Page
-
The web page for the course is
http://www.cis.temple.edu/~vasilis/Courses/CIS603. This page
will contain handouts, and other information related to CIS 603.
Text
- Required:
Artificial Intelligence: A modern Approach by Russell and Norvig.
Available at the Temple Bookstore.
- Optional:
The Structure and Interpretation of Computer Programs by Sussman and Abelson.
Introduction to Artificial Intelligence by Winston.
Essentials of Artificial Intelligence by Ginsberg.
Homework
- There will be homework assignments, generally every two weeks,
with written assignments to alternate with programs. The written problem
description and related material will be given in class or will be available
on the web page for the course. A few details on the homework assignments:
- Start early: The written problems will require
thought. It will be hard to solve them the night before they are due.
Some homeworks will be in Lisp and Prolog and you will need time to get
used to these languages and the programming environment.
- Software: You will be using Lisp and Prolog.
Exams, Project and Grading
- Homeworks: 20%
- Project: 25%
- Midterm: 20%
- Final: 30%
- Class Participation: 5%
Late Policy: The homework assignments are due in
class, on the specified due date. No late submissions will be accepted.
For fairness, this policy will be strictly enforced.
Exams: All aids are allowed (open books, open notes, calculators,
etc).
Project
- The course load involves a project. The goal of
this project is to give students the opportunity to tackle an
interesting problem, which may lead to a publication.
Disabilities
I encourage students with disabilities, including "invisible" disabilities
such as chronic diseases and learning disabilities, to discuss with us any
appropriate accomodations that we might make on their behalf.
Switch to:
vasilis@cis.temple.edu