Abstract: A rule-based data processing apparatus includes a processor coupled with at least first and second stores. The first store holds respective defining rule-sets for two or more groups of agents. The second store holds data defining respective objects with associated qualifier terms. The first group, of agents defined as script agents, are arranged as a sequentially enabled chain, with one or more of the script agents including references to respective objects and specified qualifier terms. The second group, of agents defined as object agents, identify objects and specified qualifier terms from the script agents, and identify each instance of that object with a correct associated qualifier in the second store. The object agents handle referential expressions in a script or process specification by standing in for objects referred to.

Abstract: In a rule-based processor, populations of component agents are enabled to self-assemble into compound agents such as to give a degree of distributed artificial intelligence in a relatively simple system. The majority of component agents have top and bottom decision structures into which requesting agents can insert rules: the rule selected by a decision structure is the one which is valid following evaluation of a priority criteria and leads to the placing of a marker from the selecting agent to the requesting agent. With the two decision structures, behaviour trees may be formed from the top down or the bottom up, as required by the instantaneous situation to which the compound agent is responding.

Abstract: A data processing apparatus comprises a first memory (212) storing a set of rules, each in the form of at least one specific behavior defining a condition and at least one further behavior defining an associated response with the condition portion of each rule having a characteristic time delay, and a processor (220) operating to respond to any of the said conditions being satisfied by generating one or more further behaviors defining the associated response. A second memory (206) coupled via the processor (220) to a clock (226) maintains a record of behavior state changes ("events") and the time at which they occurred.

Abstract: A rule-based data processing system includes a memory having stored therein a number of groups of agents. Each group is defined by respective sets of rules, with the system running the respective sets of rules in parallel. The agents are in two clusters: "script agents" which are arranged as a sequentially enabled chain and "operator agents" arranged to carry out selected procedural steps. The selection of the procedural step is made within each operator agent based on of one or more external factors, and is triggered by enablement of a script agent of the sequence prior to that script agent carrying a marker identifying an operator agent.

Abstract: A data processing apparatus comprises apparatus arranged to model a number of modules (302,314) with each module containing a number of interconnected behaviours (320-325). A behaviour identified as a marker (304) is able to access a behaviour (321) within another module via an identify link (306) and from information denoting that behaviour within a look-up table (312) held in a further behaviour (310). Having established access, a direct identify link (316) can be set up between the selected behaviour (321) and a nominated behaviour (318) within the module containing the marker. This direct identify link is maintained when the identify link between the marker and the further behaviour is terminated, allowing the marker to go on and establish other direct links (330) to the internal behaviours of other modules (336).

Abstract: An RTA or similar rule-based agent (102) is enabled to construct a virtual simulation of its environment by the provision of an internal prediction module (100). The prediction module comprises a rule population run in tandem with the population (106) defining the agent behaviors. The prediction module rules represent predictions of agent behavior state changes and their accuracy is periodically checked (110), with more accurate rules being assigned a higher fitness rating. A genetic algorithm (108) defines mutation operators by which further rules are evolved from those having the highest fitness. When a predetermined level of fitness (prediction accuracy) is achieved, the prediction module rules provide (116) a virtual simulation of the environment to the agent behaviors by direct control in place of external (real world) stimuli.

Abstract: A data processing apparatus includes apparatus for modelling asynchronous logic circuits as at least two of circuit elements the functions of which are governed by a set of rules each defining a response to a given condition. For elements functioning as registers (x,b) a "copy" rule may be applied to at least one of them (x) with the associated response to the copy rule being the change of the output state of that register element (218,220) in response to a change of output state of a further register element (b) identified by the copy rule. A further "identify" rule (200-226) may be applied to pairs of the register elements (x,b), according to which rule copy rules are applied to each element of the pair (216-222) in respect of changes of output state of the other. The apparatus may be arranged to model a number of asynchronous logic circuits in a working memory area with interconnections between such circuits being established by use of the identify rule.

Abstract: A data processing apparatus includes a unit (60,68) for modelling a first asynchronous logic circuit as a plurality of circuit elements the functions of which are governed by a set of rules each defining a response to a given condition. For elements functioning as registers, units are provided to apply a constraint (for example an algebraic or Boolean relationship) linking the internal values or output states of two or more of the registers. In response to a change in the internal value or output state of one of the registers, the corresponding one of the internal value or output state of the or one of the other registers is modified to maintain validity of the constraint. Each of the registers has a pointer (VP) to a respective data value or constraint information held in storage (67).

Abstract: A data processing apparatus includes a computer (1), a detector (2) for external events signalled on a set of input lines (7,8, etc.), and a real time clock 3. A table (20) of rules (24) is included in the computer storage (19). The computer is programmed to respond to a condition, (B,t) stored in a field (26,27) of a rule, being satisfied by generating an associated response (R) stored in a field (28) of that rule. The condition part of each rule requires the continous presence of a specific internal or external behavior (B) stored in the field 26 for a specific finite time (t) stored in the field 27 in order for the rule to be fired. Each time a change of internal behavior occurs due to the firing of a rule, and each time a change of external behavior occurs, signalled on one of the lines 7,8 etc.

Abstract: A method is provided for controlling the movement of an object 1, 61, in an environment 64. The method involves making predictions of collisions, given the outlines of the object and the environment, so that avoiding action can be taken. The object and environment are modelled as clusters of interpenetrating spherical bubbles, the model comprising the relative positions of the centers 6, 7, 8, 9, and 21 to 28 inclusive of the bubbles and their respective radii. The model simplifies the prediction of the point of collision of two such modelled objects by examining the collisions between bubbles only. An early, safe, approximate prediction of the collision can be obtained using Newton's approximation.