The members of this family are sharply characterized by their representation of acquired
knowledge as decision trees. This is a relatively simple knowledge formalism
that lacks the expressive power of semantic networks or other first-order representations.
As a consequence of this simplicity, the learning methodologies used in the
TDIDT family are considerably less complex than those employed in systems that can
express the results of their learning in a more powerful language. Nevertheless, it is
still possible to generate knowledge in the form of decision trees that is capable of
solving difficult problems of practical significance.