BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-84-1018
       ENTRY:: May 27, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Classification problem solving
        TYPE:: Technical Report
      AUTHOR:: Clancey, William J.
        DATE:: July 1984
       PAGES:: 28
    ABSTRACT:: A broad range of heuristic programs--embracing forms of
               diagnosis. catalog selection, and skeletal
               planning--accomplish a kind of well-structured problem
               solving called classification. These programs have a
               characteristic inference structure that systematically
               relates data to a pre-enumerated set of solutions by
               abstraction, heuristic association, and refinement. This
               level of description specifies the knowledge needed to solve
               a problem, independent of its representation in a particular
               computer language. The classification problem-solving model
               provides a useful framework for recognizing and representing
               similar problems, for designing representation tools, and for
               understanding the problem-solving methods used by
               non-classification programs.
       NOTES:: [Adminitrivia V1/Prg/19950527]
         END:: STAN//CS-TR-84-1018