P. J. HAYES

A given representational language can be implemented in all manner of ways: predicate calculus assertions may be implemented as lists, as character sequences, Minsky introduced the terminology of'frames' to unify and denote a loose as trees, as networks, as patterns in an associative memory, etc: collection of related ideas on knowledge representation: a collection which, all giving different computational properties but all encoding the same representational since the publication of his paper (Minsky, 1975) has become even looser.