EP 0369700 A3 19920902 - MODIFYING PATTERN-MATCHING NETWORKS
Title (en)
MODIFYING PATTERN-MATCHING NETWORKS
Publication
Application
Priority
US 27209788 A 19881114
Abstract (en)
[origin: EP0369700A2] A pattern-matching network is merged with a pre-existing RETE network without recompiling the whole network, while still matching existing data. Permanent, temporary , full and partial merging operations are described, depending on the origination of match patterns among LHS, on demand (procedural programming), or top level. The merge process combines functionally identical nodes from the networks for reducing the number of nodes in the resulting network. The merger process produces so-called alpha and beta synapse nodes; alpha synapse nodes have pointers to top nodes, while beta synapse nodes have pointers to a drain node, which is a node in the grafted RETE portions of the resulting network and to source memory nodes in the pre-existing RETE network. The algorithm for obtaining a set of synapse nodes without duplication of any logic connecting paths is described. The synapse nodes are used in updating a grafted network, also can be a suspended portion, upon completion of the merger. Two network updating algorithms are presented.
IPC 1-7
IPC 8 full level
G06F 9/44 (2006.01); G06F 17/30 (2006.01); G06N 5/04 (2006.01)
CPC (source: EP US)
G06F 9/4494 (2018.01 - EP US); G06F 16/9024 (2018.12 - EP US); G06N 5/047 (2013.01 - EP US)
Citation (search report)
[A] SYSTEMS & COMPUTERS IN JAPAN. vol. 20, no. 8, August 1989, NEW YORK US pages 59 - 68; ARAYA ET AL: 'Incremental Structuring of Knowledge Base - Incremental Construction Method of Rete Network.'
Designated contracting state (EPC)
DE FR GB
DOCDB simple family (publication)
EP 0369700 A2 19900523; EP 0369700 A3 19920902; JP H02224127 A 19900906; JP H0778739 B2 19950823; US 4956791 A 19900911
DOCDB simple family (application)
EP 89311674 A 19891110; JP 29407689 A 19891114; US 27209788 A 19881114