Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!mnetor!seismo!columbia!rutgers!ames!sdcsvax!ucbvax!JASPER.PALLADIAN.COM!RJZ From: RJZ@JASPER.PALLADIAN.COM (Roland Zito-Wolf) Newsgroups: comp.ai.digest Subject: references re (approximate) structure matching Message-ID: <870528092819.2.RJZ@UBIK.PALLADIAN.COM> Date: Thu, 28-May-87 09:28:00 EDT Article-I.D.: UBIK.870528092819.2.RJZ Posted: Thu May 28 09:28:00 1987 Date-Received: Sun, 31-May-87 15:42:30 EDT Sender: daemon@ucbvax.BERKELEY.EDU Reply-To: Roland Zito-Wolf Distribution: world Organization: The ARPA Internet Lines: 23 Approved: ailist@stripe.sri.com I am looking for references regarding the matching of complex structures (matching on semantic networks or portions of networks) such as arise in doing retrieval operations on knowledge-bases so represented. Since the general mathcing problem is most likely intractable, I'm looking for approximate or incomplete techniques, such as partial match, resource-bounded match, matches using preference rules, etc. References which explore algorithms in detail, and implemented systems, would be especially useful. For example, does anyone know of a detailed description of the KRL matcher? Information on the more general problem of query/data-retrieval from semantic networks would also be useful. If there's sufficient interest, I'll post the results to the digest. Thanks in advance. Roland J. Zito-wolf Palladian Software 4 Cambridge Center Cambridge, Mass 02142 617-661-7171 RJZ%JASPER@LIVE-OAK.LCS.MIT.EDU