CSE 630: Survey of Artificial Intelligence I: Basic Techniques
MWF 12:30-1:18, DL 305
Prof. Eric Fosler-Lussier
Email: f*o*s*l*e*r**@remove*#$punct_cse.ohio-state.edu
Office: DL 585
Office hours: TBA
TA: Tim Weale (likely)
Email: w*e*a*l*e**@remove*#$punct_cse.ohio-state.edu
Office: DL 580
Office hours: TBA
Description
A survey of the basic concepts and techniques of problem solving paradigms and knowledge representation schemes in Artificial Intelligence (AI).
Level, Credits, Class Time Distribution, Prerequisites
| Level | Credits | Class Time Distribution | Prerequisites |
|---|
| UG | 3 | 2cl | CSE 222 and Math 366 |
Quarters Offered, General Information, Exclusions, Cross-Listings, etc.
Objectives
-
Master basic search techniques for problem solving, including systematic blind
searches, heuristically guided searches, and optimal searches
-
Be familiar with game-tree search methods and the requirements for expert-level
game play
-
Be familiar with logic and proof as a basis for knowledge representation and
automated reasoning
-
Be familiar with semantic nets and frame systems as knowledge-representation
formalisms
-
Be exposed to problems in common sense reasoning and language understanding
-
Be exposed to integrated AI architectures as a platform for building AI systems
-
Be exposed to machine learning techniques and the kinds of problem they solve
Text:
- Artifical Intelligence, A Modern Approach
by Russell and Norvig, second edition, Prentice Hall, 2002
Topics
| Number of Weeks | Topics |
| 2 |
Basic representation and problem solving methods |
| 2 |
Search techniques |
| 2 |
Knowledge represention using logic |
| 2 |
Machine Learning or Probabilistic Inference |
| 1 |
Planning and common sense reasoning |
| 1 |
Perception and Communication |
Policy on Academic Misconduct
As with any class at this university, you are required to follow the
Ohio State "Code of Student Conduct." If you are unfamiliar with this
policy, you should read it at http://studentaffairs.osu.edu/pdfs/csc_12-31-07.pdf.
In particular, you should note that you are not allowed to, among
other things, (a) knowingly provide or receive information during
exams, (b) knowingly provide or receive assistance on homeworks unless
I say it's OK, and (c) submit plagiarized (copied but unacknowledged)
work for credit. If I suspect that any violation occurs, I am
required to report the violation to the Council on Academic
Misconduct. COAM will determine the guilt or innocence and
appropriate penalties if any.
Grading Plan
This is the approximate weighting of the different components of this course:
| Homeworks | 30% |
| Midterm exams | 40% |
| Final Exam | 30% |
There are 6 homework assignments, some with programming and some
pencil and paper; the top five scores will count towards the homework
portion of the grade. You can drop the lowest grade, or just not do
one of the homeworks. Late homeworks will be penalized 10 points
for every hour late or fraction thereof. You will need to submit
your homeworks via the ``submit'' command on the unix clusters. All
code must be runnable on the unix system, even if you've
developed it on other platforms. You may use the programming language
of your choice.
Please note the exam dates on the calendar (April 22, May 13,
Final exam on June 8 at 11:30 am). Excuses from exams will only be
given with prior notice (in the case of reasonable conflicts), or with
a doctor's note. Documentation is needed in all instances. If you're
sick enough to miss a class, they you should be at the health center;
they can give you a note.
Carmen/Email
I will be using carmen for discussions
and announcements. Homework assignments will be distributed through
carmen. In case I need to make an announcement where I need to reach
people quickly, I will utilize osu's name.#@osu.edu email aliases; if
you do not read that email regularly please make sure to forward it to
someplace where you do read email.
I will also post course notes on the website; this does not absolve
you from reading the book nor listening in class -- I may test on
materials not covered strictly in the notes.