The goal of this paper is to show how ideas from lattice theory can be used in the implementation of a knowledge representation language. First, the semantics of a simple knowledge representation language is presented. Then we show how to use Birkhoff's Representation Theorem for Finite Distributive Lattices to build incrementally what we call a Birkhoff implementation of a knowledge base by processing a sequence of terminological axioms. A mathematical proof of the correctness of our technique with respect to the given semantics is an integral part of the development. While the intended application is to knowledge representation, these methods can be used whenever a computationally tractable representation of a finite distributive lattice needs to be implemented. (Dept420)

By:* Frank J. Oles *

Published in: Theoretical Computer Science, volume 249, (no 1), pages 163-96 in 2000

Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.

Questions about this service can be mailed to reports@us.ibm.com .