The embodiment of this disclosure may include a rule engine that adds a plurality of objects into a working memory, and processes the plurality of objects through a plurality of rules stored in a rule repository. Then, the rule engine may create a rule network comprising a root node and a child node based on the plurality of rules, and associate the root node with a predetermined list of object references. The rule engine may build a multi-object sub-token based on the plurality of objects that satisfy the predetermined list of object references. Then, the rule engine may pass the multi-object sub-token from the root node to the child node.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method, comprising: receiving a plurality of objects into a working memory of a rule engine, processing, via the rule engine, the plurality of objects through a plurality of rules stored in a rule repository, creating, via the rule engine, a rule network based on the plurality of rules, the rule network comprising a root node and a child node, associating, via the rule engine, the root node with a predetermined list of object references, building, at the root node, a multi-object sub-token based on the plurality of objects that satisfy the predetermined list of object references, and passing the multi-object sub-token from the root node to the child node. 2. The method of claim 1, wherein the predetermined list of object references are configured to be directly referenced to the root node. 3. The method of claim 1, wherein the predetermined list of object references comprises a list of object references configured to be aggregated together in a specific order. 4. The method of claim 3, wherein the multi-object sub-token comprises a list of the plurality of objects that satisfies the specific order of the predetermined list of object references. 5. The method of claim 1, further comprising: tracking the relationship between two object references of the predetermined list of object references using a token index within the root node, wherein the token index is determined based on a number of object references between the two object references in the predetermined list of object references. 6. The method of claim 1, further comprising: determining when an ancestor node to the root node has been modified, wherein, in response to a determination that the ancestor node has been modified, the rule engine is configured to process an object after determining that the ancestor node has already processed the object. 7. A system comprising: a working memory configured to receive a plurality of objects; and a rule engine configured to: process the plurality of objects through a plurality of rules stored in a rule repository, create a rule network based on the plurality of rules, the rule network comprising a root node and a child node, associate the root node with a predetermined list of object references, build a multi-object sub-token based on the plurality of objects that satisfy the predetermined list of object references, and pass the multi-object sub-token from the root node to the child node. 8. The system of claim 7, wherein the predetermined list of object references are configured to be directly referenced to the root node. 9. The system of claim 7, wherein the predetermined list of object references comprises a list of object references configured to be aggregated together in a specific order. 10. The system of claim 9, wherein the multi-object sub-token comprises a list of the plurality of objects that satisfies the specific order of the predetermined list of object references. 11. The system of claim 7, the rule engine further configured to: track the relationship between two object references of the predetermined list of object references using a token index within the root node, wherein the token index is determined based on a number of object references between the two object references in the predetermined list of object references. 12. The system of claim 7, the rule engine further configured to: determine when an ancestor node to the root node has been modified, wherein, in response to a determination that the ancestor node has been modified, the rule engine is configured to process an object after determining that the ancestor node has already processed the object. 13. A computer program product comprising: a computer-readable storage medium having computer-readable program code embodied therewith, the computer-readable program code comprising: computer readable program code configured to receive a plurality of objects; computer readable program code configured to process the plurality of objects through a plurality of rules stored in a rule repository; computer readable program code configured to create a rule network based on the plurality of rules, the rule network comprising a root node and a child node; computer readable program code configured to associate the root node with a predetermined list of object references; computer readable program code configured to build a multi-object sub-token based on the plurality of objects that satisfy the predetermined list of object references; and computer readable program code configured to pass the multi-object sub-token from the root node to the child node. 14. The computer program product of claim 13, wherein the predetermined list of object references are configured to be directly referenced to the root node. 15. The computer program product of claim 13, wherein the predetermined list of object references comprises a list of object references configured to be aggregated together in a specific order. 16. The computer program product of claim 15, wherein the multi-object sub-token comprises a list of the plurality of objects that satisfies the specific order of the predetermined list of object references. 17. The computer program product of claim 13, the computer-readable program code further comprising: computer readable program code configured to track the relationship between two object references of the predetermined list of object references using a token index within the root node, wherein the token index is determined based on a number of object references between the two object references in the predetermined list of object references. 18. The computer program product of claim 13, the computer-readable program code further comprising: computer readable program code configured to determine when an ancestor node to the root node has been modified, wherein, in response to a determination that the ancestor node has been modified, the rule engine is configured to process an object after determining that the ancestor node has already processed the object.