Course Syllabus CISC481/681
Artificial Intelligence -- Spring 2012
Tuesday, Thursday 9:30-10:45am, 74 Drake Hall (QDH)
| Course Description | Prerequisites | Tentative Topics | Grading | Course Grade | Policies |
| Instructor: Dr. Kathy McCoy | TA: Marcos Portnoi |
| Office: Room 108 100 Elkton Road HLT Lab aka "The Tea House" |
Office: 103 Smith Hall |
| Hours: Thursday 3:00pm-5:00pm | Hours: Wednesday 2:30am-4:30pm |
| Email: mccoy@cis.udel.edu | Email: mportnoi@udel.edu |
| Phone: 831-1956 |
Textbooks:
Artificial Intelligence a Modern Approach, Third Edition, by Stuart Russell and Peter Norvig
ANSI Common Lisp by Paul Graham (recommended)
Course Project Number: ????
The course is intended as an introduction and survey of the field of Artificial Intelligence (AI). We will survey basic, fundamental concepts and techniques that underlie many AI applications with an emphasis on symbolic AI. Techniques covered include problem representaiton, problem solving via search, resolution-based reasoning, planning, uncertain knowledge and reasoning, and machine learning. Programming competence, especially use of data structures such as lists and trees, and familiarity with predicate calculus. (Equivalent of CISC220, CISC280/CISC108 and CISC304.)
| Tentative Topics | Readings |
| Introduction, Overview, Intelligent Agents | R&N - Chpt 1, 2 |
| Lisp (extra classes) |
Graham - Chpts 2-10 |
| Problem Formulation and Search | R&N - Chpt 3-4.2, p. 129 (2nd Edition Chpt 3-4-4.5, p. 115) |
| Game Playing | R&N - Chpt 5 (2nd Edition, Chpt 6) |
| Constraint Satisfaction | R&N - Chpt 6 (2nd Edition, Chpt 5 through 5.2, p. 150) |
| Knowledge Representation (Propositional Logic-Based) | R&N - Chpt 7 (through 7.5) |
| Knowledge Representation (First-order Logic-Based) | R&N - Chpt 8 (through 8.3) |
| Inference in First Order Logic | R&N - Chpt 9 |
| Structured Knowledge Representations | 2nd Edition - R&N - Chpt 10 (through p. 324; 10.3 - p. 334)(3rd Edition - 10.4.2) |
| Planning | 2nd Edition - R&N - Chpt 11 (through 11.4) (3rd edition 10.3 covers GraphPlan) |
| Learning | R&N - Chpt 18 (through 18.4) |
| Uncertainty | R&N - Chpt 13 |
| Probabilistic Reasoning | R&N - Chpt 14 (through 14.4) |
| Hierarchical Planning | R&N - Chpt 11.2 |
| Statistical Learning Methods | R&N - Chtp 20.1 |
| Additional Learning Methods | R&N - Chpt 18 (other sections) |
Programs are due at the start of class (9:30 am) on the announced due date. Any program turned in after they are due will be penalized 15% of the total points for each 24 hours that it is turned in after 9:30am on the due date. (Saturdays and Sundays do not count in determining penalties.)
Late programs my be turned in to the instructor's mailbox or office but must be computer dated, and must include the date and time that they were actually put in the instructor's mailbox. If the date or time is falsified, the penalty will be doubled. If you are turning a program in at the instructor's office and the instructor is not in, you may leave it on a desk chair. Always send the instructor email to let her know that a program has been turned in so that it is not missed.
In exceptional cases, a student may request an extension on a program -- this must be done in advance of the due date.
The grading of the programs will be based on their documentation, coding clarity and style (including things like indentation), testing (including testing of important helping functions that are not fully tested by running the entire program), and correctness and efficiency of the solution. The coding and documentation styles will be discussed in class.
I do not plan to lecture on lisp, but will schedule additional classes for those who are not familiar with the language.
Midterm: Thursday, March 15, 2012
Final: Scheduled Date (Tentative): Tuesday, May 22, 2012, 10:30-12:30
The approximate weights of the individual items are as follows:
Deadlines are at the start of class (e.g., 9:30am)
on the due date.
Assignments will be collected at that time.
Any homework sets turned in after they have been collected may be
graded but will be recorded as a 0.
Programming assignments are due at the start of class (e.g., 9:30am)
on the due date. After that time,
the programming assignments will be given a 15% penalty for every 24
hours after the
due date.
Late programming assignments turned in to my mailbox (in 103
Smith Hall) or to my office (in 100 Elkton Road) must be computer dated,
and must include the time that they actually reached my box.
Always send me email to let me know that an assignment has
been turned
in so I do not miss it.
Excuses for late assignments will be considered ONLY if I am notified
in advance.
As per the university policies, excused absences require a written
note (for example, from a doctor).
All work turned in for grading must be your own. Please keep in mind that code or homework solutions downloaded from the web is NOT your own. Downloading answers to homework or assignments is plagiarism and is strictly forbidden according to the University's Code of Conduct. You can consult with others about conceptual problems with assignments (unless it is explicitly forbidden for a particular assignment) and for debugging. Any evidence of collaboration other than this will be considered cheating and will be prosecuted according to the university policies on this matter.