论文信息 - Representing and Using Procedural Knowledge to Build Geometry Proofs

Representing and Using Procedural Knowledge to Build Geometry Proofs

What is the nature of expertise? This paper posits an answer to that question in the domain of geometry problem-solving. We present a computer program called POLYA which makes use of explicit planning knowledge to solve geometry proof problems, integrating the processes of parsing the diagram and writing the proof.

Kristian J. Hammond | Thomas F. McDougal | K. Hammond | T. McDougal

[1] John R. Anderson,et al. Abstract Planning and Perceptual Chunks: Elements of Expertise in Geometry , 1990, Cogn. Sci..

[2] Herbert A. Simon,et al. Models of Competence in Solving Physics Problems , 1980, Cogn. Sci..

[3] Richard Rhoad,et al. Geometry: For Enjoyment and Challenge , 1981 .

[4] Dana H. Ballard,et al. Animate Vision , 1991, Artif. Intell..

[5] Kristian J. Hammond,et al. Case-Based Planning: Viewing Planning as a Memory Task , 1989 .

[6] Philip E. Agre,et al. The dynamic structure of everyday life , 1988 .

[7] H. Gelernter,et al. Realization of a geometry theorem proving machine , 1995, IFIP Congress.

[8] James G. Greeno,et al. Forms of understanding in mathematical problem-solving , 1983 .

[9] Philip E. Agre,et al. ABSTRACT REASONING AS EMERGENT FROM CONCRETE ACTIVITY , 1987 .

[10] A. J. Nevins,et al. Plane Geometry Theorem Proving Using Forward Chaining , 1975, Artif. Intell..

[11] Charles Eugene Martin,et al. Direct memory access parsing , 1992 .

[12] Robert James Firby,et al. Adaptive execution in complex dynamic worlds , 1989 .

[13] James J. Clark,et al. Modal Control Of An Attentive Vision System , 1988, [1988 Proceedings] Second International Conference on Computer Vision.