Method for sharing common values implicitly among communicating generative objects

Claim 2

A computer-implemented method for sharing common values implicitly among generative objects, the objects respectively being accessible only across counterpart logically partitioned and isolated demand/response interfaces, at least one of the partitions including a cyclic, rule-based, object-sensitive production system otherwise termed a knowledge processing environment (KPE), comprising the steps of: (a) creating a process in each partition cooperative with counterpart concurrent processes in other partitions across the counterpart synchronous demand/response interface; (b) processes in each partition selectively creating, modifying, or deleting common values, and forming a list of changes; (c) processes in other than the KPE partition communicating any change list to the KPE partition independent from and concurrently with any procedural request to the KPE partition; (d) causing the KPE partition to update its common values according to the change list; and (e) altering any change list originating at the KPE partition into a format readily usable by a process in a non-KPE partition and communicating said formatted change list to said non-KPE partition.

Claim 3

The method according to claim 1, wherein the object in the KPE partition includes a frame, each frame having a frame name, slot, facet, and value portion thereof; wherein said production system in the KPE partition further includes a frame manager for creating and manipulating frames among objects; wherein the common values are included in only those frames which constitute a common subset of all of the frames; and wherein the common values in non-KPE partitions are formatted as records.

Claim 4

The method according to claim 1, wherein a first application overlaying and executing on the KPE partition and a second application overlaying and executing on a non-KPE partition, each application selectively invoking said cooperative concurrent processes and perfecting synchronism of common values declaratively rather than explicitly.

Claim 5

A computer-implemented method for sharing common values implicitly between a pair of communicating generative objects, both objects residing in a cyclic, rule-based, object-sensitive production system, each object including rules and data structures, each rule having a pattern indication part and an action specifying part, at least one rule having an action part changing the data state of the object, any rule executed during a current cycle being selected from the set of rules defined by a match between changed data and the pattern part of said rules, said changed data being limited to that occurring during a preceding cycle, said rules also including "if-needed" procedures termed "demons" which execute whenever a predetermined pattern or event occurs independent of any context or goal concurrently being executed by said production system, comprising the steps of: (a) at a first object when executing, creating, altering, or deleting at least one common value, forming a list of such changes, and communicating said change list to a second object independent of and concurrently with any procedural request; (b) at the second object when executing and responsive to the change list, updating its common values; and (c) terminating the communicating relationship between said objects by either object self-extinguishing when executing.

Claim 6

A computer-implemented method for sharing common values implicitly between a pair of communicating generative objects, both objects residing in a cyclic, rule-based, object-sensitive production system, each object including rules and data structures, each rule having a pattern indication part and an action specifying part, at least one rule having an action part changing the data state of the object, any rule executed during a current cycle being selected from the set of rules defined by a match between changed data and the pattern part of said rules, said changed data being limited to that occurring during a preceding cycle, said rules also including "if-needed" procedures termed "demons" which execute whenever a predetermined pattern or event occurs independent of any context or goal concurrently being executed by said production system, comprising the steps of: (a) at a first object when executing, creating, altering, or deleting at least one common value, forming a list of such changes, and communicating said change list to a second object independent of and concurrently with any procedural request; (b) at the second object when executing and responsive to the change list, updating its common values; and (c) terminating the communicating relationship between said objects by either object self-extinguishing when executing.

Claim 7

The method according to claim 4, wherein each object is organized as a frame, each frame having a frame name, slot, facet, and value portion thereof; wherein said system further includes a frame manager for creating and manipulating frames among objects; and wherein the common values are included in only those frames which constitute a common subset of all of the frames.

Claim 8

The method according to claim 5, wherein selected frame facets are correlated with selected demons.

Claim 9

A computer-implemented method for implicitly altering the data state of common values shared by a pair of communicating generative objects, a first object residing in a cyclic, rule-based, object-sensitive production system otherwise termed a knowledge processing environment (KPE), and a second object residing in a data processing environment (DPE), the KPE resident object including rules and data structures, said rules including "if-needed" procedures termed "demons" which execute whenever a predetermined pattern or event occurs independent of any context or goal concurrently being executed by said production system, rules other than "demons" having context-dependent pattern indication and action specifying parts thereof, said KPE including means for storing the objects, and means cooperating with the storage means for executing a control cycle, said control cycle comprising the steps of: (i) identifying an executable subset of rules by matching the pattern parts of the rules to those objects in the storage means modified or created during a preceding cycle, (ii) selecting a rule from the identified rules, and (iii) executing the action prescribed by the selected rule; said method comprising the steps of: (a) in the event that said DPE object when executing creates, modifies, or deletes at least one common value, forming a list of such changes, and communicating said change list from the DPE object to the KPE object; (b) at the KPE object when executing and responsive to the DPE change list, altering the KPE data state by updating of the KPE common values; (c) in the event that said KPE object when executing creates, modifies, or deletes at least one common value, causing the formation of another list of such changes, and communicating said other list from the KPE object to the DPE object in a readily usable format; (d) at the DPE object when executing and responsive to the KPE change list, altering the DPE data state by updating the DPE common values; and (e) terminating the communicating relationship between said objects by either object self-extinguishing when executing.

Claim 10

A computer-implemented method for implicitly altering the data state of common values shared by a pair of communicating generative objects, a first object residing in a cyclic, rule-based, object-sensitive production system otherwise termed a knowledge processing environment (KPE), and a second object residing in a data processing environment (DPE), the KPE resident object including rules and data structures, said rules including "if-needed" procedures termed "demons" which execute whenever a predetermined pattern or event occurs independent of any context or goal concurrently being executed by said production system, rules other than "demons" having context-dependent pattern indication and action specifying parts thereof, said KPE including means for storing the objects, and means cooperating with the storage means for executing a control cycle, said control cycle comprising the steps of: (i) identifying an executable subset of rules by matching the pattern parts of the rules to those objects in the storage means modified or created during a preceding cycle, (ii) selecting a rule from the identified rules, and (iii) executing the action prescribed by the selected rule; said method comprising the steps of: (a) in the event that said DPE object when executing creates, modifies, or deletes at least one common value, forming a list of such changes, and communicating said change list from the DPE object to the KPE object; (b) at the KPE object when executing and responsive to the DPE change list, altering the KPE data state by updating of the KPE common values; (c) in the event that said KPE object when executing creates, modifies, or deletes at least one common value, causing the formation of another list of such changes, and communicating said other list from the KPE object to the DPE object in a readily usable format; (d) at the DPE object when executing and responsive to the KPE change list, altering the DPE data state by updating the DPE common values; and (e) terminating the communicating relationship between said objects by either object self-extinguishing when executing.

Claim 11

The method according to claim 7, wherein step (c) includes the step of invoking demons to effectuate altering the KPE data state of common values and creating the change list.

Claim 12

The method according to claim 7, wherein the KPE being operable within a host-based stored program-controlled computer and the DPE being operable with a terminal remote from said host but communicatively attached thereto.

Claim 13

The method according to claim 7, wherein each object in the KPE storage means is organized as a frame, each frame having a frame name, slot, facet, and value portion thereof; wherein said system further includes a frame manager for creating and manipulating frames in said storage means; and wherein the common values are included in only those frames which constitute a common subset of all of the frames stored in the KBS storage means.

Claim 14

The method according to claim 10, wherein selected frame facets are correlated with selected demons.