Representing and using procedural knowledge to build geometry proofs

Authors:
Thomas F. McDougal;Kristian J. Hammond
Affiliations:
Department of Computer Science, University of Chicago, Chicago, IL;Department of Computer Science, University of Chicago, Chicago, IL
Venue:
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Year:
1993

Citing 4
Cited 0

Case-based planning: viewing planning as a memory task

Case-based planning: viewing planning as a memory task
Animate vision

Artificial Intelligence
Direct memory access parsing

Direct memory access parsing
Adaptive execution in complex dynamic worlds

Adaptive execution in complex dynamic worlds

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.