@inproceedings{6ae13c5835934c4095ec886701ec68d1,

title = "A Proposal for Automatic Diagrammatic Reasoning in Continuous Domains",

abstract = "This paper presents one approach to the formalisation of diagrammatic proofs as an alternative to algebraic logic. An idea of {\textquoteleft}generic diagrams{\textquoteright} is developed whereby one diagram (or rather, one sequence of diagrams) can be used to prove many instances of a theorem. This allows the extension of Jamnik{\textquoteright}s ideas in the Diamond system to continuous domains. The domain is restricted to non-recursive proofs in real analysis whose statement and proof have a strong geometric component. The aim is to develop a system of diagrams and redraw rules to allow a mechanised construction of sequences of diagrams constituting a proof. This approach involves creating a diagrammatic theory. The method is justified formally by (a) a diagrammatic axiomatisation, and (b) an appeal to analysis, viewing the diagram as an object inℝ2. The idea is to then establish an isomorphism between diagrams acted on by redraw rules and instances of a theorem acted on by rewrite rules. We aim to implement these ideas in an interactive prover entitled Rap (the Real Analysis Prover).",

author = "D. Winterstein and Alan Bundy and M. Jamnik",

year = "2000",

language = "English",

isbn = "3-540-67915-4",

series = "Lecture Notes in Computer Science",

publisher = "Springer-Verlag GmbH",

booktitle = "Theory and Application of Diagrams",

}