Presents a model of the structure of logic considered necessary for computer processing of metaphorical language. Formally states and diagrams the algorithm for metaphors, isolating domain distance, predicate inequality, and hyperbole as particularly important factors. Distinguishes explanatory literal analogies from expressive metaphors, concluding that their relation to one another is more important than the relation between metaphors and similes. (AEM)