Advertisement

Solving Geometry Problems Using a Combination of Symbolic and Numerical Reasoning

  • Shachar Itzhaky
  • Sumit Gulwani
  • Neil Immerman
  • Mooly Sagiv
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8312)

Abstract

We describe a framework that combines deductive, numeric, and inductive reasoning to solve geometric problems. Applications include the generation of geometric models and animations, as well as problem solving in the context of intelligent tutoring systems.

Our novel methodology uses (i) deductive reasoning to generate a partial program from logical constraints, (ii) numerical methods to evaluate the partial program, thus creating geometric models which are solutions to the original problem, and (iii) inductive synthesis to read off new constraints that are then applied to one more round of deductive reasoning leading to the desired deterministic program. By the combination of methods we were able to solve problems that each of the methods was not able to solve by itself.

The number of nondeterministic choices in a partial program provides a measure of how close a problem is to being solved and can thus be used in the educational context for grading and providing hints.

We have successfully evaluated our methodology on 18 Scholastic Aptitude Test geometry problems, and 11 ruler/compass-based geometry construction problems. Our tool solved these problems using an average of a few seconds per problem.

Keywords

geometry reasoning synthesis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AHV95]
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)Google Scholar
  2. [Ald88]
    Aldefeld, B.: Variation of geometries based on a geometric-reasoning method. Computer Aided Design 20(3), 117–126 (1988)CrossRefzbMATHGoogle Scholar
  3. [BFH+95]
    Bouma, W., Fudos, I., Hoffmann, C.M., Cai, J., Paige, R.: Geometric constraint solver. Computer-Aided Design 27(6), 487–501 (1995)CrossRefzbMATHGoogle Scholar
  4. [Buc98]
    Buchberger, B.: Applications of Gröbner bases in non-linear computational geometry. In: Janßen, R. (ed.) Trends in Computer Algebra. LNCS, vol. 296, pp. 52–80. Springer, Heidelberg (1988)CrossRefGoogle Scholar
  5. [GKT11]
    Gulwani, S., Korthikanti, V., Tiwari, A.: Synthesizing geometry constructions. In: Programming Language Design and Implementation, PLDI (2011)Google Scholar
  6. [GMUW09]
    Garcia-Molina, H., Ullman, J.D., Widom, J.: Database systems - the complete book, 2nd edn. Pearson Education (2009)Google Scholar
  7. [Hon86]
    Hong, J.: Proving by example and gap theorems. In: FOCS, pp. 107–116. IEEE Computer Society (1986)Google Scholar
  8. [IGIS12]
    Itzhaky, S., Gulwani, S., Immerman, N., Sagiv, M.: Solving geometry problems using a combination of symbolic and numerical reasoning. Technical Report MSR-TR-2012-8, Microsoft Research (January 2012), http://www.cs.tau.ac.il/~shachar/dl/tr-2012.pdf
  9. [JMSY92]
    Jaffar, J., Michaylov, S., Stuckey, P.J., Yap, R.H.C.: The CLP(R) language and system. ACM Trans. Program. Lang. Syst. 14(3), 339–395 (1992)CrossRefGoogle Scholar
  10. [KKS12]
    Köksal, A.S., Kuncak, V., Suter, P.: Constraints as control. In: ACM SIGPLAN Symposium on Principles of Programming Languages, POPL (2012)Google Scholar
  11. [Kon92]
    Kondo, K.: Algebraic method for manipulation of dimensional relationships in geometric models. Computer-Aided Design 24(3), 141–147 (1992)CrossRefzbMATHGoogle Scholar
  12. [KR11]
    Krötzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: Walsh, T. (ed.) IJCAI, pp. 963–968. IJCAI/AAAI (2011)Google Scholar
  13. [Nel85]
    Nelson, G.: Juno, a constraint-based graphics system. In: SIGGRAPH, pp. 235–243 (1985)Google Scholar
  14. [SL08]
    Solar-Lezama, A.: Program Synthesis by Sketching. PhD thesis, University of California, Berkeley (2008)Google Scholar
  15. [swi]
  16. [WCY05]
    Wong, W.-K., Chan, B.-Y., Yin, S.-K.: A dynamic geometry environment for learning theorem proving. In: Proceedings of the 5th IEEE International Conference on Advanced Learning Technologies, ICALT 2005, Kaohsiung, Taiwan, July 05-08, pp. 15–17. IEEE Computer Society (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Shachar Itzhaky
    • 1
  • Sumit Gulwani
    • 2
  • Neil Immerman
    • 3
  • Mooly Sagiv
    • 1
  1. 1.Tel Aviv UniversityIsrael
  2. 2.Microsoft ResearchRedmondUSA
  3. 3.University of MassachusettsAmherstUSA

Personalised recommendations