Abstract

We introduce a conceptual framework for discovery of theorems in geometry and a mechanism which systematically discovers such theorems. Our mechanism incrementally generates geometrical situations, makes conjectures about them, uses a geometry theorem prover to determine the consistency of situations, and keeps valid conjectures as theorems. We define geometry situations, situation descriptions, theorems, and their relationships important to understand our discovery task. An exhaustive generator of situation descriptions has enormous combinatorial complexity. We analyze various ways to reduce that complexity. Ideally, the generator should create a single description of each situation, should generate more general situations before more specific ones, and should use the previously discovered theorems to constrain its generation mechanism. We describe our generator which possesses most of these properties, and we outline further improvements. Our theorem prover is based on Wu's algebraic method for proving geometry theorems. We discuss the interface between our situation generator and theorem prover and the limitations of our discovery system. Examples of theorems discovered by our system are also presented.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.