Abstract: The present invention relates to 6-chloro-2-(4,6-dimethoxypyrimidin-2-yl)oxybenzoic acid iminoester derivative of the general formula I; process of their preparation and a method for their application as herbicides: ##STR1## wherein R and Q are as defined in the specification.

Abstract: A pattern-matching network is merged with an 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 consist 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.

Abstract: A pattern-matching system, such as of the RETE type, is updated. The updating operation is generalize to operate with correct match resuslts for generalized RETE networks (ones where join nodes may have either predecessor be another join node), and for arbitrary partial update state, characterized by stop nodes designating how far update operations have progressed for particular update tokens (designated suspended tokens) at any particular time. The updating operation consists of the following steps: First, all tokens only partially updated through the network are shadowed, in that the partial result memories associated with the stop nodes are put into the state that exists or existed before the suspended tokens arrive at the stop nodes. Then for each suspended token, it is pushed to resume nodes connected as RHS (or LHS) inputs in a descending order of resume nodes.