Article View: comp.ai
Article #8822Are there extensions to Rete to allow arbitrary matching of lists?
From: mull
Date: Wed, 07 Feb 1990 22:54
Date: Wed, 07 Feb 1990 22:54
12 lines
871 bytes
871 bytes
The normal Rete pattern matching algorithm is meant to match a flat (list of atoms) pattern against flat working memory elements. We would like to know if the Rete algorithm can be extended to handle arbitrary lists for both wme's and patterns where the pattern could have match variables at arbitrary places in its list structure. We would like to do this without resorting to unification. Any help will be very appreciated. Chris Mullendore hri!mull@BBN.COM or mull@hri.uucp Horizon Research, Inc. Waltham, Mass.
Technical Details
Message-ID:
<1990Feb7.225451.16224@hri.uucp>Path:
arc1-ca.pugleaf.net!utzoo!attcan!uunet!munnari.oz.au!uhccux!ames!lll-winken!brutus.cs.uiuc.edu!apple!bbn!hri!mullShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!munnari.oz.au!uhccux!ames!lll-winken!brutus.cs.uiuc.edu!apple!bbn!hri!mull From: mull@hri.uucp Newsgroups: comp.ai Subject: Are there extensions to Rete to allow arbitrary matching of lists? Message-ID: <1990Feb7.225451.16224@hri.uucp> Date: 7 Feb 90 22:54:51 GMT Organization: Horizon Research Lines: 12