MULLEN@SUMEX-AIM.ARPA (07/18/84)
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
[Forwarded from the Stanford SIGLUNCH distribution by Laws@SRI-AI.]
DATE: Friday, July 20, 1984
LOCATION: Chemistry Gazebo, between Physical & Organic Chemistry
TIME: 12:05
SPEAKER: Bill Clancey
Heuristic Programming Project
Stanford University
TOPIC: Classification Problem Solving
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.