CS462 /CS570 Artificial Intelligence
Course outline
A free version of Common Lisp can be downloaded from
Franz.
A free version of Protege can be downloaded from
Protege web site.
Lecture nodes
Lecture 1
Lecture 2
Lecture 3
Lecture 4
Lecture 5
and the
demo slide.
Lecture 6
Lecture 7
and
demo1 slide
,
demo2 slide.
Lecture 8
Lecture 9
Lecture 10
Lecture 11
Lecture 12
Lecture 13
Lecture 14
Lecture 15
Lisp code
Student data base example --
version 1
and
version 2
(improved representation).
Missionaries and cannibals example with depth-first search
Missionaries and cannibals example with breadth-first search
A simple breadth-first search example
A simple depth-first search example
A simple best-first search example
A simple hill-climbing search example
Search using association lists for representing data
Search using structures for representing data
Iterative breadth-first search example
Beam search example
5-puzzle
with number of tiles in proper places as heuristic for informed search, and
8-puzzle
version of it
A genetic algorithm
A forward chaining algorithm
A backward chaining algorithm
Wang's algorithm
Assignments and announcements
Homework 1
and the
5-puzzle code
that goes with it. An extended
best-first with Distance property
can be used for problem 1.
Best-first with Manhattan distance heuristic
-- original code updated as suggested in hw assignment. Deadline: February 16, 2020.
Homework 2
. Deadline: March 8, 2020.
Project research: Must decide on the topic, submit for approval the paper(s) to be studied (submit by BBLearn) by March 15, 2020. Failing to do that will decrease your project grade by 3 points.
Assignment on PROTEGE editor
. Deadline: March 22, 2020.
Homework 3
. Deadline March 29, 2020.
Homework 4
. Deadline April 26, 2020.
Final exam questions.
Return to Zlatareva's Home Page