ABSTRACT
Decision tables have been used to represent and analyze complex logical relationships for decades. Decision tables also form a skeleton to guide requirements elicitation between customers and developers. Decision tables in which all the conditions are binary are called limited entry decision tables (LEDT). Decision tables in which all the conditions have a finite number of alternative values are called extended entry decision tables (EEDT). Decision tables presume that all the values necessary to evaluate conditions are available at the onset of table rule execution. The rigorous structure of decision tables supports some interesting algebraic manipulations. When conditions refer to equivalence classes, decision tables have a characteristic appearance. The definition of the Insurance Premium Problem supports nearly direct development of a Mixed Entry Decision Table. Decision tables are clearly the model of choice for logic-intensive applications. This is particularly true when conditions refer to equivalence classes that have dependencies, as in NextDate.
