The Department of Computer Science & Engineering
UB CSE 4/563
MWF, 11:00 - 11:50, 322 Clemens
"Reports that say something hasn't happened are always interesting to me, because as we know, there are known knowns; there are things we know we know. We also know there are known unknowns; that is to say we know there are some things we do not know. But there are also unknown unknowns -- the ones we don't know we don't know." -- Donald Rumsfeld, February 2002
"We think we know what he means. But we don't know if we really know." -- John Lister, spokesman for Britain's Plain English Campaign, December 1, 2003.
|Lecturer||TA||Class Meetings||Course Description|
|Texts||Additional Readings||On-Line Resources||Interesting KR Links|
|Sample Project Report||Grading||Midterm Exam||Final Exam|
|Academic Policies||Calendar||UBlearns Site|
|463 Lecture||Shapiro||xxxxxx||MWF||11:00-11:50||Clemens 322|
|563 Lecture||Shapiro||xxxxxx||MWF||11:00-11:50||Clemens 322|
|463 Recitation A1||Bona||151024||T||8:00-8:50||Norton 214|
|563 Recitation A1||Bona||117420||T||8:00-8:50||Norton 214|
|463 Recitation A2||Bona||157235||M||12:00-12:50||Norton 209|
|563 Recitation A2||Bona||047174||M||12:00-12:50||Norton 209|
This course provides a basic grounding in KRR for people interested in: Artificial Intelligence; Cognitive Science; Computational Linguistics; Philosophy of Mind and of Language; Logic Programming; Database Systems; and applications areas that employ formal representations of ontologies.
submit_cse563), in which case instructions will be given with the homework assignment. NO LATE HOMEWORKS WILL BE ACCEPTED.
Once the due date/time has passed, solutions will be posted on the UBlearns Site. You should consider the posted solutions to be required reading.
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. To make up for occasional poor performance on homeworks or for late or missed homeworks, there will occasionally be homework questions worth bonus points.
For each project, you will be expected to hand in a paper, produced using a document formatting program such as LaTeX or Microsoft Word, and printed on 8.5 by 11 inch paper, stapled in the upper left-hand corner, with a title, your name, and other identifying information at the top of the first page (Do not use the header page automatically produced by the printer), plus a well-documented listing and run of your program. (Do not enclose your paper in a folder or cover.) The main product of your work is the paper, not the program! For general advice on how to prepare a written report, see William J. Rapaport, How to Write. A sample CSE 4/563 paper is available.
In addition to the paper, you are to
program, so that it can be run and checked if the instructors choose.
You will have three to four weeks to do each project. The due date and time will be announced when the project is assigned.
Each project will be graded on a scale of 0 - 100. A finer break-down will be announced with each project. In general, aspects of writing the paper will be weighted more heavily for CSE563 students than for CSE463 students, and aspects of correctness of the program will be weighted more heavily for CSE463 students than for CSE563 students.
Late projects will be penalized 10 points per 24-hour period, or part thereof. The later of the time the paper is turned in and the time the program is submitted will be the time used. You may turn in late papers either to the lecturer, the TA, or the CSE Department office (201 Bell Hall). Realize that the only times you may be sure that anyone will be available to accept your paper is immediately before or after the lecture, immediately before or after the recitation, or during office hours---plan ahead. Do not just leave the paper in the instructor's or TA's mailbox. Give it to a person, either the instructor, the TA, or a departmental secretary (in 201 Bell Hall), and ask that person to write on the paper the date and time that you turned it in.
Early projects will be awarded a bonus of 2 points per 24-hour period, or part thereof. That is, a project turned in within the 24-hour period before the due date/time will be considered to be on time. A project turned in more than 24 hours early, but less than 48 hours early, will earn 2 bonus points, etc. The later of the time the paper is turned in and the time the program is submitted will be the time used. At most, the bonus points can raise your grade by 30%. For example, if your project earns 80 points without the bonus points, you can earn up to 24 bonus points (12 days or more early), but if your project earns 50 points without the bonus points, you can earn at most 14 bonus points (7 days or more early).
Graded projects will be returned in recitation, except for the last project, which will be available in the Lecturer's office after it has been graded. You are encouraged to pick them up.
The default mapping from percents to letter grades will be the "standard" curve:
|CSE 463||CSE 563|
You should check the electronic grade sheet within the course UBlearns Site regularly, and promptly report any discrepancy between the grades shown there and your own records of your grades to the Lecturer or the TA.
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 lecturer if you need any accommodations under these policies.
In this calendar, "B&L" refers to the Brachman & Levesque text listed among the Recommended Texts, and "krrText" refers to the partial draft book version of the lecture notes listed among the Additional Readings.
Introduction to Course
|Wed||1/14||Introduction to Knowledge Representation and Reasoning and to
Chap 1 slides; krrText, Chap. 1 - 3;
"An Approach to Serenity";
B&L, Chap. 1; B&L Slides, Chap 1.
|Fri||1/16||The "Standard" Propositional Logic: Chap 2 slides, p. 19-38; krrText, Chap. 4 - Sec. 6.3.2|
|2||Mon||1/19||Martin Luther King, Jr. Day. No classes.|
|Tue||1/20||First Meeting of Recitation A1|
Semantics of the "Standard" Propositional Logic: Chap 2 slides, p. 39 - 48; krrText, Sec. 6.3.3 - 6.3.8
Model Finding: Chap 2 slides, p. 49-56; krrText, Sec. 6.3.9
||First Meeting of Recitation A2
Semantic Properties of Wfps, Domain Rules: Chap 2 slides, p. 57-72; krrText, Sec. 6.3.10-6.3.11
|Wed||1/28||HW1 due; solutions are posted in
The KRR Enterprise, Computational methods for determining entailment and validity: Chap 2 slides, p. 73-78; krrText, Sec. 6.3.11
||Computational methods for determining entailment and validity: Chap 2 slides, p. 76-96; krrText, Sec. 6.4|
|4||Mon||2/2||Proof Theory of Standard, Classical Propositional Logics: Chap 2 slides, p. 97-110; krrText, Sec. 6.5|
|Wed||2/4||HW2 due; solutions are posted in UBlearns.
Fitch-Style Proof Theory of Standard, Classical Propositional Logics: Chap 2 slides, p. 108-120; krrText, Sec. 6.5
|Fri||2/6||SNePS 3: Chap 2 slides p. 121-124;
Refutation Resolution: B&L, Chap. 4; Chap 2 slides p. 136-143
|5||Mon||2/9||Project 1 assigned.
Refutation Resolution: B&L, Chap. 4; Chap 2 slides p. 144-154; prover and SNARK
|Wed||2/11||HW3 due; solutions have been
posted in UBlearns.
Refutation Resolution on Standard Wfps: Chap 2 slides p. 155-166
Predicate Logic Over Finite Models: Chap 3 slides p. 167-180;
B&L, Chap. 2
|Fri||2/13||Predicate Logic Over Finite Models:
Chap 3 slides p. 181-197;
B&L, Chap. 2
|6||Mon||2/16|| The "Standard" Finite-Model Predicate Logic:
Chap 3 slides p. 198-202
Clause-Form Finite-Model Predicate Logic: Chap 3 slides p. 203-215
|Wed||2/18||HW4 due; solutions have been posted
The "Standard" Full First-Order Predicate Logic: B&L, Chap. 2; Chap 4 slides p. 216-244
|Fri||2/20||Proof theory of the "Standard" Full First-Order Predicate Logic: B&L, Chap. 2; Chap 4 slides
Clause-Form Full First-Order Predicate Logic: B&L, Chap. 4; Chap 4 slides p. 257-266
|7||Mon||2/23||Proof Theory of Clause-Form Full First-Order Predicate Logic: B&L, Chap. 4; Chap 4 slides p. 267-282|
|Wed||2/25||HW5 due; solutions have been posted
Clause-Form FOL: B&L, Chap. 4; Chap 4 slides p. 283-293
||Clause-Form FOL: B&L, Chap. 4; Chap 4 slides p. 294-319|
|8||Mon||3/2||HW6 due; solutions have been posted in UBlearns.
Summary of Part I: Chap 5 slides
|Wed||3/4||Midterm Exam. Solutions have been posted in UBlearns.|
|Fri||3/6||Project 1 due.
Clause-Form FOL, Asking Wh Questions: B&L, Chap. 4; Chap 4 slides p. 317-334
|9||Mon||3/16||Project 2 assigned.
FOL Wrapup: B&L, Chap. 4; Chap 4 slides p. 335-352
Prolog: Chap 6 slides p 366-370
|Fri||3/20||Prolog: Chap 6 slides p. 371-388|
|10||Mon||3/23||Prolog: Chap 6 slides p. 389-397|
|Wed||3/25||HW7 due, Solutions are posted in UBlearns.
A Potpourri of Subdomains: Chap 7 slides p. 398-403
A Potpourri of Subdomains: Chap 7 slides p. 404-414
|11||Mon||3/30||SNePS: Chap 8 slides,
Paper: SNePS: A Logic for Natural Language Understanding and Commonsense Reasoning,
Paper: An Introduction to SNePS
|Wed||4/1||HW8 due. Solutions are posted
SNePS: Chap 8 slides, p. 433-445
|Fri||4/3||SNePS: Chap 8
slides, p. 446-462
|| Project 2 due.
Project 3 assigned.
SNePS: Chap 8 slides, p. 463-472
|Wed||4/8||HW9 due. Solutions are posted
SNePS: Chap 8 slides, p. 473-478
Examples of path-based inference:
|Fri||4/10||Continue path-based inference examples
Procedural attachment in SNePS: Chap 8 slides, p. 479
SNeRE: Chap 8 slides, p. 480-495
|13||Mon||4/13|| Rules about functions (addition): Chap 8 slides, p. 479
Belief Revision: Chap 9 slides, p. 495-517
|Wed||4/15||HW10 due, Solutions will be posted
HW11 to be assigned.
Relevance Logic: Chap 9 slides, p. 517-540
|Fri||4/17||Relevance Logic in SNePS: Chap 9 slides, p. 541-548|
|14||Mon||4/20||Description Logics: Chap 13 slides, p. 590-597|
|Tue||4/21||Last Meeting of Recitation A1|
||HW11 due, Solutions will be
posted in UBlearns.
Description Logics: Chap 13 slides, p. 598-604
|Fri||4/24||No class: Graduate Student Conference|
Last Meeting of Recitation A2
Project 3 due.
Course summary: Chap 11 slides
|Mon||5/4||Final Exam, 11:45 AM - 02:45 PM, Diefendorf, Room 2|