UNIVERSITY AT BUFFALO - STATE UNIVERSITY OF NEW YORK
The Department of Computer Science & Engineering

STUART C. SHAPIRO: CSE 663

CSE663: Advanced Knowledge Representation
Stuart C. Shapiro
Fall, 2004
MWF 9:00 - 9:50, 214 Norton Hall
Registration No. 286537

Professor:

Prof. Stuart C. Shapiro, 326 Bell Hall, 645-3180 ext. 125, shapiro@cse.buffalo.edu
Office Hours: M 10:30 - 11:20, T 2:30 - 3:20, R 11:00 - 11:50, F 1:30 - 2:20
or make an appointment via email. See my schedule for my available times.

Text:

Ronald J. Brachman & Hector J. Levesque, Knowledge Representation and Reasoning, Morgan Kaufmann, 2004.

Manual:

Stuart C. Shapiro and The SNePS Implementation Group, SNePS 2.6.1 User's Manual, Department of Computer Science and Engineering, University at Buffalo, The State University of New York, Buffalo, NY, 2004.

Academic Policies:

This course will abide by the Departmental Academic Integrity policies and procedures,
and the Departmental Incomplete policy. The short versions are:

all work turned in with your name on it must be your own work;
material from other sources must be quoted and cited appropriately;
unless something disastrous and unavoidable happens to you and you are otherwise passing this course, you will not receive an incomplete.

This course will also abide by the University's principles and procedures regarding students with disabilities. See the Office of Disability Services' statement on UB's Commitment to Disability Access. Notify the professor if you need any accommodations under these policies.

Course requirements:

Class attendance;
Participation in class discussions;
Assigned readings;
Occasional homeworks, sometimes involving problem sets, sometimes involving experimenting with KRR systems, sometimes involving programming;
Term project. See project suggestions.

Homeworks:

The purposes of homework exercises are: to give you hands-on experience with relatively small problems; to give you a chance to assess the level of your understanding; to support and spark in-class discussions. Small programming exercises may be assigned as homework exercises. Homeworks will be assigned in class and via this web page. The due date will be announced when the homework is assigned, and will be contained on the homework assignment. They will be due at the beginning of class on that date.
NO LATE HOMEWORKS WILL BE ACCEPTED.
Grading: Each homework exercise will be worth some modest number of points, which will be stated when the exercise is assigned. The final homework grade will be the percentage of total points possible that were actually earned.

Term Project:

The term project is to be an implementation and a paper describing it. The implementation could either be using SNePS to implement an agent or some other knowledge-based system, or using a conventional programming language to contribute to the implementation of SNePS. See the project suggestions for some ideas. The paper must satisfy the style of a publishable paper, must describe the implementation, and must discuss the relevant literature. The use of LaTeX to prepare the paper is highly recommended. The paper/project must reflect the course material from this course. Expect to spend at least 3/4 of the semester working on the paper/project. The paper is due on the last day of Exam week: Monday, December 20, 2004.

Course Calendar:

Week	Day	Date	Comments
1	Mon	8/30	First Class Review SNePS HW1 assigned
	Wed	9/1	Example SNePSLOG formalization: `/projects/shapiro/CSE663/carPoolWorld.snepslog` See CarPool World in SNePSLOG
	Fri	9/3	Last day to drop without financial penalty
2	Mon	9/6	No Class: Labor Day
	Wed	9/8	HW1 due HW1 Solutions have been posted, along with a loadable SNePSLOG file
	Fri	9/10	Drop/Add deadline Path-Based Inference in SnePSLOG HW2 assigned SNePS Lecture Notes pp 334 - 340
3	Mon	9/13	SNePS Lecture Notes pp 334 - 340 SNePS 2.6.1 User's Manual, Sect. 2.5.2, pp 11 - 13 Review Chap 6 slides pp 286 - 291 Read Stuart C. Shapiro, Cables, Paths and "Subconscious" Reasoning in Propositional Semantic Networks. In J. Sowa, Ed. Principles of Semantic Networks: Explorations in the Representation of Knowledge. Morgan Kaufmann, San Mateo, CA, 1991, 137-156.
	Wed	9/15
	Fri	9/17	SNIP, The SNePS Inference Package, SNePS 2.6.1 User's Manual, Chapter 3
