Knowledge Representation: Term Project 1

Term Project 1: Implementing Formula-Augmented Networks

Due: Monday, May 17, 1999 (Friday May 14 for anyone graduating)
Questions to

The task here is to implement Formula-Augmented Networks, a knowledge representation structure that allows one to reason about the inheritance of logical formulas. They are described in detail in a number of papers, including
Leora Morgenstern: "Inheritance Comes of Age: Applying Nonmonotonic Techniques to Problems in Industry" ( the long journal paper), the shorter conference paper, and an earlier paper, Inheriting Well-formed Formulae in a Formula-Augmented Semantic Network. This project can be divided into the following subtasks:

The following functionality must be exhibited.

Language to be used: Any well-known language such as C, C++, Java, Lisp, or Prolog is okay. If you have questions, check with Stathis or me.

Test data: will be provided. Rules will already be in first-order predicate calculus, so you will not have to translate from English to first-order logic for this project.

You can find sample input for the network structure (nodes, isa and cancels links) here. An explanation of this input file can be found here. The small sample rules file can be found here. Answers to frequently asked questions can be found here.

You can find a write-up of the Stein algorithm and of the FAN-traversal algorithm here.

Back to web page for KR course