Algorithm to represent Decision tables

Question

What would be the best algorithm to use if you wanted to store Decision tables in code, i've looked at the Adjacency matrix and Binary tree would anyone consider this to be the right direction? What other choices to I have?

Answer 1

If your focus is on space (for very large decision tables), you might want to consider applying Binary Decision Diagrams (BDDs). However, the canonical form would not tell you what action to take, just provide true/false answers for a large "input" of boolean input variables. This is less powerful than a decision table but very useful for certain applications.