4	Mon	9/20	Term paper proposal due For an example of path-based inference with negations, run `/projects/shapiro/CSE663/locations.snepslog`
	Wed	9/22	See illustrations of the SNIP control structure at `/projects/shapiro/CSE663/acg.snepslog` But first, if necessary, see the example of tabling (memoizing) at `/projects/shapiro/CSE663/tabling.cl`
	Fri	9/24	Read D. P. McKay and S. C. Shapiro. Using active connection graphs for reasoning with recursive rules. In Proceedings of the Seventh International Joint Conference on Artificial Intelligence, pages 368-374, Los Altos, CA, 1981. Morgan Kaufmann.
5	Mon	9/27	HW2 due HW2 Solutions will be posted. A loadable file will be available at `/projects/shapiro/CSE663/dishes.snepslog`
	Wed	9/29	Fran Johnson on Belief Revision
	Fri	10/1	Fran Johnson on Belief Revision
6	Mon	10/4	SNeRE: primitive actions
	Wed	10/6	SNeRE policies and mental actions
	Fri	10/8	SNeRE control actions
7	Mon	10/11	SNeRE goals
	Wed	10/13	HW3 assigned: implement `deliverPackage` for `/projects/robot/Karel/DeliveryWorld/DeliveryAgent.snepslog`
	Fri	10/15	Production Systems (B & L, Chap. 7); Jess
8	Mon	10/18	Term paper first draft due
	Wed	10/20	Frames (B & L, Chap. 8); see `/projects/shapiro/CSE663/trips.cl`
	Fri	10/22	R deadline No class: AAAI Fall Symposia
9	Mon	10/25	Finish frames discussion
	Wed	10/27	HW3 due. A solution is available at `/projects/robot/Karel/DeliveryWorld/MyDeliveryAgent.snepslog` HW4, a Jess parser, assigned. The example partial solution is available at `/projects/shapiro/CSE663/jessParserhw.clp` Discussion of HW3
	Fri	10/29	Description Logics (B & L, Chap. 9). See the Notes on Classic
10	Mon	11/1	Continue Description Logics and Classic.
	Wed	11/3	HW4 due. A solution is available. Continue Description Logics and Classic.
	Fri	11/5	Continue Description Logics and Classic. HW5, a Classic classifier, assigned.
11	Mon	11/8	Inheritance Networks (B & L, Chap. 10).
	Wed	11/10	Continue Inheritance Networks
	Fri	11/12	HW5 due. A solution is available. Continue Inheritance Networks
12	Mon	11/15	Continue Inheritance Networks
	Wed	11/17	HW6: Do all exercises of Section 10.5. Note that #2 should be credulous extensions wrt George, Polly, or Dick. Maximum points: 3 x 5 x 1 = 15. Begin Defaults (B & L, Chap 11)
	Fri	11/19	Term paper second draft due. Continue Defaults.
13	Mon	11/22	No class
	Wed	11/24	Fall Recess
	Fri	11/26	Fall Recess
14	Mon	11/29	Continue Defaults.
	Wed	12/1	HW6 due by hard-copy. A solution will be available. Continue Defaults (Default Logic).
	Fri	12/3	Continue Defaults (Autoepistemic Logic). Discuss Courteous Logic Programs and Default reasoning by preferential ordering. (See Grosof's paper, and Shapiro's talk in ps or Shapiro's talk in dvi.) Try the demo in `/projects/shapiro/CSE663/defaultByPreferenceDemo.snepslog`
15	Mon	12/6	Finish Courteous Logic Programs and Default reasoning by preferential ordering.
	Wed	12/8	Vagueness, Uncertainty, and Degrees of Belief (B&L Chap 12). See Notes on Probabilistic Reasoning
	Fri	12/10	Last Class Vagueness, Uncertainty, and Degrees of Belief (B&L Chap 12)
	Mon	12/13	Final Exam week
	Wed	12/15	Final Exam week
	Fri	12/17	Final Exam week
	Mon	12/20	Term paper due.

Last modified: Tue Dec 7 23:18:18 EST 2004
Stuart C. Shapiro <shapiro@cse.buffalo.edu>

CSE663: Advanced Knowledge Representation Stuart C. Shapiro Fall, 2004 MWF 9:00 - 9:50, 214 Norton Hall Registration No. 286537

CSE663: Advanced Knowledge Representation
Stuart C. Shapiro
Fall, 2004
MWF 9:00 - 9:50, 214 Norton Hall
Registration No. 286537