Self-test 4

Self-Test 4

Classifying Prolog terms 1

You are advised to draw* the solutions for the question before you look at the answer.*

	Classifications are usually hierarchical, resulting in a tree structure with a general class at the parent node and subclasses at the child nodes. For instance :



	Using your knowledge of the built-in predicates described above, devise a classification of the Prolog data types with "term" as the most general node.