Red Hat, Inc.

Luca Molteni

Mark Proctor

Matteo Mortari

Decision tables can be automatically validated on a computer according to some examples. In one example, a system can determine a first set of values associated with a first column of a decision table and a second set of values associated with a second column of the decision table. The system can then determine that each respective value in the first set of values has a one-to-one relationship with a corresponding value in the second set of values. Based on determining that each respective value in the first set of values has the one-to-one relationship, the system determines that the first column and second column violate a third normal form (3NF) constraint. The system may then automatically rearrange the first and second columns into separate decision tables that comply with the 3NF constraint.

Automatically validating decision tables

Aspects and features of the present disclosure can reconcile node sharing within a production rule network that is fully coded in a compiled language. As an example, the shared, stateless class can represent constraints shared by the alpha node of a rete network. Code can be post processed to create a shared stateless class defined in memory. When the rule engine is executed and the rule network is produced, the shared stateless class can be referenced to evaluate a constraint shared by a node of the production rule network, reducing the number of classes stored in memory. Garbage collection can be used within the shared stateless class, deleting objects from memory structure when no longer used, further improving storage efficiency.

Growing community of inventors

Milan, Italy

Luca Molteni