Some comments on the use of ambiguous decision tables and their conversion to computer programs
Communications of the ACM
On the conversion of decision tables to computer programs
Communications of the ACM
Ambiguity in limited entry decision tables
Communications of the ACM
Switching Circuits for Engineers
Switching Circuits for Engineers
On the emulation of flowcharts by decision tables
Communications of the ACM
No ifs, ands, or buts: uncovering the simplicity of conditionals
Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
Towards directly applied ontological constraints in a semantic decision table
RuleML'11 Proceedings of the 5th international conference on Rule-based modeling and computing on the semantic web
Using SOIQ(D) to formalize semantics within a semantic decision table
RuleML'12 Proceedings of the 6th international conference on Rules on the Web: research and applications
| Hi-index | 48.23 |
In this paper an algorithm to detect logical errors in a limited-entry decision table and in loop-free programs with embedded decision tables is developed. All the conditions in the decision tables are assumed to be inequalities or equalities relating linear expressions. It is also assumed that actions in a decision table are linear in variables which occur in the condition stub of the decision table (or tables) to which control is transferred from the table. The algorithm is based on determining whether a set of linear inequalities has or does not have a solution. The algorithm described in the paper is implemented in Fortran IV.