Artificial Intelligence - Spring 2007
Revised Schedule

 
Monday
Wednesday
Jan 17: Overview of AI (ch. 1)
Jan 22: Knowledge representation & predicate logic Jan 24: Review of predicate logic (ch. 2)
Jan 29: Review of predicate logic (ch. 2)
Homework 1 due (logic, graphs, & CFGs)
Jan 31: State space search (3.0-3.2)
Last chance to turn in homework 1
Feb 5: Heuristic search:
Best-first search and A* (4.0-4.3)
Feb 7: Heuristic search: Game-playing (4.4-4.6)
Feb 12: Heuristics and weighted graphs (4.4-4.6)
Also read 5.0-5.2 for additional background
Homework 2 due (heuristic search)
Feb 14: No class: snow
Feb 19: And/or graphs (3.3)
Last chance to turn in homework 2
Feb 21: Semantic networks and frames
(7.0-7.1 & handout)
Project proposals due
Feb 26: Exam 1 Feb 28: Resolution theorem-proving (13.0, 13.2)
March 5: Resolution theorem-proving (13.2) March 7: Resolution theorem-proving (13.2)
March 12: Spring Break March 14: Spring Break
March 19: Prolog (15.0, 15.1)
Supplement with Clocksin & Mellish, if desired
Homework 3 due (resolution)
March 21: Prolog (15.0, 15.1)
Last chance to turn in homework 3
Project draft due
March 26: Prolog (15.0, 15.1) March 28: Exam 2
April 2: Natural language understanding (14.0-14.3) April 4: Natural language understanding (14.0-14.3)
Homework 4 due (Prolog)
April 9: Natural language understanding in Prolog (handout) April 11: Expert systems (8.0-8.2 & handout)
April 16: Student project presentations
Meet in EDUC 2103
Project due
April 18: Student project presentations
Meet in EDUC 2103
April 23: Student project presentations
Overview: Turing test (Turing paper - handout)
Meet in EDUC 2103
Homework 5 due (Turing test)
April 25: Turing Test
Homework 6 due (natural language)
April 30: Turing Test discussion (handout)
Last chance to turn in any homework


Nancy Tinkham
Computer Science Department, Rowan University

Valid HTML 4.0!