{"pk":31256,"title":"A Recognition Model of Geometry Theorem-Proving","subtitle":null,"abstract":"This paper describes POLYA, a computer program that writes geometry proofs. POLYA actively collects features from a geometry diagram on the basis of which it recognizes and applies knowledge from known examples. We present a vocabulary of visual targets, results, and actions to support incremental parsing of diagrams. W e also show how scripts can be used to organize visual actions into useful sequences. W e show how those sequences can be used to parse diagrams and instantiate proofs. Finally, we show how scripts represent the implicit spatial knowledge conveyed by examples.","language":"eng","license":{"name":"","short_name":"","text":null,"url":""},"keywords":[],"section":"Talks","is_remote":true,"remote_url":"https://escholarship.org/uc/item/31p7h3b1","frozenauthors":[{"first_name":"Tom","middle_name":"","last_name":"McDougal","name_suffix":"","institution":"University of Chicago","department":""},{"first_name":"Kristian","middle_name":"","last_name":"Hammond","name_suffix":"","institution":"University of Chicago","department":""}],"date_submitted":null,"date_accepted":null,"date_published":"1992-01-01T18:00:00Z","render_galley":null,"galleys":[{"label":"PDF","type":"pdf","path":"https://journalpub.escholarship.org/cognitivesciencesociety/article/31256/galley/22325/download/"}]}