Using Animation in Diagrammatic Theorem Proving

  • Daniel Winterstein
  • Alan Bundy
  • Corin Gurr
  • Mateja Jamnik
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2317)

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.

References

  1. 1.
    J. Barwise & J. Etchemendy “Heterogeneous Logic” in Diagrammatic Reasoning: Cognitive and Computational Perspectives. AAAI Press/The MIT Press, 1995.Google Scholar
  2. 2.
    A. Bierce “Fantastic Fables: The Flying Machine” 1899. Project Gutenberg e-text 1995, ftp://ftp.ibiblio.org/pub/docs/books/gutenberg/etext95/fanfb10.txt
  3. 3.
    J. Howse, F. Molina & J. Taylor “On the Completeness and Expressiveness of Spider Diagram Systems” proceedings of the 1st International Conference on Theory and Application of Diagrams. pp26–41, Springer-Verlag, 2000.Google Scholar
  4. 4.
    B. Fraser “Structuralism” course notes, Cambridge University. Available online at http://www.classics.cam.ac.uk/Faculty/structuralism.html, 1999.
  5. 5.
    J. Gil, J. Howse & S. Kent “Towards a Formalization of Constraint Diagrams” Symposium on Visual Languages and Formal Methods. IEEE, 2001.Google Scholar
  6. 6.
    J. Gil & Y. Sorkin “The Constraint Diagrams Editor” Available online at http://www.cs.technion.ac.il/Labs/ssdl/research/cdeditor, 1999-2000.
  7. 7.
    C. Gurr, J. Lee & K. Stenning “Theories of Diagrammatic Reasoning: Distinguishing Component Problems” in Minds & Machines 8(4) pp533–557, Kluwer Academic, 1998.CrossRefGoogle Scholar
  8. 8.
    E. Hammer “Reasoning with Sentences and Diagrams” in “Working Papers on Diagrams and Logic” editors G. Allwein & J. Barwise, Indiana University Logic Group, 1993.Google Scholar
  9. 9.
    P.J. Hayes & G.L. Laforte “Diagrammatic Reasoning:Analysis of an Example” in “Formalizing Reasoning with Visual and Diagrammatic representations: Papers from the 1998 AAAI Fall Symposium” editors G. Allwein, K. Marriott & B. Meyer, 1998.Google Scholar
  10. 10.
    G. Klima “Existence and Reference in Medieval Logic” in “New Essays in Free Logic” editors A. Hieke & E. Morscher, Kluwer Academic, 2001.Google Scholar
  11. 11.
    T.W. Körner “Analysis” lecture notes, Cambridge University. Available online at http://ftp.dpmms.cam.ac.uk/pub/twk/Anal.ps, 1998.
  12. 12.
    L.K. Schubert “Extending the Expressive Power of Semantic Networks” in Artificial Intelligence. 7(2) pp163–198, Elsevier, 1976.CrossRefMathSciNetGoogle Scholar
  13. 13.
    A. Sloman “Interactions Between Philosophy and A.I.: The Role of Intuition and Non-Logical Reasoning in Intelligence” proceedings 2nd International Joint Conference on Artificial Intelligence, 1971.Google Scholar
  14. 14.
    D. Winterstein “Diagrammatic Reasoning in a Continuous Domain” CISA Ph.D. Research Proposal, Edinburgh University. Available online at http://www.dai.ed.ac.uk/homes/danielw/academic, 2001.

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