Defeasible Classifications and Inferences from Definitions

We contend that it is possible to argue reasonably for and against arguments from classifications and definitions, provided they are seen as defeasible (subject to exceptions and critical questioning). Arguments from classification of the most common sorts are shown to be based on defeasible reasoning of various kinds represented by patterns of logical reasoning called defeasible argumentation schemes. We show how such schemes can be identified with heuristics, or short-cut solutions to a problem. We examine a variety of arguments of this sort, including argument from abductive classification, argument from causal classification, argument from analogy-based classification and arguments from classification based on generalizations