Using Animation in Diagrammatic Theorem Proving

  • Daniel Winterstein
  • Alan Bundy
  • Corin Gurr
  • Mateja Jamnik
Conference paper

DOI: 10.1007/3-540-46037-3_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2317)
Cite this paper as:
Winterstein D., Bundy A., Gurr C., Jamnik M. (2002) Using Animation in Diagrammatic Theorem Proving. In: Hegarty M., Meyer B., Narayanan N.H. (eds) Diagrammatic Representation and Inference. Diagrams 2002. Lecture Notes in Computer Science, vol 2317. Springer, Berlin, Heidelberg

Abstract

Diagrams have many uses in mathematics, one of the most ambitious of which is as a form of proof. The domain we consider is real analysis, where quantification issues are subtle but crucial. Computers offer new possibilities in diagrammatic reasoning, one of which is animation. Here we develop animated rules as a solution to problems of quantification. We show a simple application of this to constraint diagrams, and also how it can deal with the more complex questions of quantification and generalisation in diagrams that use more specific representations. This allows us to tackle difficult theorems that previously could only be proved algebraically.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Daniel Winterstein
    • 1
  • Alan Bundy
    • 1
  • Corin Gurr
    • 1
  • Mateja Jamnik
    • 2
  1. 1.Division of InformaticsUniversity of EdinburghEdinburghUK
  2. 2.School of Computer ScienceUniversity of BirminghamBirminghamUK

Personalised recommendations