CS 227: Knowledge Representation and Reasoning

Spring 2011

Tuesday, Thursday 12:50 - 2:05pm , Gates B12





Schedule & Lectures


Date Topic Lecture Reading Optional Assignment
Mar 29 Introduction Lecture 1 B&L chapter 1 B&L chapter 2-4 (FOL)
Reddy Paper
Feigenbaum Paper
Brachman Paper
FOL review section
Mar 31 Object-oriented representation Lecture 2 B&L chapter 8, 10 OKBC Paper
Apr 5 Structured descriptions Lecture 3 (Ron Brachman) B&L chapter 9
Brachman Paper Assignment 1
Apr 7 Structured descriptions Same as lecture 3
Apr 12 Structured descriptions Lecture 5 B&L chapter 16
Description Logic Wikipedia
Apr 14 Ontologies and representation of Domain Knowledge Lecture 6 What are Ontologies
Ontology Development
Ontology & Lexicon
Why Evaluate
Apr 19 Knowledge Representation in Social Context Lecture 7 Semantic Web to social machines Linked Data Semantic Wikipedia Assignment 2
Human Heart OWL
Apr 21 Logic Programs I Lecture 8a
Lecture 8b
B&L chapter 5, 6
Apr 26 Logic Programs II: Combining Rules and Objects Lecture 9a
Lecture 9b
a : B&L chapter 7 b: OWL & LP
Apr 28 Defaults and Negation Lecture 10 B&L chapter 11
Modal Logic
Truth and Modality
May 3 Answer Set Programming Lecture 11 Gelfond ch 2,6 ASP Solvers
May 5 Abductive Reasoning Lecture 12 B&L chapter 13 Assignment 3
Sample FLORA
Test Questions Solutions
May 10 Qualitative Reasoning Lecture 13 Garp 3
May 12 Constraint Satisfaction Lecture 14 R&N chapeter 6
May 17 Representation of Actions Lecture 15 B&L chapter 14
May 19 Reasoning with Actions Lecture 16 Planning book chapter 11 A.I. of Fear
PDDL planning
May 24 Practical Planning Lecture 17 (guest) Automated Planning ch 7,8 Photocopiers
Story Generation
Assignment 4
Game actions PDDL definitions
Sample configuration
May 26 Abstraction, Reformulation and Approximation Lecture 18 Abstraction
Justified Reformulation
Approximate Objects
May 31 Wrap up Lecture 19 Extra Credit Problems

The course notes will be available online before the lectures. An additional reading list will be prescribed with the lectures. Also there will also be some guest lecturers during the course to cover specific topics.


Course Information



Representing knowledge symbolically in a form suitable for automated reasoning, and associated reasoning methods. Combines formal algorithmic analysis with a description of recent applications.
Prerequisites: familiarity with basic notions in data structures and with techniques in algorithm design and analysis. Computational logic (CS157 or equivalent). Recommended: previous or concurrent course in AI. Knowledge of Lisp or Prolog programming.


The course work will consist of assignments a mideterm and a final exam. While portions of the assignments will be conceptual, the project-oriented section of the assignment will require implementation work using a specific knowledge representation and reasoning system.

Homework & Grading Policy

  • Homeworks (40%)
    • Due Date: Homeworks are due in class or by 5pm in the cs227 file cabinet in the first floor lobby on the due date.
    • Late Policy: Each student is allowed up to two late days that may be applied to any homework. Note that you can use at most one day for each homework assignment. Please state on your homework whether you have used a late day or not.
      These extensions are there for the purposes of emergencies, medical or otherwise. Apart from this, there will be no other extensions given out, except under extreme circumstances (If you feel this is the case, contact the staff ASAP).
      Homeworks will NOT be accepted more than a day after the deadline without prior course staff approval.
    • Collaboration Policy: Under the Honor Code at Stanford, each of you is expected to submit your own work in this course. On many occasions, however, it is useful to work with other students or to ask for general advice from the course staff or other experts. Such activity is both acceptable and encouraged, but you must indicate any collaboration or assistance on your solution sets. Any collaboration or assistance that is not given proper citation may be considered a violation of the Honor Code.
  • Midterm (25%)
    • Date & Time: Wednesday, May 4, 6:00-8:00pm.
    • Location: Herrin T175.
    • Test Policy: Closed Book/Notes.
  • Final (35%)
    • Date & Time: Monday, June 6, 7-10pm.
    • Location: Gates B12
    • Test Policy: Closed Book/Notes.




Prof. Vinay K. Chaudhri
Email: Vinay.Chaudhri@sri.com
Office Hours: TBA

Zahra Mohammadi Zadeh
Email: zahram@stanford.edu
Office Hours: Wednesdays 2:10-4:10, Gates B28

Luke Anderson
Email: lukeja@stanford.edu
Office Hours: Tuesdays 2-4pm (after class), Gates B24A

Email: cs227-spr1011-staff@lists.stanford.edu

Please use Piazzza to ask questions about the assignments or the course materials.




There is one required textbook for the course which is available online for free for Stanford students.

Knowledge Representation and Reasoning (Online Copy)
Ron Brachman and Hector Levesque
Morgan Kaufmann