Article navigation

A formalism for representing descriptions based upon labelled directed graphs is presented. Node and edge labels are assumed to lie in lattice‐like structures which capture certain semantic relationships between object classes and predicates, respectively. With this as a framework, the problem of inferring descriptions of a concept from examples is defined. In particular, the problem of constructing a more general description can be viewed as a process of iverting transformations used to generate instances of a description. Several examples are given and some problems are cited.

This content is only available via PDF.
You do not currently have access to this content.
Don't already have an account? Register

Purchased this content as a guest? Enter your email address to restore access.

Pay-Per-View Access
$41.00
Rental

or Create an Account

Close Modal
Close Modal