Some Data-base Applications of Constraint Expressions.
Abstract
This report presents a novel network-like representation for information, called 'constraint expressions' (CE). CE makes use of some of the knowledge-representation techniques developed by Artificial Intelligence research. A CE network consists of points (which represent classes of objects) interconnected by constraints (which represent the relationships which are known to hold among the classes). All constraints are defined in terms of six primitive ones. The data in a CE network is accessed by propagating various kinds of labels through it: Each constraint can be viewed as an active process which looks for certain patterns of labels on some of its attached points, and then propagates new labels to other points when such patterns occur.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1976
- Accession Number
- ADA024149
Entities
People
- Richard Weaver Grossman
Organizations
- Massachusetts Institute of Technology