Path: utzoo!utgpu!watserv1!watmath!att!mcdchg!tellab5!balr!rapp
From: rapp@balr.com (Chuck Rapp)
Newsgroups: comp.ai
Subject: Re: Wanted:  Tools and references on Frames & Semantic Nets
Keywords: Frames, semantic_nets
Message-ID: <1990Sep12.110901.4877@balr.com>
Date: 12 Sep 90 11:09:01 GMT
References: <15260@shlump.nac.dec.com> <898@vall.dsv.su.se>
Reply-To: rapp@balr.UUCP (Chuck Rapp)
Organization: BALR Inc., Oakbrook, IL
Lines: 17

Aasa brings up an interesting question: does there exist a theory
regarding representational power?  In computational theory, two
different forms of computational are said to have equivalent power
if all computations in form one can be done in form two and vice
versa.  Has anyone studied the equivalence in representational power
between semantic nets, frames, and logic or between declarative
representation and procedural?  Is representational power another
form of computational power?

While there are differences between semantic networks and frames, if
they have the same representational power, then the only reason to
choose between them is ease of use in representing what you want.
-- 
+---------------+-------------------+-------------------------------+
| Chuck Rapp    |  rapp@balr.com    | Also: rapp@tellabs.com        |
| BALR, Inc.    |  uunet!balr!rapp  |                               |
+---------------+-------------------+-------------------------------+