Abstract
We begin with a description of a general graph-like representation of a relation structure, called a relation net. We then present an example of a special kind of relation net, called a Concept-Name-Relationship (CNR) net, that is relevant for applications in knowledge representation. Definitions of the notions of degree and of subnet are given, and CNR-nets are shown to display context-sensitivity. The main example is in the form of a hierarchy of nested subnets, and one easy tabular representation that is suitable for computer implementation is introduced. The examples chosen are quite simple, but adequately introduce our approach to knowledge representation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Geldenhuys, A.E., van Rooyen, H.O., Stetter, F. (1999). A Labelled Digraph Model for Knowledge Representation. In: Knowledge Representation and Relation Nets. The Kluwer International Series in Engineering and Computer Science, vol 506. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4054-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4054-0_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6815-1
Online ISBN: 978-1-4615-4054-0
eBook Packages: Springer Book Archive