A Reification of a Strategy for Geometry Theorem Proving

Noboru Matsuda and Kurt VanLehn

For many years, designers of ITS have tried to use the power of a well-designed graphical user interface (GUI) to help students learn complex problem solving strategies.  The basic idea is to display the reasoning in a graphical, manipulable form --- to "reify"' (make real) the reasoning.  In this paper, we point out flaws in some common techniques for reification and suggest a new one.  Our basic idea is to reify the search process rather than the structure of the ultimate solution.  We show how this reification technique can be applied to a specific complex problem solving task domain, geometry theorem proving with construction, for which we are building an ITS.

• PDF format (102KB)