Red Hat, Inc.

Matteo Mortari

Luca Molteni

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

A method includes receiving a spreadsheet file representing a plurality of decision tables, wherein the spreadsheet file does not indicate dependencies between non-labeled inputs and non-labeled outputs of the plurality of decision tables. The method further includes, for a first decision table of the plurality of decision tables, identifying, in view of an identifier of a second decision table of the plurality of decision tables, a dependent input that comprises an output of the second decision table of the plurality of decision tables. The method further includes determining, by a processing device, in view of an ordering of columns in the spreadsheet file, remaining inputs and outputs of the first decision table.

Growing community of inventors

Milan, Italy

Matteo Mortari