Deterministic Rule Assessment Framework for Traceable Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional rule engines produce inconsistent results due to non-deterministic rule application order, making it difficult to replay or troubleshoot processes, especially in systems like email filtering where rule changes occur dynamically.
Innovation Solution
Implementing a rule assessment framework with deterministic rule trees, where nodes include rules and pointers, ensuring consistent rule execution order and maintaining a tracker log for troubleshooting and error detection.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If rules are applied in any order in a conventional rule engine, then the rule engine can process conditions dynamically, but the results become inconsistent and non-deterministic
Solution Approach 1:
The patent applies preliminary action by determining the complete set of applicable rules before executing any rule actions. The system identifies all rules that match the current condition, stores them in a determined set, and then executes them in a fixed order. This prevents intermediate condition changes from affecting rule selection, ensuring deterministic and consistent results while maintaining dynamic adaptability.
2Adaptability or versatility
If rules are re-evaluated after each action changes the condition or dataset, then the rule engine responds to dynamic changes, but the processing becomes inefficient and may produce inconsistent results
Solution Approach 1:
The system performs preliminary evaluation to determine all applicable rules before any actions are executed. This determined set of rules is then executed completely without re-evaluation, even if actions change the condition or dataset. This approach maintains responsiveness to dynamic changes while significantly improving processing efficiency by avoiding redundant re-evaluations.
3Adaptability or versatility
If the order of rule application is not deterministic, then the rule engine can handle complex conditional logic, but troubleshooting and replay become difficult
Solution Approach 1:
The patent determines the complete set of applicable rules in advance, before any actions are executed. This determined set is then executed in a fixed, predictable order that can be logged and replayed. This approach maintains the ability to handle complex conditional logic while enabling effective troubleshooting and replay by ensuring the same conditions always produce the same rule execution sequence.
Data Source
AI summary
A method includes assessing an input in a buffer against a rule in a first node of a rule tree to determine that an action should be performed and updating the buffer with results of performing the action. The method also includes inserting an indication of the input, the rule, and the results of performing the action into a tracker log and passing the updated buffer to a second node in the rule tree in response to determining that the first node points to the second node.