The Department of Computer Science & Engineering
UB CSE 4/563
TTh, 2:00 - 3:20, 222 NSC
"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||System Documentation||Interesting KR Links|
|UBlearns Site||Discussion Board||Teams||"Programming"|
|Homeworks||Projects||Sample Project Report||Midterm Exam|
|Final Exam||Grading||Academic Policies||Calendar|
|463 Lecture||Shapiro||xxxxxx||TTh||2:00-3:20||NSC 222|
|563 Lecture||Shapiro||xxxxxx||TTh||2:00-3:20||NSC 222|
|463 Recitation R1||Bona||484128||W||8:00-8:50||Bell 337|
|563 Recitation R1||Bona||130574||W||8:00-8:50||Bell 337|
|463 Recitation R2||Bona||267987||M||9:00-9:50||Baldy 110|
|563 Recitation R2||Bona||297223||M||9:00-9:50||Baldy 110|
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.
Boole, which helps you construct truth tables; and the program
Fitch, which helps you construct Fitch-style formal proofs. Both truth tables and Fitch-style formal proofs will be topics in this course, and there will be homework assigments and exam questions that require you to construct them.
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(s), user name(s), 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
your 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.
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).
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 early or 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, or under their door. 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.
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, "krrText" refers to the partial draft book version of the lecture notes listed among the Required Texts; "B&L" refers to the Brachman & Levesque text listed among the Recommended Texts; and "B&E" refers to the Barwise & Etchemendy text listed among the Recommended Texts.
Introduction to Course; Introduction to Knowledge Representation and Reasoning:
Chap 1 slides p. 1 - 9; krrText, Chap. 1; B&L, Chap. 1; B&L Slides, Chap 1.
Introduction to Knowledge Representation and Reasoning:
Chap 1 slides p. 10 - 18; krrText, Chap. 1, 2;
"An Approach to Serenity";
B&L, Chap. 1; B&L Slides, Chap 1.
Introduction to Logic: krrText, Chap. 3; B&E, Introduction.
The "Standard" Propositional Logic: Chap 2 slides, p. 19-44; krrText, Chap. 4 - Sec. 6.3.2; B&E, 1.0-1.4, 3.0-3.7, 7.0-7.3.
|2||Tue||9/8||Semantics of the
"Standard" Propositional Logic & Model Finding: Chap 2
slides, p. 45 - 65; krrText,
Sec. 6.3.3 - 6.3.10
|Wed||9/9||First Meeting of Recitation R1|
Domain Rules & The KRR Enterprise: Chap 2 slides, p. 66 - 74; krrText, Sec. 6.3.11
Computational methods for determining entailment and validity: Chap 2 slides, p. 75-94; krrText, Sec. 6.4
|3||Mon||9/14||First Meeting of Recitation R2|
||Computational methods for determining entailment and
validity: Chap 2 slides, p. 90-96;
Tom's Evening Domain.pptx
||HW1 due. Solutions posted in
Proof Theory of Standard, Classical Propositional Logics: Chap 2 slides, p. 97-125; krrText, Sec. 6.5
|4||Tue||9/22||Review of Fitch-Style Proofs:
Chap 2 slides, p. 109-125;
Implementing Natural Deduction, Properties of Logical Systems: Chap 2 slides, p. 126-134;
Clause Form Propositional Logic: Chap 2 slides, p. 135-141;
|Thu||9/24||HW2 due. Solutions posted in UBlearns.
Resolution: B&L, Chap. 4; Chap 2 slides p. 142-166
prover and SNARK
|5||Mon||9/28||Yom Kippur: no classes|
|Tue||9/29||Project 1 assigned.
Refutation Resolution: Chap 2 slides p. 167-171;
Predicate Logic Over Finite Models: Chap 3 slides p. 172-202; B&L, Chap. 2
|Thu||10/1||HW3 due. Solutions posted in UBlearns.
Predicate Logic Over Finite Models: Chap 3 slides p. 203-222;
B&L, Chap. 2
|6||Tue||10/6||Full First-Order Predicate Logic: B&L, Chap. 2; Chap 4 slides p. 223-273|
|Thu||10/8||HW4 due. Solutions posted
Proof theory of Clause-Form Full First-Order Predicate Logic: B&L, Chap. 4; Chap 4 slides p. 274-298
|7||Tue||10/13||Proof Theory of Clause-Form Full First-Order Predicate Logic: B&L, Chap. 4; Chap 4 slides p. 298-322|
||HW5 due. Solutions posted
Clause-Form FOL: B&L, Chap. 4; Chap 4 slides p. 323-353
|8||Tue||10/20||Summary of Part I: Chap 5
|Thu||10/22||HW6 due. Solutions posted in UBlearns.
Midterm Exam. Solutions posted in UBlearns.
|9||Tue||10/27||Project 1 due.
Project 2 assigned.
Review of Midterm Exam
Rule-based systems, Formalizing difficulties: B&L, Chap. 4; Chap 4 slides p. 354-358
FOL Wrapup: B&L, Chap. 4; Chap 4 slides p. 359-364
Prolog: Chap 6 slides p. 379-383
|10||Tue||11/3||Prolog: Chap 6 slides p. 384-399|
|Thu||11/5||HW7 due. Solutions posted in UBlearns.
Prolog: Chap 6 slides p. 400-412
|11||Tue||11/10||A Potpourri of Subdomains: Chap 7 slides p. 413-429|
|Thu||11/12||HW8 due. Solutions posted
SNePS: Chap 8 slides, p. 430-454
Paper: SNePS: A Logic for Natural Language Understanding and Commonsense Reasoning,
Paper: A SNePSLOG Guide to SNePS 2
|| Project 2 due.
Project 3 assigned.
SNePS: Chap 8 slides, p. 455-480
|Thu||11/19||HW9 due. Solutions posted
SNePS: Chap 8 slides, p. 481-495
Examples of path-based inference:
Belief Revision: Chap 9 slides, p. 512-523
|13||Tue||11/24|| HW10 due. Solutions posted
Belief Revision: Chap 9 slides, p. 524-563
|Thu||11/26||Thanksgiving: no classes|
|14||Tue||12/1||Review Project 2|
|Thu||12/3||HW11 due. Solutions posted
Description Logics: Chap 13 slides, p. 605-619
|15||Mon||12/7||Last Meeting of Recitation R2|
|Tue||12/8||The Situation Calculus: Chap 10 slides, p. 564-582|
|Wed||12/9||Last Meeting of Recitation R1|
Project 3 due.
Course summary: Chap 11 slides
|Wed||12/16||Final Exam: Knox 104 3:30-6:30|