Fast convert OR-decision table to decision tree

Recently a new type of decision table has been proposed, OR-decision table. The idea of the OR-decision table is one in which any of the actions in the set may be performed in order to satisfy the corresponding condition, while the classical decision table requires the execution of all the actions in the set of actions (AND-decision table). Due to the characteristic of the OR-decision table, this paper proposes the fast OR-decision table conversion to a decision tree algorithm.